Design theory
Combinatorial techniques for universal hashing
Journal of Computer and System Sciences
On families of hash functions via geometric codes and concatenation
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On the relation between A-codes and codes correcting independent errors
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Universal hashing and authentication codes
Designs, Codes and Cryptography
Capacities: from information theory to extremal set theory
Journal of Combinatorial Theory Series A
Algebraic-Geometric Codes
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Universal Hashing and Multiple Authentication
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
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
Theoretical Computer Science - Computing and combinatorics
On Hash Functions and List Decoding with Side Information
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A2-codes from universal hash classes
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Efficient authentication for mobile and pervasive computing
ICICS'10 Proceedings of the 12th international conference on Information and communications security
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
| Hi-index | 0.00 |
We describe a new application of algebraic coding theory to universalhashing and authentication without secrecy. This permits to make use of thehitherto sharpest weapon of coding theory, the construction of codes fromalgebraic curves. We show in particular how codes derived from Artin-Schreiercurves, Hermitian curves and Suzuki curves yield classes of universal hashfunctions which are substantially better than those known before.