Abstract
Previously, Desmedt and Seberry developed a practical proven secure authentication scheme with arbitration. Their scheme, however, only provides an environment for a single sender. Nevertheless, in real applications, many senders may collaboratively send a message to the receiver and convince the receiver that the message is actually transmitted by them. In this paper, we present an efficient scheme which (a) is unconditionally secure against denial by the senders having sent a message and (b) reduces the size of evidence for the authentic message in a multi-senders environment.
Preview
Unable to display preview. Download preview PDF.
References
Bellare, M., Guerin, R. and Rogaway, P.: XOR MACS: new methods for message authentication using finite pseudorandom functions. In Advances in Cryptology-Crypto'95 proceedings, pages 15–28, Springer-Verlag, 1995.
Bellare, M., Canetti, R. and Krawczyk, H.: Keying hash functions for message authentication. In Advances in Cryptology-Crypto'96 proceedings, pages 1–15, Springer-Verlag, 1996.
Desmedt, Y., Yung, M.: Arbitrated unconditionally secure authentication can be unconditionally protected against arbiter's attacks. In Advances in Cryptology-Crypto '90 proceedings, pages 177–188, Springer-Verlag, 1991.
Desmedt, Y., Seberry, J.: Practical proven secure authentication with arbitration. In Advances in Cryptology-Auscrypt '92 proceedings, pages 27–32, Springer-Verlag, 1992.
FIPS 180-1, Secure hash standard, NIST, US Department of Commerce, Washington D.C., April 1995.
Lai, X. and Massey, J.: A proposal for a new block encryption standard. In Advances in Eurocrypt'90 proceedings, pages 389–404, Springer-Verlag, 1991.
National Bureau of Standards. Data encryption standard. Federal Information Proceedings Standards Publication FIPS PUB 46, U.S. Department of Commerce, January 1977.
Needham, R., Schroeder, M.: Using Encryption for Authentication in Large Networks of Computers. Comm. ACM, 21(12):993–999, 1978.
Preneel, B. and Oorschot, V.: MDx-MAC and building fast MACs from hash function. In Advances in Cryptology-Crypto'95 proceedings, pages 1–14, Springer-Verlag, 1995.
Rivest, R. L.: The MD5 message-digest algorithm. Request for comments (RFC) 1321. Internet activities board, Internet Privacy Task Force, April, 1992.
Simmons, G.: A Cartesian Product Construction for Unconditionally Secure Authentication Codes that Permit Arbitration. Journal of Cryptology, 2:77–104, 1990.
Tsudik, G.: Message authentication with one-way hash functions. In Proceedings of Infocom 92, vol.3, pages 2055–2059, IEEE Press, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hwang, T., Wang, CH. (1998). Arbitrated unconditionally secure authentication scheme with multi-senders. In: Okamoto, E., Davida, G., Mambo, M. (eds) Information Security. ISW 1997. Lecture Notes in Computer Science, vol 1396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030427
Download citation
DOI: https://doi.org/10.1007/BFb0030427
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64382-1
Online ISBN: 978-3-540-69767-1
eBook Packages: Springer Book Archive