Abstract
We present a protocol for the exchange of individually authenticated data streams among N parties. Our authentication procedure is fast, because it only requires the computation of hash functions - we do not need digital signatures, that are substantially less efficient. The authentication information is also short: two hash values for every block of data. Since there are no shared secrets, this information does not grow with N, the number of parties.
The protocol described in this paper, and the timing protocol derived from it, were first presented in a seminar at IBM T. J. Watson Research Center in summer 1998 by F. Bergadano
This work was completed while Bruno Crispo was with the Computer Science Department, University of Turin
Chapter PDF
Similar content being viewed by others
References
R. Anderson, F. Bergadano, B. Crispo, J. H. Lee, C. Manifavas, R. M. Needham, “A New Family of Authentication Protocols”, Operating Systems Review, 32(4):9–20, 1998.
N. Asokan, G. Tsudik and M. Waidner, “Server Supported Signatures”, Proc.1996 Esorics, Rome, Italy, September 1996 pp. 131–143.
A. Ballardie, “Scalable Multicast Key Distribution”, IETF-RFC 1949, May 1996.
M. Bellare, R. Canetti and H. Krawczyk, “Pseudorandom Functions Revisited: The Cascade Construction and its Concrete Security”, Proc. 37th Symposium on the Foundations of Computer Science, IEEE, 1996.
F. Bergadano and B. Crispo, “Multiparty Authentication, Fast and Short”, Seminar held at IBM T. J. Watson Research Center, August 1998. http://www.research.ibm.com/security/seminar.html
F. Bergadano, D. Cavagnino, B. Crispo, “Individual Single Source Authentication on the MBone”, IEEE International Conference on Multimedia and Expo, New York, 2000.
D. Bleichenbacher, U. Maurer, “On the Efficiency of One-Time Digital Signatures”, in Advances in Cryptology — AsiaCrypt 96 (Springer LNCS).
R. Canetti and B. Pinkas, “AT axonomy of Multicast Security Issues”, Internet Draft, May 1998.
S. Cheung, “An Efficient Message Authentication Scheme for Link State Routing”, Proc. of 13th Annual Computer Security Applications Conference, San Diego, California, 1997.
M. Dyer, T. Fenner, A. Frieze, A. Thomason, “On key storage in secure networks”, Journal of Cryptology, vol. 8, 1995, pp. 189–200.
S. Even, O. Goldreich, S. Micali, “On-line / off-line digital signatures”, in Advances in Cryptology — CRYPTO 89 (Springer LNCS v. 435) pp. 263–275.
R. Gennaro, P. Rohatgi, “How to Sign Digital Streams”, in Advances in Cryptology— CRYPTO 97, Springer LNCS v. 1294 pp. 180–197.
S. Goldwasser, S. Micali, R. L. Rivest, “ADigital Signature Scheme Secure Against Adaptive Chosen Message Attacks”, in SIAM Journal of Computing v. 17 no. 2 (April 1988) pp. 281–308.
O. Goldreich, S. Goldwasser, S. Micali, “How to Construct Random Functions”, Journal of the ACM, vol. 33:4, 1986, pp. 210–217.
N. M. Haller, “The S/key(tm) One-time Password System”, Proc. 1994 ISOC Symposium on Network and Distributed Security, San Diego, CA, February 1997.
H. Krawczyk, M. Bellare and R. Canetti, “HMAC: Keyed-Hashing for Message Authentication”, IETF-RFC 2104, February 1997.
L. Lamport, “Password Authentication with Insecure Communication”, Communication of the ACM, 24:11, Nov. 1981, pp. 770–772.
R.C. Merkle, “A Digital Signature Based on a Conventional Encryption Function”, in Advances in Cryptology — CRYPTO 87 (Springer LNCS v. 293) pp. 369–378.
C. Metz, “Reliable Multicast: When Many Must Absolutely Positively Receive It”, IEEE Internet Computing, pp. 9–13, July 1998.
S. Micali, “Enhanced Certificate Revocation System”, Technical Report MIT/LCS/TM-542 (November, 1985).
S. Mittra, “Iolus: a Framework for Scalable Secure Multicast”, in ACM SIGCOMM, Cannes, September 1997.
A. Perrig, R. Canetti, J. D. Tygar and D. Song, “Efficient Authentication and Signing of Multicast Streams over Lossy Channels”, IEEE Symposium on Security and Privacy, Oakland, California, USA, 2000.
R. L. Rivest and A. Shamir, “PayWord and MicroMint: Two Simple Micropayment Schemes”, Proc. 1996 Security Protocols Workshop, Cambridge, UK, April 1996, pp. 69–87.
S. Schecter, T. Parnell, A. Hartemink, “Anonymous authentication of membership in dynamic groups”, Proc. Workshop on Financial Cryptography, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bergadano, F., Cavagnino, D., Crispo, B. (2001). Chained Stream Authentication. In: Stinson, D.R., Tavares, S. (eds) Selected Areas in Cryptography. SAC 2000. Lecture Notes in Computer Science, vol 2012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44983-3_11
Download citation
DOI: https://doi.org/10.1007/3-540-44983-3_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42069-9
Online ISBN: 978-3-540-44983-6
eBook Packages: Springer Book Archive