Authentication of concast communication

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

Volumn 2551, Issue , 2002, Pages 185-198

  Al Ibrahim, Mohamed ^a   Ghodosi, Hossein ^b   Pieprzyk, Josef ^c  

^a UNIVERSITY OF WOLLONGONG   (Australia)

^b JAMES COOK UNIVERSITY   (Australia)

^c MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS;

FAST SCREENING; MANY-TO-ONE COMMUNICATIONS; MESSAGE AUTHENTICATION; MODULAR ADDITION; MODULAR MULTIPLICATION; RSA DIGITAL SIGNATURES; SCREENING ALGORITHMS; SIGNATURE VERIFICATION;

AUTHENTICATION;

EID: 84974705246     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36231-2_16     Document Type: Conference Paper

References (20)

1. M. Al-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, July 2001.
2. M. Al-Ibrahim and J. Pieprzyk, “Authentication of Transit Flows and K-Siblings One Time Signature” in Advanced Communications and Multimedia Security, B. Jerman-Blazic and T. Klobucar, (ed.), pp. 41-55, Kluwer Academic Publisher, CMS’02, Portoroz -Slovenia, September 2002.
3. M. Bellare, J. Garay, and T. Rabin, “Fast Batch Verification for Modular Exponentiation and Digital Signatures,” in Advances in Cryptology -Proceedings of EUROCRYPT’98 (K. Nyberg, ed.), vol. 1403 of Lecture Notes in Computer Science, Springer-Verlag, 1998.
4. C. Boyd, “Digital Multisignatures,” in Cryptography and Coding (H. Beker and F. Piper, eds.), pp. 241-246, Clarendon Press, 1989.
5. E. Brickell, D. Gordon, K. McCurley, and D. Wilson, “Fast Exponentiation with Precomputation,” in Advances in Cryptology -Proceedings of EUROCRYPT’92 (R. Rueppel, ed.), vol. 658 of Lecture Notes in Computer Science, Springer-Verlag, 1993.
6. R. Cramer and I. Damgård, “New Generation of Secure and Practical RSABased Signatures,” in Advances in Cryptology -Proceedings of CRYPTO’96 (N. Koblitz, ed.), vol. 1109 of Lecture Notes in Computer Science, pp. 173-185, Springer-Verlag, 1996.
7. Y. Desmedt, “Society and group oriented cryptography: a new concept,” in Advances in Cryptology -Proceedings of CRYPTO’87 (C. Pomerance, ed.), vol. 293 of Lecture Notes in Computer Science, pp. 120-127, Springer-Verlag, 1988.
8. Y. Desmedt and Y. Frankel, “Shared generation of authenticators and signatures,” in Advances in Cryptology -Proceedings of CRYPTO’91 (J. Feigenbaum, ed.), vol. 576 of Lecture Notes in Computer Science, pp. 457-469, Springer-Verlag, 1992.
9. Y. Desmedt, Y. Frankel, and M. Yung, “Multi-receiver/Multi-sender network security: Efficient authenticated multicast/feedback,” IEEE Infocom’92, pp. 2045-2054, 1992.
10. W. Diffie and M. Hellman, “New Directions in Cryptography,” IEEE Trans. on Inform. Theory, vol. IT-22, pp. 644-654, Nov. 1976.
11. T. ElGamal, “A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” IEEE Trans. on Inform. Theory, vol. IT-31, pp. 469-472, July 1985.
12. A. Fiat, “Batch RSA,” Journal of Cryptology, vol. 10, no. 2, pp. 75-88, 1997.
13. A. Fiat and A. Shamir, “How To Prove Yourself: Practical Solutions to Identification and Signature Problems,” in Advances in Cryptology -Proceedings of CRYPTO’86 (A. Odlyzko, ed.), vol. 263 of Lecture Notes in Computer Science, pp. 186-194, Springer-Verlag, 1987.
14. L. Harn, “Group-oriented (t, n) threshold digital signature scheme and digital multisignature,” IEE Proc.-Comput. Digit. Tech., vol. 141, pp. 307-313, Sept. 1994.
15. K. Nyberg and R. Rueppel, “Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem,” Designs, Codes and Cryptography, vol. 7, pp. 61-81, 1996. Also, Advances in Cryptology -Proceedings of EUROCRYPT’94 Vol. 950 LNCS, pp. 182-193.
16. R. Rivest, A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Communications of the ACM, vol. 21, pp. 120-126, Feb. 1978.
17. P.D. Rooij, “Efficient Exponentiation using Precomputation and Vector Addition Chains,” in Advances in Cryptology -Proceedings of EUROCRYPT’94 (A. Santis, ed.), vol. 950 of Lecture Notes in Computer Science, Springer-Verlag, 1994.
18. C. Schnorr, “Efficient Signature Generation by Smart Cards,” Journal of Cryptology, vol. 4, no. 3, pp. 161-174, 1991.
19. M. De Soete, J.-J. Quisquater, and K. Vedder, “A signature with shared verification scheme,” in Advances in Cryptology -Proceedings of CRYPTO’89 (J. Brassard, ed.), vol. 435 of Lecture Notes in Computer Science, pp. 253-262, Springer-Verlag, 1990.
20. Y. Zheng, T. Hardjono, and J. Pieprzyk, “The Sibling Intractable Function Family (SIFF): Notion, Construction and Applications,” IEICE Trans. Fundamentals, vol. E76-A, pp. 4-13, Jan. 1993