A lower bound on authentication after having observed a sequence of messages
- 1 March 1993
- journal article
- Published by Springer Nature in Journal of Cryptology
- Vol. 6 (3) , 135-156
- https://doi.org/10.1007/bf00198462
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The Practice of AuthenticationPublished by Springer Nature ,2007
- Authentication Theory/Coding TheoryPublished by Springer Nature ,2000
- Essentially ℓ-fold secure authentication systemsPublished by Springer Nature ,1991
- The combinatorics of authentication and secrecy codesJournal of Cryptology, 1990
- Cartesian Authentication SchemesPublished by Springer Nature ,1990
- Information-theoretic bounds for authentication schemesJournal of Cryptology, 1990
- Some Constructions for Authentication - Secrecy CodesPublished by Springer Nature ,1988
- Some constructions and bounds for authentication codesJournal of Cryptology, 1988
- Repeated use of codes which detect deception (Corresp.)IEEE Transactions on Information Theory, 1979
- Codes Which Detect DeceptionBell System Technical Journal, 1974