AUTHENTICATION OF TRANSIT FLOWS AND K-SIBLINGS ONE-TIME SIGNATURE

IFIP Advances in Information and Communication Technology

Volumn 100, Issue , 2002, Pages 41-55

  Al Ibrahim, Mohamed ^a   Pieprzyk, Josef ^b  

^a UNIVERSITY OF WOLLONGONG   (Australia)

^b MACQUARIE UNIVERSITY   (Australia)

Author keywords

k sibling hashing; Network security; one time signatures; source authentication

Indexed keywords

AUTHENTICATION;

AUTHENTICATION SCHEME; HASHING METHOD; INTERMEDIATE NODE; IP COMMUNICATION NETWORKS; K-SIBLING HASHING; NETWORKS SECURITY; ONE-TIME SIGNATURE; SOURCE AUTHENTICATION; TRANSIT FLOWS; UNIQUE FEATURES;

NETWORK SECURITY;

EID: 35248849687     PISSN: 18684238     EISSN: 1868422X     Source Type: Book Series    
DOI: 10.1007/978-0-387-35612-9_5     Document Type: Article

References (18)

1. R. Gennaro and P. Rohatchi, "How to Sign Digital Streams", Advances in Cryptology-CRYPTO'97, Lecture Notes in Computer Science 1249, Springer­ Verlag, pp. 180-197, 1997.
2. R. Canetti, J. Garay, G. Itkins, D. Micciancio, M. Naor, B. Pinkas, " Multicast Security: A Taxonomy and some efficient Constructions", IEEE INFOCOM'99.
3. A. Perrig, R. Canetti, J.D. Tygar, D. Song, " Efficient Authentication and Signing of Multicast Streams over Lossy Channels", ACM CCS'02, 2000.
4. M. AI-Ibrahim and J. Pieprzyk, "Authenticating Multicast Streams in Lossy Channels Using Threshold Techniques," in Networking-ICN 2001, First International Conference, Colmar, France, Lecture Notes in Computer Science, vol. 2094, P. Lorenz (ed), pp. 239-249, 2001.
5. A. Perrigo "The BiBa One-Time Signature and Broadcast Authentication Protocol". ACM, CCS'OI, Philadelphia, November 2001.
6. M. Bellare, A. Desai, D. Pointcheval and Rogaway A. "Relations among notions of security for public-key encryption schemes". In H. Krawczyk, editor, Advances in Cryptology-CRYPTO'98, Lecture Notes in Computer Science No. 1462, Springer-Verlag, pages 26-45, 1998.
7. Ivan Damgard. "A design principle for hash functions." In G. Brassard, Editor, Advances in Cryptology-CRYPTO'89, Lecture Notes in Computer Science No. 435. pages 416-427. Springer-Verlag, 1989.
8. Y. Zheng, T. Hardjono and J. Pieprzyk. "The sibling intractable function family(SIFF): notion, construction and applications. IElCE 7rans. Jilundamentals, vol. E76-A:4-13, January 1993.
9. J. Pieprzyk and E. Okamato. " Verifiable secret sharing", IClSC'99, Seoul, Korea, pages 169-183, Lecture Notes in Computer Science No. 1787. Springer-Verlag 1999.
10. R. Merkle. "A Certified Digital Signature", Advances in Cryptology-CRYPTO'89, pages 218-238 Springer-Verlag, 1989. Lecture Notes in Computer Science No. 435.
11. A. Menezes, P. Oorschot and S. Vanstone. "Handbook of Applied Cryptography", CRC Press, 1996.
12. S. Kent and R. Atkinson. RFC 2401: Security architecture for the Internet Security. Networking Group, IETF, November 1998. http://www.ietf.org.
13. S. Goldwasser, S. Micai, and C. Rackoff, "A Digital signature Scheme Secure Aagainst Adaptive Chosen-message Attacks", SIAM Journal on Computing, 17 (1988).
14. P. Rohatchi. " A compact and Fast Hybrid Signature Scheme for Multicast Packet Authentication", in Proc. of 6th A CM conference on Computer and Communications Security, 1999.
15. M. Bellare, P. Rogaway. "Collsion-Resistant Hashing: Towards Making uniersal one way hash functions practical". Advances in Cryptology-CRYPTO '97, Lecture Notes in Computer Science No. 1294, pages 470-484, Springer-Verlag, 1997.
16. A. Shamir, "How to share a secret", Communications the ACM, 22:612-613, November 1979.
17. Oded Goldreich, Shaft Goldwasser, and Silvio Micali, " How to construct random functions", Journal 01 the ACM, 33(4):792-807, October 1986.
18. S. Even, O. Goldreich, S. Micali. "On-Iine/Off-Iine digital signatures", Journal 01 Cryptology, volume 9, number 1, winter 1996.