Information-theoretically secure keyless authentication

Author

Korjik, Valeri ; Bakin, Maxim

Author_Institution

Inst. Politecnico Nacional, Mexico City, Mexico

fYear

2000

fDate

2000

Firstpage

20

Abstract

We consider a cryptographic scenario of two honest parties A and B facing an active eavesdropper E. They share no secret key initially but their final goal is to generate a shared information-theoretically secure key. We develop the special case represented in Maurer (1997) where a random binary string is broadcast by some center (like a satellite) over binary symmetric channels and received as X, Y, Z-strings with bit error probabilities ε_A, ε_B, ε_E (ε_A<ε _E, ε_B<ε_E) by legal parties and the intruder, respectively

Keywords

binary codes; cryptography; error statistics; linear codes; message authentication; telecommunication channels; telecommunication security; X-strings; Y-strings; Z-strings; active eavesdropper; binary symmetric channels; bit error probabilities; cryptographic scenario; honest parties; information-theoretically secure keyless authentication; intruder; legal parties; random binary string; secret key; shared information-theoretically secure key; Authentication; Binary codes; Block codes; Cryptography; Error probability; Hamming distance; Law; Legal factors; Protocols; Satellite broadcasting;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2000. Proceedings. IEEE International Symposium on

Conference_Location

Sorrento

Print_ISBN

0-7803-5857-0

Type

conf

DOI

10.1109/ISIT.2000.866310

Filename

866310