Information-Theoretic Secrecy With Access To Decryption Oracles
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES(2011)
摘要
We analyze the security notion of information-theoretic secrecy against an adversary who can make C 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.
更多查看译文
关键词
cryptography, information-theoretic security, encryption scheme, decryption oracle
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络