Relations among Security Goals of Frobabilistic Public-Key Cryptosystems : Special Section on Cryptography and Information Security

スポンサーリンク

概要

• 論文の詳細を見る

• This paper newly formalizes some notions of security for probabilistic public-key encryption schemes. The framework for these notions was originally presented in the work by Bellare et al., in which they consider non-malleability and indistinguishability under chosen-plaintext attack, non-adaptive chosen-ciphertext attack and adaptive chosen-ciphertext attack. This paper extends the results of Bellare et al. By introducing two goals, equivalence undercidability and non-verifiability under the above three attack models. Such goals are sometimes required in electronic voting and bids systems. It is shown that equivalence undercidability, non-verifiability and indistinguishability are all equivalent under the three attack models.

• 社団法人電子情報通信学会の論文
• 2001-01-01

著者

• Kaji Yuichi

  The Authors Are With The Graduate School Of Information Science Nara Institute Of Science And Techno

• SUZUKI Ako

  The authors are with the Graduate School of Information Science, Nara Institute of Science and Techn

• WATANABE Hajime

  The author is with Computer Science Division, Electrotechnical Laboratory

• Suzuki Ako

  The Authors Are With The Graduate School Of Information Science Nara Institute Of Science And Techno

• Watanabe Hajime

  The Author Is With Computer Science Division Electrotechnical Laboratory

関連論文

• MAP and LogMAP Decoding Algorithms for Linear Block Codes Using a Code Structure(Special Section on Information Theory and Its Applications)
• Relations among Security Goals of Frobabilistic Public-Key Cryptosystems : Special Section on Cryptography and Information Security

スポンサーリンク