Arbitrated unconditionally secure authentication can be unconditionally protected against arbiter’s attacks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 537 LNCS, Issue , 1991, Pages 177-188

  Desmedt, Yvo ^a   Yung, Moti ^b  

^a UNIVERSITY OF WISCONSIN MILWAUKEE   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION;

AUTHENTICATION SCHEME; FINITE GEOMETRY; OBLIVIOUS TRANSFER; PRACTICAL SCHEMES; SUBSTITUTION ATTACK; UNCONDITIONALLY SECURE;

CRYPTOGRAPHY;

EID: 85027188625     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-38424-3_13     Document Type: Conference Paper

References (19)

1. E. F. Brickell and D. R. Stinson. Authentication codes with multiple arbiters. In C. G. Günther, editor, Advances in Cryptology, Proc. of Eurocrypt '88 (Lecture Notes in Computer Science 330), pp. 51-55. Springer-Verlag, May 1988. Davos, Switzerland.
2. W. de Jonge and D. Chaum. Attacks on some RSA signatures. In Advances in Cryptology. Proc. of Crypto’85 (Lecture Notes in Computer Science 218), pp. 18-27. Springer-Verlag, New York, 1986. Santa Barbara, California, U. S.A., August 18-22, 1985.
3. W. de Jonge and D. Chaum. Some variations on RSA signatures & their security. In A. Odlyzko, editor, Advances in Cryptology, Proc. of Crypto '86 (Lecture Notes in Computer Science 263), pp. 49-59. Springer-Verlag, 1987. Santa Barbara, California, U. S. A., August 11-15.
4. D. E. R. Denning. Digital signatures with RSA and other public-key cryptosystems. Comm. ACM 27, pp. 388-392, 1984.
5. Y. Desmedt and M. Yung. Arbitrated unconditionally secure authentication can be unconditionally protected against arbiter’s attacks. Full paper, available from authors, 1990.
6. W. Diffie and M. E. Heilman. New directions in cryptography. IEEE Trans. Inform. Theory, IT-22(6), pp. 644-654, November 1976.
7. E. Gilbert, F. MacWilliams, and N. Sloane. Codes which detect deception. The BELL System Technical Journal, 53(3), pp. 405-424, March 1974.
8. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. Siam J. Comput., 17(2), pp. 281-308, April 1988.
9. R. Impagliazzo and M. Luby. One-way functions are essential for complexity based cryptography. In 30th Annual Symp. on Foundations of Computer Science (FOCS), pp. 230-235. IEEE Computer Society Press, October 30-November 1, 1988. Research Triangle Park, NC, U. S.A.
10. C. H. Meyer and S. M. Matyas. Cryptography: A New Dimension in Computer Data Security. J. Wiley, New York, 1982.
11. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In Proceedings of the twenty first annual A CM Symp. Theory of Computing, STOC, pp. 33-43, May 15-17, 1989.
12. M. Rabin. How to exchange secrets by oblivious transfer. Technical Memo TR-81, Havard Center for Research in Computer Technology, 1981.
13. R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public key cryptosystems. Commun. ACM, 21, pp. 294-299, April 1978.
14. J. Rompel. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the twenty second annual ACM Symp. Theory of Computing, STOC, pp. 387-394, May 14-16, 1990.
15. G. J. Simmons. Message authentication with arbitration of transmitter/receiver disputes. In D. Chaum and W. L. Price, editors, Advances in Cryptology-Eurocrypt '87 (Lecture Notes in Computer Science 304), PP-151-165. Springer-Verlag, Berlin, 1988. Amsterdam, The Netherlands, April 13-15, 1987, full paper submitted to the Journal of Cryptology.
16. G. J. Simmons. A survey of information authentication. Proc. IEEE, 76(5), pp. 603-620, May 1988.
17. G. J. Simmons. Robust shared secret schemes. Congressus Numerantium, 68, pp. 215-248, 1989.
18. G. J. Simmons. A Cartesian product construction for unconditionally secure authentication codes that permit arbitration. Journal of Cryptology, 2(2), pp. 77-104, 1990.
19. M. N. Wegman and J. L. Carter. New hash fuctions and their use in authentication and set equality. Journal of Computer and System Sciences, 22, pp. 265-279, 1981.