DocumentCode
2991900
Title
Authentication and secrecy codes for equiprobable source probability distributions
Author
Huber, Michael
Author_Institution
Wilhelm-Schickard-Inst. for Comput. Sci., Univ. of Tuebingen, Tubingen, Germany
fYear
2009
fDate
June 28 2009-July 3 2009
Firstpage
1105
Lastpage
1109
Abstract
We give new combinatorial constructions for codes providing authentication and secrecy for equiprobable source probability distributions. In particular, we construct an infinite class of optimal authentication codes which are multiple-fold secure against spoofing and simultaneously achieve perfect secrecy. Several further new optimal codes satisfying these properties will also be constructed and presented in general tables. Almost all of these appear to be the first authentication codes with these properties.
Keywords
combinatorial mathematics; cryptography; message authentication; statistical distributions; combinatorial construction; cryptography; equiprobable source probability distribution; multiple-fold secure; optimal authentication codes; secrecy codes; Authentication; Communication channels; Computer science; Cryptography; Decoding; Geometry; Probability distribution; Transmitters;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location
Seoul
Print_ISBN
978-1-4244-4312-3
Electronic_ISBN
978-1-4244-4313-0
Type
conf
DOI
10.1109/ISIT.2009.5206028
Filename
5206028
Link To Document