Information-Theoretic Secrecy with Access to Decryption Oracles

Christopher PORTMANN; Keisuke TANAKA

doi:10.1587/transfun.E94.A.1585

Information-Theoretic Secrecy with Access to Decryption Oracles

Christopher PORTMANN, Keisuke TANAKA

Full Text Views

0

Cite this

Summary :

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

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E94-A No.7 pp.1585-1590

Publication Date: 2011/07/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E94.A.1585

Type of Manuscript: LETTER

Category: Cryptography and Information Security

Cite this

Copy

Christopher PORTMANN, Keisuke TANAKA, "Information-Theoretic Secrecy with Access to Decryption Oracles" in IEICE TRANSACTIONS on Fundamentals, vol. E94-A, no. 7, pp. 1585-1590, July 2011, doi: 10.1587/transfun.E94.A.1585.
Abstract: We analyze the security notion of information-theoretic secrecy against an adversary who can make adaptive queries to the decryption oracle, and show that it is equivalent to requiring that the encryption scheme can perfectly encrypt +1 different messages. This immediately yields a lower bound on the key length and an optimal construction, namely (+1)-wise independent permutations. This also gives an operational interpretation to the notion of decryption oracles in information-theoretic security.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.1585/_p

Copy

@ARTICLE{e94-a_7_1585,
author={Christopher PORTMANN, Keisuke TANAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Information-Theoretic Secrecy with Access to Decryption Oracles},
year={2011},
volume={E94-A},
number={7},
pages={1585-1590},
abstract={We analyze the security notion of information-theoretic secrecy against an adversary who can make adaptive queries to the decryption oracle, and show that it is equivalent to requiring that the encryption scheme can perfectly encrypt +1 different messages. This immediately yields a lower bound on the key length and an optimal construction, namely (+1)-wise independent permutations. This also gives an operational interpretation to the notion of decryption oracles in information-theoretic security.},
keywords={},
doi={10.1587/transfun.E94.A.1585},
ISSN={1745-1337},
month={July},}

Copy

TY - JOUR
TI - Information-Theoretic Secrecy with Access to Decryption Oracles
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1585
EP - 1590
AU - Christopher PORTMANN
AU - Keisuke TANAKA
PY - 2011
DO - 10.1587/transfun.E94.A.1585
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2011
AB - We analyze the security notion of information-theoretic secrecy against an adversary who can make adaptive queries to the decryption oracle, and show that it is equivalent to requiring that the encryption scheme can perfectly encrypt +1 different messages. This immediately yields a lower bound on the key length and an optimal construction, namely (+1)-wise independent permutations. This also gives an operational interpretation to the notion of decryption oracles in information-theoretic security.
ER -