Constructions of authentication codes from algebraic curves over finite fields

Authors:
Chaoping Xing;Huaxiong Wang;Kwok Yan Lam
Affiliations:
Dept. of Math., Nat. Univ. of Singapore;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 8

Linear Authentication Codes: Bounds and Constructions

INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Cartesian authentication codes from functions with optimal nonlinearity

Theoretical Computer Science
Logarithm Cartesian authentication codes

Information and Computation
A coding theory construction of new systematic authentication codes

Theoretical Computer Science - Insightful theory
Secret sharing schemes with partial broadcast channels

Designs, Codes and Cryptography
Authentication codes and bipartite graphs

European Journal of Combinatorics
Combinatorial Designs for Authentication and Secrecy Codes

Foundations and Trends in Communications and Information Theory
Algebraic geometric secret sharing schemes and secure multi-party computations over small fields

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology

Quantified Score

Hi-index	754.84

Visualization

Abstract

We present a new application of algebraic curves over finite fields to the constructions of universal hash families and unconditionally secure codes. We show that the constructions derived from the Garcia-Stichtenoth curves yield new classes of authentication codes and universal hash families which are substantially better than those previously known