Abstract
In the most general model of message authentication, there are four essential participants: a transmitter who observes an information sourcet, such as a coin toss, and wishes to communicate these observations to a remotely located receiver over a publicly exposed, noiseless, communications channel; a receiver who wishes to not only learn the state of the source (as observed by the transmitter) but also to assure himself that the communications (messages) he accepts actually were sent by the transmitter and that no alterations have been made to them subsequent to the transmitter having sent them, and two other parties, the opponent and the arbiter. The opponent wishes to deceive the receiver into accepting a message that will misinform him as to the state of the source. We assume, in accordance with Kerckhoffs’ criteria in cryptography, that the opponent is fully knowledgeable of the authentication system and that in addition he is able to both eavesdrop on legitimate communications in the channel and to introduce fraudulent communications of his own choice. We also assume that he has unlimited computing power, i.e., that any computation which can be done in principal can in fact be done in practice.
This work performed at Sandia National Laboratories supported by the U. S. Dept. of Energy under contract no. DE-AC04-76DP00789.
Chapter PDF
Similar content being viewed by others
Keywords
- Authentication Scheme
- Authentication Protocol
- Sandia National Laboratory
- Established Protocol
- Authentication Code
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
E. F. Brickell, “A Few Results in Message Authentication,” Proceedings of the 15th Southeastern Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, LA, March 5–8, 1984, Congressus Numerantium, Vol. 43, Dec. 1984, pp. 141–154.
G. J. Simmons, “A Game Theory Model of Digital Message Authentication,” Proceedings of the 11th Annual Conference on Numerical Mathematics and Computing, Univ. of Manitoba, Winnipeg, Canada, Oct. 1–3, 1981, Congressus Numerantium, Vol. 34, June 1982, pp. 413–424.
G. J. Simmons, “Message Authentication: A Game on Hypergraphs,” Proceedings of the 15th Southeastern Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, LA, Mar. 5–8, 1984, Congressus Numerantium, Vol. 45, December 1984, pp. 161–192.
G. J. Simmons, “Authentication Theory/Coding Theory,” Proceedings of Crypto’84, Santa Barbara, CA. August 19–22, 1984, in Advances in Cryptology, Ed. by R. Blakley, Springer-Verlag, Berlin (1984), pp. 411–431.
D. R. Stinson, “Some Constructions and Bounds for Authentication Codes,” presented at Crypto’86, Santa Barbara, CA, Aug. 12–15, 1986, to appear in Journal of Cryptology, 1988.
D. R. Stinson, “A Construction for AuthenticationSecrecy Codes from Certain Combinatorial Designs,” presented at Crypto’87, Santa Barbara, CA, Aug. 16–20, 1987, to appear in Journal of Cryptology, 1988.
E. N. Gilbert, F. J. MacWilliams, N.J.A. Sloane, “Codes which Detect Deception,” The Bell System Tech. Journal, Vol. 53, No. 3, March 1974, pp. 405–424.
J. L. Massey, “Cryptography — A Selective Survey,” presented at Int’l. Tirrenia Workshop on Digital Communications, Tirrenia, Italy, Sept. 2–6, 1985. Alta Frequenza, Vol. LV #1, Jan.–Feb., 1986, pp. 4–11.
P. Schoebi, “Perfect Authentication Systems for Data Sources with Arbitrary Statistics,” presented at Eurocrypt’86, Linköping, Sweden, May 20–22, 1986.
G. J. Simmons, “Authentication Codes that Permit Arbitration,” to appear Proceedings of the 18th Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, Feb. 23–27, 1987.
D. Raghavarao, Constructions and Combinatorial Problems in Design of Experiments, John Wiley & Sons, New York, NY (1971).
R. H. Brock, “Finite Nets I: Numerical Invariants,” Canadian Journal of Math., Vol. 3 (1951), pp. 94–107.
R. H. Brock. “Finite Nets II: Uniqueness and Embedding,” Pacific Journal of Math., Vol. 13 (1963), pp. 421–457.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Simmons, G.J. (1988). Message Authentication with Arbitration of Transmitter/Receiver Disputes. In: Chaum, D., Price, W.L. (eds) Advances in Cryptology — EUROCRYPT’ 87. EUROCRYPT 1987. Lecture Notes in Computer Science, vol 304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39118-5_15
Download citation
DOI: https://doi.org/10.1007/3-540-39118-5_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19102-5
Online ISBN: 978-3-540-39118-0
eBook Packages: Springer Book Archive