Information-Theoretic Secrecy with Access to Decryption Oracles

スポンサーリンク

概要

• 論文の詳細を見る

• We analyze the security notion of information-theoretic secrecy against an adversary who can make l adaptive queries to the decryption oracle, and show that it is equivalent to requiring that the encryption scheme can perfectly encrypt l+1 different messages. This immediately yields a lower bound on the key length and an optimal construction, namely (l+1)-wise independent permutations. This also gives an operational interpretation to the notion of decryption oracles in information-theoretic security.

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

著者

• TANAKA Keisuke

  Tokyo Institute of Technology

• Portmann Christopher

  Tokyo Institute Of Technology

• Tanaka Keisuke

  Tokyo Inst. Of Technol.

関連論文

• A Rational Secret-Sharing Scheme Based on RSA-OAEP
• Information-Theoretic Secrecy with Access to Decryption Oracles

スポンサーリンク