CNN Algorithms for Video Authentication and Copyright Protection
Journal of VLSI Signal Processing Systems - Special issue on spatiotemporal signal processing with analog CNN visual microprocessors
Multiround Unconditionally Secure Authentication
Designs, Codes and Cryptography
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Linear Authentication Codes: Bounds and Constructions
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Cryptographic Primitives for Information Authentication - State of the Art
State of the Art in Applied Cryptography, Course on Computer Security and Industrial Cryptography - Revised Lectures
Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
A coding theory construction of new systematic authentication codes
Theoretical Computer Science - Insightful theory
Authentication codes and bipartite graphs
European Journal of Combinatorics
Bucket hashing with a small key size
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Software performance of universal hash functions
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Optimal authentication codes from difference balanced functions
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
Authentication protocols based on low-bandwidth unspoofable channels: A comparative survey
Journal of Computer Security
WEWoRC'11 Proceedings of the 4th Western European conference on Research in Cryptology
A new multi-linear universal hash family
Designs, Codes and Cryptography
| Hi-index | 754.84 |
In both open and private communication the participants face potential threats from a malicious enemy who has access to the communication channel and can insert messages (impersonation attack) or alter already transmitted messages (substitution attack). Authentication codes (A-codes) have been developed to provide protection against these threats. In this paper we introduce a new distance, called the authentication distance (A-distance), and show that an A-code can be described as a code for the A-distance. The A-distance is directly related to the probability PS of success in a substitution attack. We show how to transform an error-correcting code into an A-code and vice versa. We further use these transformations to provide both upper and lower bounds on the size of the information to be authenticated, and study their asymptotic behavior. As examples of obtained results, we prove that the cardinality of the source state space grows exponentially with the number of keys provided PS>PI, we generalize the square-root bound given by Gilbert, MacWilliams, and Sloane in 1979, and we provide very efficient constructions using concatenated Reed-Solomon codes