Composable, Unconditionally Secure Message Authentication without any Secret Key

Ostrev, Dimiter

doi:10.1109/ISIT.2019.8849510

Download

Paper published in a book (Scientific congresses, symposiums and conference proceedings)

Composable, Unconditionally Secure Message Authentication without any Secret Key

Ostrev, Dimiter

2019 • In 2019 IEEE International Symposium on Information Theory (ISIT), Paris, France, 2019

Peer reviewed

Permalink
https://hdl.handle.net/10993/37480

DOI
10.1109/ISIT.2019.8849510

Files (1)Send to Details Statistics Bibliography Similar publications

Files

Full Text

ComposableUncondtionallySecureAuthenticationWithoutAnySecretKey20180404.pdf

Author preprint (400.15 kB)

Download

All documents in ORBilu are protected by a user license.

Send to

RIS BibTex APA Chicago Permalink X Linkedin

Details

Keywords :

Authentication; Information Theoretic Security; Composable Security; Noisy Channel Coding

Abstract :

[en] We consider a setup in which the channel from Alice to Bob is less noisy than the channel from Eve to Bob. We show that there exist encoding and decoding which accomplish error correction and authentication simultaneously; that is, Bob is able to correctly decode a message coming from Alice and reject a message coming from Eve with high probability. The system does not require any secret key shared between Alice and Bob, provides information theoretic security, and can safely be composed with other protocols in an arbitrary context.

Research center :

Interdisciplinary Centre for Security, Reliability and Trust (SnT) > Applied Security and Information Assurance Group (APSIA)

Disciplines :

Computer science

Author, co-author :

Ostrev, Dimiter ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)

External co-authors :

Language :

English

Title :

Composable, Unconditionally Secure Message Authentication without any Secret Key

Publication date :

2019

Event name :

2019 IEEE International Symposium on Information Theory (ISIT)

Event place :

Paris, France

Event date :

7-12 July 2019

Audience :

International

Main work title :

2019 IEEE International Symposium on Information Theory (ISIT), Paris, France, 2019

Publisher :

IEEE

ISBN/EAN :

978-1-5386-9291-2

Peer reviewed :

Peer reviewed

Focus Area :

Security, Reliability and Trust

Additional URL :

http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8849510&isnumber=8849208

FnR Project :

FNR8293135 - A Theory Of Matching Sessions, 2014 (01/05/2015-30/04/2018) - Peter Y. A. Ryan

Name of the research project :

FNR8293135 > Peter Y. A. Ryan > AToMS > A Theory of Matching Sessions

Available on ORBilu :

since 26 November 2018

Statistics

Number of views

78 (8 by Unilu)

Number of downloads

71 (2 by Unilu)

More statistics

Scopus citations^®

Scopus citations^®
without self-citations

WoS citations^™

Bibliography

Rudolf Ahlswede and Imre Csiszár. Common randomness in information theory and cryptography. i. secret sharing. IEEE Transactions on Information Theory, 39(4):1121-1132, 1993.
Michael Backes, Birgit Pfitzmann, and Michael Waidner. A general composition theorem for secure reactive systems. In Theory of Cryptography Conference, pages 336-354. Springer, 2004.
Mihir Bellare and Phil Rogaway. The game-playing technique. International Association for Cryptographic Research (IACR) ePrint Archive: Report, 331:2004, 2004.
Charles H Bennett and Gilles Brassard. Quantum cryptography: Public key distribution and coin tossing. In International Conference on Computers, Systems and Signal Processing (Bangalore, India, Dec. 1984), pages 175-9, 1984.
Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on, pages 136-145. IEEE, 2001.
Thomas M Cover and Joy A Thomas. Elements of information theory 2nd edition. Wiley-interscience, 2006.
Imre Csiszár and Janos Korner. Broadcast channels with confidential messages. IEEE transactions on information theory, 24(3):339-348, 1978.
Artur K Ekert. Quantum cryptography based on bells theorem. Physical review letters, 67(6):661, 1991.
Robert König, Renato Renner, Andor Bariska, and Ueli Maurer. Small accessible quantum information does not imply security. Physical Review Letters, 98(14):140502, 2007.
Lifeng Lai, Hesham El Gamal, and H Vincent Poor. Authentication over noisy channels. IEEE Transactions on Information Theory, 55(2):906-916, 2009.
Ueli Maurer. Indistinguishability of random systems. In International Conference on the Theory and Applications of Cryptographic Techniques, pages 110-132. Springer, 2002.
Ueli Maurer. Constructive cryptography-A new paradigm for security definitions and proofs. TOSCA, 6993:33-56, 2011.
Ueli Maurer. Conditional equivalence of random systems and indistinguishability proofs. In Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on, pages 3150-3154. IEEE, 2013.
Ueli Maurer and Renato Renner. Abstract cryptography. In In Innovations in Computer Science. Citeseer, 2011.
Ueli Maurer and Stefan Wolf. Secret-key agreement over unauthenticated public channels. i. definitions and a completeness result. IEEE Transactions on Information Theory, 49(4):822-831, 2003.
Ueli Maurer and Stefan Wolf. Secret-key agreement over unauthenticated public channels. II: The simulatability condition. IEEE Transactions on Information Theory, 49(4):832-838, 2003.
Ueli Maurer and Stefan Wolf. Secret-key agreement over unauthenticated public channels. IIi. privacy amplification. IEEE Transactions on Information Theory, 49(4):839-851, 2003.
Ueli M Maurer. Perfect cryptographic security from partially independent channels. In Proceedings of the twenty-Third annual ACM symposium on Theory of computing, pages 561-571. ACM, 1991.
Ueli M Maurer. Secret key agreement by public discussion from common information. IEEE transactions on information theory, 39(3):733-742, 1993.
Ueli M Maurer. Authentication theory and hypothesis testing. IEEE Transactions on Information Theory, 46(4):1350-1356, 2000.
Amitav Mukherjee, S Ali A Fakoorian, Jing Huang, and A Lee Swindlehurst. Principles of physical layer security in multiuser wireless networks: A survey. IEEE Communications Surveys & Tutorials, 16(3):1550-1573, 2014.
Jörn Müller-Quade and Renato Renner. Composability in quantum cryptography. New Journal of Physics, 11(8):085006, 2009.
Christopher Portmann. Key recycling in authentication. IEEE Transactions on Information Theory, 60(7):4383-4396, 2014.
Christopher Portmann and Renato Renner. Cryptographic security of quantum key distribution. arXiv preprint arXiv:1409.3525, 2014.
Renato Renner and Stefan Wolf. Unconditional authenticity and privacy from an arbitrarily weak secret. In Annual International Cryptology Conference, pages 78-95. Springer, 2003.
Renato Renner and Stefan Wolf. The exact price for unconditionally secure asymmetric cryptography. In EUROCRYPT, volume 3027, pages 109-125. Springer, 2004.
Victor Shoup. Sequences of games: a tool for taming complexity in security proofs. IACR Cryptology ePrint Archive, 2004:332, 2004.
Gustavus J Simmons. Authentication theory/coding theory. In Workshop on the Theory and Application of Cryptographic Techniques, pages 411-431. Springer, 1984.
Gustavus J Simmons. A survey of information authentication. Proceedings of the IEEE, 76(5):603-620, 1988.
Douglas R Stinson. Universal hashing and authentication codes. In Annual International Cryptology Conference, pages 74-85. Springer, 1991.
Douglas R. Stinson. Combinatorial techniques for universal hashing. Journal of Computer and System Sciences, 48(2):337-346, 1994.
Mark N Wegman and J Lawrence Carter. New hash functions and their use in authentication and set equality. Journal of computer and system sciences, 22(3):265-279, 1981.
Aaron D Wyner. The wire-Tap channel. Bell Labs Technical Journal, 54(8):1355-1387, 1975.
Kai Zeng, Kannan Govindan, and Prasant Mohapatra. Noncryptographic authentication and identification in wireless networks [security and privacy in emerging wireless networks]. IEEE Wireless Communications, 17(5), 2010.