Security Remarks on a Group Signature Scheme with Member Deletion
暂无分享,去创建一个
[1] Tatsuaki Okamoto,et al. Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations , 1997, CRYPTO.
[2] Donald W. Davies,et al. Advances in Cryptology — EUROCRYPT ’91 , 2001, Lecture Notes in Computer Science.
[3] Jacques Stern,et al. Efficient Revocation in Group Signatures , 2001, Public Key Cryptography.
[4] Burton S. Kaliski. Advances in Cryptology - CRYPTO '97 , 1997 .
[5] Dawn Xiaodong Song,et al. Practical forward secure group signature schemes , 2001, CCS '01.
[6] Arto Salomaa,et al. Public-Key Cryptography , 1991, EATCS Monographs on Theoretical Computer Science.
[7] Don Coppersmith,et al. Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known , 1996, EUROCRYPT.
[8] Lidong Chen,et al. New Group Signature Schemes (Extended Abstract) , 1994, EUROCRYPT.
[9] Moti Yung,et al. Advances in Cryptology — CRYPTO 2002 , 2002, Lecture Notes in Computer Science.
[10] Ueli Maurer,et al. Advances in Cryptology — EUROCRYPT ’96 , 2001, Lecture Notes in Computer Science.
[11] Dong Hoon Lee,et al. Efficient and Secure Member Deletion in Group Signature Schemes , 2000, ICISC.
[12] Holger Petersen,et al. How to Convert any Digital Signature Scheme into a Group Signature Scheme , 1997, Security Protocols Workshop.
[13] Alfredo De Santis,et al. Advances in Cryptology — EUROCRYPT'94 , 1994, Lecture Notes in Computer Science.
[14] Zulfikar Ramzan,et al. Group Blind Digital Signatures: A Scalable Solution to Electronic Cash , 1998, Financial Cryptography.
[15] Dan Boneh,et al. The Decision Diffie-Hellman Problem , 1998, ANTS.
[16] Mihir Bellare. Advances in Cryptology — CRYPTO 2000 , 2000, Lecture Notes in Computer Science.
[17] Jeffrey Shallit,et al. Algorithmic Number Theory , 1996, Lecture Notes in Computer Science.
[18] Jan Camenisch,et al. A Group Signature Scheme with Improved Efficiency , 1998, ASIACRYPT.
[19] Gene Tsudik,et al. Some Open Issues and New Directions in Group Signatures , 1999, Financial Cryptography.
[20] Jan Camenisch,et al. Efficient group signature schemes for large groups , 1997 .
[21] Jan Camenisch,et al. Efficient Group Signature Schemes for Large Groups (Extended Abstract) , 1997, CRYPTO.
[22] Dongho Won,et al. Information Security and Cryptology — ICISC 2000 , 2001, Lecture Notes in Computer Science.
[23] Kazuo Ohta,et al. Advances in Cryptology — ASIACRYPT’98 , 2002, Lecture Notes in Computer Science.
[24] Jan Camenisch,et al. Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials , 2002, CRYPTO.
[25] Walter Fumy,et al. Advances in Cryptology — EUROCRYPT ’97 , 2001, Lecture Notes in Computer Science.
[26] Birgit Pfitzmann,et al. Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees , 1997, EUROCRYPT.
[27] Marc Joye,et al. A Practical and Provably Secure Coalition-Resistant Group Signature Scheme , 2000, CRYPTO.
[28] David Chaum,et al. Group Signatures , 1991, EUROCRYPT.
[29] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[30] J. Camenisch,et al. A Group Signature Scheme Based on an RSA-Variant , 1998 .