A Straight-Line Extractable Non-malleable Commitment Scheme(Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• Non-malleability is an important security property of commitment schemes. The property means security against the man-in-the-middle attack, and it is defined and proved in the simulation paradigm using the corresponding simulator. Many known non-malleable commitment schemes have the common drawback that their corresponding simulators do not work in a straight-line manner, requires rewinding of the adversary. Due to this fact, such schemes are proved non-malleable only in the stand-alone cases. In the multiple-instances setting, i.e., when the scheme is performed concurrently with many instances of itself, such schemes cannot be proved non-malleable. The paper shows an efficient commitment scheme proven to be non-malleable even in the multiple-instances setting, based on the KEA1 and DDH assumptions. Our scheme has a simulator that works in a straight-line manner by using the KEA1-extractor instead of the rewinding strategy.

• 2007-07-01

著者

• Arita Seiko

  Inst. Of Information Security Yokohama‐shi Jpn

• 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)

スポンサーリンク