Reference : Composable, Unconditionally Secure Message Authentication without any Secret Key
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Security, Reliability and Trust
http://hdl.handle.net/10993/37480
Composable, Unconditionally Secure Message Authentication without any Secret Key
English
Ostrev, Dimiter mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
2019
2019 IEEE International Symposium on Information Theory (ISIT), Paris, France, 2019
IEEE
Yes
International
978-1-5386-9291-2
2019 IEEE International Symposium on Information Theory (ISIT)
7-12 July 2019
Paris
France
[en] Authentication ; Information Theoretic Security ; Composable Security ; Noisy Channel Coding
[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.
Interdisciplinary Centre for Security, Reliability and Trust (SnT) > Applied Security and Information Assurance Group (APSIA)
FNR8293135 > Peter Y. A. Ryan > AToMS > A Theory of Matching Sessions
http://hdl.handle.net/10993/37480
10.1109/ISIT.2019.8849510
http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8849510&isnumber=8849208
FnR ; FNR8293135 > Peter Y. A. Ryan > AToMS > A Theory of Matching Sessions > 01/05/2015 > 30/04/2018 > 2014

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
ComposableUncondtionallySecureAuthenticationWithoutAnySecretKey20180404.pdfAuthor preprint390.77 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.