An Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme

スポンサーリンク

概要

• 論文の詳細を見る

• It is known that composable secure commitments, that is, concurrent non-malleable commitments exist in the plain model, based only on standard assumptions such as the existence of claw-free permutations or even one-way functions. Since being based on the plain model, the deniability of them is trivially satisfied, and especially the latter scheme satisfies also adaptivity, hence it is adaptive-deniable-concurrent non-malleable. However, those schemes cannot be said to be practically efficient. We show a practically efficient (string) adaptive-deniable-concurrent commitment scheme is possible under a global setup model, called the Global CRS-KR model.

• （社）電子情報通信学会の論文
• 2011-01-01

著者

• ARITA Seiko

  Institute of Information Security

関連論文

• A Straight-Line Extractable Non-malleable Commitment Scheme(Information Security)
• An Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme
• Identification Schemes from Key Encapsulation Mechanisms
• An Identification Scheme with Tight Reduction(Information Security)

スポンサーリンク