A group-oriented (t, n) undeniable signature scheme without trusted center

  • Chu-Hsing Lin
  • Ching-Te Wang
  • Chin-Chen Chang
Session 8: Threshold Cryptography
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1172)


We shall propose a new group-oriented undeniable signature scheme without the assistance of any trusted center in this paper. A single group public key, instead of all public keys of individual members, is used to represent the group. A transformation is applied to convert the group public key and the message to be signed into a public parameter and thus been transmitted out. With this public parameter, a paying customer will be able to authenticate the validity of the signature with the consent of all signers. It is worth mentioning that the new group-oriented undeniable signature possesses all of the characteristics that listed in Harn and Yang's. Besides, Harn and Yang's scheme is generalized in this research.


Group-Oriented Cryptography Undeniable Signature Chaum's Scheme Group-Oriented Undeniable Signature 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    D. Chaum and H. van Antwerpen, ”Undeniable Signatures,” In Advances in Cryptology, Proc. of Crypto'89, Santa Barbara, August 20–24, 1989, pp. 212–216.Google Scholar
  2. [2]
    C. C. Chang, and H. C. Lee, ”A New Generalized Group-Oriented Cryptoscheme without Trusted Centers,” IEEE Proceedings on Selected Areas in Communications, Vol. 11, No 5, June 1993, pp. 725–729.Google Scholar
  3. [3]
    Y. Desmedt, ”Society and Group Oriented Cryptography: A New Concept,” In Advances in Cryptology, Proc. of Crypto'87, Santa Barbara, August 1988, pp. 120–127.Google Scholar
  4. [4]
    Y. Desmedt, and Y. Frankel, ”Threshold Cryptosystem,” In Advances in Cryptology, Proc. of Crypto '89, Santa Barbara, August 1989, pp. 307–315.Google Scholar
  5. [5]
    Y. Desmedt, and Y. Frankel, ”Shared Generation of authenticators and Signatures,” In Advances in Cryptology, Proc. of Crypto'91, Santa Barbara, August 1991, pp. 457–469.Google Scholar
  6. [6]
    Y. Frankel. ”A Practical Protocol for Large Group Oriented Networks,” in Advances in Cryptology, Proc. of Eurocrypt'89, Houthalen, Belgium, April 1989, pp56–61.Google Scholar
  7. [7]
    L. Harn, ”Group-oriented (t, n) Threshold Signature and Digital Multisignature”, IEE Proceedings —Computers and Digital Techniques, Vol. 141, No. 5, Sept. 1994, pp. 307–313.Google Scholar
  8. [8]
    L. Harn and S. Yang, ”Group Oriented Undeniable Signature Schemes Without the Assistence of a Mutually Trusted Party,” In Advances in Cryptology, Proc. of Auscrypt'92, Gold Coast, Australia, Dec. 1992, pp. 3.22–27.Google Scholar
  9. [9]
    I.Ingemarsson, and G. J. Simmons, ”A Protocol to Set up Shared Secret Schemes without the Assistance of a Mutually Trusted Party,” In Advances in Cryptology, Proc. of Eurocrypt '90, May 1990, pp. 245–254.Google Scholar
  10. [10]
    C. H. Lin, ”On the Group Oriented Secure Communication Schemes,” The Third Conference on Information Security, Chiayi, Taiwan, May 1993.Google Scholar
  11. [11]
    C. H. Lin, and C. C. Chang, ”A Method for Constructing a Group-Oriented Cryptosystems,” Computer Communications, Vol. 17, No.11, 1994, pp. 805–808.Google Scholar
  12. [12]
    C. C. Tsai, ”Group-Oriented Cryptosystems and Signature Scheme”, Master Thesis, Institute of Information Engineering, National Chung-Kung University, Tainan, Taiwan, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Chu-Hsing Lin
    • 1
  • Ching-Te Wang
    • 2
  • Chin-Chen Chang
    • 2
  1. 1.Department of Computer and Information SciencesTunghai UniversityTaichungTaiwan 407 ROC
  2. 2.Institute of Computer Science and Information EngineeringNational Chung Cheng UniversityChiayiTaiwan 62107, ROC

Personalised recommendations