Three Constructions of Authentication Codes with Perfect Secrecy

Authors:
Cunsheng Ding;Xiaojian Tian
Affiliations:
Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, China cding@cs.ust.hk;Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, China xjtian@cs.ust.hk
Venue:
Designs, Codes and Cryptography
Year:
2004

Citing 8
Cited 3

Authentication theory/coding theory

Proceedings of CRYPTO 84 on Advances in cryptology
Some constructions for authentication-secrecy codes

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
A construction for authentication/secrecy codes from certain combinatorial designs

Journal of Cryptology
The Combinatorics of Perfect Authentication Schemes

SIAM Journal on Discrete Mathematics
On the construction of authentication and secrecy codes

Designs, Codes and Cryptography
Combinatorial Characterizations of Authentication Codes II

Designs, Codes and Cryptography
Bounds and Characterizations of Authentication/SecrecySchemes

Designs, Codes and Cryptography
Cartesian authentication codes from functions with optimal nonlinearity

Theoretical Computer Science

Authentication and secrecy codes for equiprobable source probability distributions

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Combinatorial Designs for Authentication and Secrecy Codes

Foundations and Trends in Communications and Information Theory
A class of authentication codes with secrecy

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present three algebraic constructions of authentication codes with secrecy. The first and the third class are optimal. Some of the codes in the second class are optimal, and others in the second class are asymptotically optimal. All authentication codes in the three classes provide perfect secrecy.