Reference : Composable, Unconditionally Secure Message Authentication without any Secret Key
E-prints/Working papers : Already available on another site
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) > >]
5-Apr-2018
No
[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)
http://hdl.handle.net/10993/37480
https://arxiv.org/abs/1804.01797
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.