Method and device for anonymous signature with a shared private key
Patent 7571324 Issued on August 4, 2009. Estimated Expiration Date: December 13, 2022. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.
A cryptographic method and apparatus for anonymously signing a message. Added to the anonymous signature is another signature which is calculated (operation 13) using a private key common to all the members of a group authorized to sign and unknown to all revoked members. The private key is updated (operations 8, 11) at group level on each revocation within the group and at member level only on anonymous signing of a message by the member.
Petersen, Holger, “How to Convert any Digital Signature Scheme into a Group Signature Scheme”, LNCS 1361, pp. 178-190.
E. Bresson et al.., “Efficient Revocation in Group Signatures”, Public Key Cryptography PKC 2001, vol. 1992 of LNCS, pp. 190-206, Springer-Verlag, 2001.
H.J. Kim et al., “Efficient and Secure Member Deletion in Group Signature Schemes”, ICISC 2000—LNCS vol. 2015, pp. 150-161, Springer-Verlag 2000.
Chung Kei Wong et al., Secure Group Communications Using Key Graphs, Technical Report TR-97-23, pp. 1-27, Jul. 28, 1997.
Jan Camenisch et al, “Efficient Group Signature Schemes for Large Groups”, Advances in Cryptology—CRYPT097, vol. 1296 of LNCS, pp. 410-424, 1997.
Jan Camenisch et al., “A Group Signature Scheme with Improved Efficiency”, Advances in Cryptology—ASIACRYPT'98, LNCS vol. 1514, pp. 160-174, Springer-Verlag. 2000.
Tzong-Sun Wu et al., “Threshold Signature Scheme Using Self-Certificate Public Keys,” Jan. 2002, National Taiwan University of Science and Technology; pp. 1-9.
Chuan-Kun Wu et al., “Many-to-one Cryptographic Algorithms and Group Signature,” Jan. 1999, University of Western Sydney; pp. 1-18.
Hyun-Jeong Kim et al., “Efficient and Secure Member Deletion in Group Signature Schemes,” D.Won (ed): ICISC 2000, pp. 150-161; Springer-Verlag Berlin Heidelberg 2001.
Camenisch, Jan Leonhard, “Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem,” 1998, Swiss Federal Institure of Technology Zurich, Doctor of Technical Sciences Thesis., Diss. ETH No. 12520.