Lower bounds on the probability of deception in authentication with arbitration
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 40 (5) , 1573-1585
- https://doi.org/10.1109/18.333869
Abstract
The paper investigates a model for authentication in which not only an outsider, but also the transmitter or the receiver, may cheat. Lower bounds on the probability of success for different types of deception as well as on the parameters of secure authentication codes are derived. The latter bounds are shown to be tight by demonstrating codes in projective space that meet the bounds with equalityKeywords
This publication has 9 references indexed in Scilit:
- On the Relation Between A-Codes and Codes Correcting Independent ErrorsPublished by Springer Nature ,2001
- Arbitrated Unconditionally Secure Authentication Can Be Unconditionally Protected against Arbiter’s AttacksPublished by Springer Nature ,2001
- Message Authentication with Arbitration of Transmitter/Receiver DisputesPublished by Springer Nature ,2000
- Authentication Codes with Multiple ArbitersPublished by Springer Nature ,2000
- Authentication Theory/Coding TheoryPublished by Springer Nature ,2000
- Bounds on the probability of deception in multiple authenticationIEEE Transactions on Information Theory, 1994
- Strengthening Simmons' bound on impersonationIEEE Transactions on Information Theory, 1991
- A cartesian product construction for unconditionally secure authentication codes that permit arbitrationJournal of Cryptology, 1990
- Codes Which Detect DeceptionBell System Technical Journal, 1974