Authentication of Concast Communication

  • Mohamed Al-Ibrahim
  • Hossein Ghodosi
  • Josef Pieprzyk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2551)

Abstract

In this paper we tackle the problem of finding an efficient signature verification scheme when the number of signatures is signi.- cantly large and the verifier is relatively weak. In particular, we tackle the problem of message authentication in many-to-one communication networks known as concast communication.

The paper presents three signature screening algorithms for a variant of ElGamal-type digital signatures. The cost for these schemes is n applications of hash functions, 2n modular multiplications, and n modular additions plus the verification of one digital signature, where n is the number of signatures.

The paper also presents a solution to the open problem of finding a fast screening signature for non-RSA digital signature schemes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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.Google Scholar
  2. [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.Google Scholar
  3. [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.Google Scholar
  4. [4]
    C. Boyd, “Digital Multisignatures,” in Cryptography and Coding (H. Beker and F. Piper, eds.), pp. 241–246, Clarendon Press, 1989.Google Scholar
  5. [5]
    E. Brickell, D. Gordon, K. McCurley, and D. Wilson, “Fast Exponentiation with Precomputation,” in Advances in Cryptology-Proceedings of EUROCRYPT’ 92 (R. Rueppel,.), vol. 658 of Lecture Notes in Computer Science, Springer-Verlag, 1993.Google Scholar
  6. [6]
    R. Cramer and I. Damga°ard, “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.Google Scholar
  7. [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.Google Scholar
  8. [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.Google Scholar
  9. [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.Google Scholar
  10. [10]
    W. Diffe and M. Hellman, “New Directions in Cryptography,” IEEE Trans. on Inform. Theory, vol. IT-22, pp. 644–654, Nov. 1976.Google Scholar
  11. [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.Google Scholar
  12. [12]
    A. Fiat, “Batch RSA,” Journal of Cryptology, vol. 10, no. 2, pp. 75–88, 1997MATHCrossRefGoogle Scholar
  13. [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.Google Scholar
  14. [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.Google Scholar
  15. [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–193Google Scholar
  16. [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.Google Scholar
  17. [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.Google Scholar
  18. [18]
    C. Schnorr, “Efficient Signature Generation by Smart Cards,” Journal of Cryptology, vol. 4, no. 3, pp. 161–174, 1991.MATHCrossRefMathSciNetGoogle Scholar
  19. [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.Google Scholar
  20. [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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Mohamed Al-Ibrahim
    • 1
  • Hossein Ghodosi
    • 2
  • Josef Pieprzyk
    • 3
  1. 1.Center for Computer Security ResearchUniversity of WollongongWollongongAustralia
  2. 2.School of Information TechnologyJames Cook UniversityTownsvilleAustralia
  3. 3.Department of ComputingMacquarie UniversitySydneyAustralia

Personalised recommendations