Design and Security Analysis of Anonymous Group Identification Protocols

  • Chan H. Lee
  • Xiaotie Deng
  • Huafei Zhu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2274)


Two provably secure group identification schemes are presented in this report: 1) we extend De Santis, Crescenzo and Persiano’s (SCP) anonymous group identification scheme to the discrete logarithm based case; then we provide a 3-move anonymous group identification scheme, which is more efficient than that presented in [SCPM, CDS], with the help of this basic scheme; 2) we also extend the original De Santis, Crescenzo and Persiano anonymous group identification scheme to the general case where each user holds public key which is chosen by herself independently. The communication cost for one round execution of the protocolis 2mk, where k is bit length of public key n and m is the number of users in the group.


  1. BF.
    D. Boneh, and M. Franklin. Anonymous authentication with subset queries. In proceedings of the 6th ACM conference on Computer and Communications Security, pp. 113–119.Google Scholar
  2. BP.
    N. Braic and B. Pfitzmann. Collision free accumulators and fail-stop signature scheme without trees. Eurocrypt’97, 480–494, 1997.Google Scholar
  3. BSMP.
    M. Blum, A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero Knowledge, SIAM Journal on Computing, vol. 19, n. 6, December 1991, pp. 1084–1118.CrossRefGoogle Scholar
  4. CDS.
    R. Cramer, I. Damgaard, B. Schoenmakers: Proofs of PartialKno wledge and Simplified Design of Witness Hiding Protocols, Proceedings of CRYPTO’ 94, Santa Barbara Ca., Springer Verlag LNCS, vol. 839, pp. 174–187.Google Scholar
  5. SPH.
    S. Schechter, T. Parnell, A. Hartemink. Anonymous Authentication of Membership in Dynamic Group. Financial Cryptography’99. Springer-Verlag, 1999, 184–195.Google Scholar
  6. SCP.
    A. De Santis, and G. Di Crescenzo and G. Persiano. Commmunicatione efficient Anonymous Group Identification. With An extended abstract appears in the Proc. of the Fifth ACM Conference on Computer and Communications Security. 1998, page 73–82.Google Scholar
  7. SCPM.
    A. De Santis, G. Di Crescenzo, G. Persiano, and M. Yung, On Monotone Formula Closure of SZK, Proceedings of 35th IEEE Symposium on Foundations of Computer Science (FOCS’ 94), Santa Fe, New Mexico, USA, November 20–22, 1994, pp. 454–465.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Chan H. Lee
    • 1
  • Xiaotie Deng
    • 1
  • Huafei Zhu
    • 2
  1. 1.Department of Computer ScienceCity University of Hong KongHong Kong
  2. 2.Department of Information and Electronics EngineeringZhejiang Univ. Zhejiang-Inst-Information Science and EngineeringHangzhouPeoples R. China

Personalised recommendations