Security Formalizations and Their Relationships for Encryption and Key Agreement in Information-Theoretic Cryptography
- 1 January 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 64 (1), 654-685
- https://doi.org/10.1109/TIT.2017.2744650
Abstract
This paper analyzes the formalizations of information-theoretic security for the fundamental primitives in cryptography: symmetric-key encryption and key agreement. Revisiting the previous results, we can formalize information-theoretic security using different methods, by extending Shannon's perfect secrecy, by information-theoretic analogues of indistinguishability and semantic security, and by the frameworks for composability of protocols. We show the relationships among the security formalizations and obtain the following results. First, in the case of encryption, there are significant gaps among the formalizations, and a certain type of relaxed perfect secrecy or a variant of information-theoretic indistinguishability is the strongest notion. Second, in the case of key agreement, there are significant gaps among the formalizations, and a certain type of relaxed perfect secrecy is the strongest notion. In particular, in both encryption and key agreement, the formalization of composable security is not stronger than any other formalizations. Furthermore, as an application of the relationships in encryption and key agreement, we simultaneously derive a family of lower bounds on the size of secret keys and security quantities required under the above formalizations, which also implies the importance and usefulness of the relationships.Keywords
Funding Information
- JSPS KAKENHI (JP15H02710, JP17H01752)
This publication has 40 references indexed in Scilit:
- Key Recycling in AuthenticationIEEE Transactions on Information Theory, 2014
- Constructive Cryptography – A New Paradigm for Security Definitions and ProofsLecture Notes in Computer Science, 2012
- On the soundness of authenticate-then-encryptPublished by Association for Computing Machinery (ACM) ,2010
- Unbreakable Keys from Random NoisePublished by Springer Science and Business Media LLC ,2007
- Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle MethodologyLecture Notes in Computer Science, 2004
- Secret-key agreement over unauthenticated public channels-part I: definitions and a completeness resultIEEE Transactions on Information Theory, 2003
- A model for asynchronous reactive systems and its application to secure message transmissionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Indistinguishability of Random SystemsLecture Notes in Computer Science, 2002
- The Strong Secret Key Rate of Discrete Random TriplesPublished by Springer Science and Business Media LLC ,1994
- Secret key agreement by public discussion from common informationIEEE Transactions on Information Theory, 1993