Threshold Ring Signatures and Applications to Ad-hoc Groups

A new variety of miniature carnation characterized by its rapid and continuous production of small red-purple blooms with a larger number than normal of flowers appearing on each flower stem and its tall, strong and upright growth habit.

[1]  Yvo Desmedt,et al.  Threshold Cryptosystems , 1989, CRYPTO.

[2]  Stuart G. Stubblebine,et al.  Publicly Verifiable Lotteries: Applications of Delaying Functions , 1998, Financial Cryptography.

[3]  Jacques Stern,et al.  Threshold Ring Signatures for Ad-hoc Groups , 2002, CRYPTO 2002.

[4]  Mihir Bellare,et al.  Authenticated Key Exchange Secure against Dictionary Attacks , 2000, EUROCRYPT.

[5]  Taher El Gamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.

[6]  Jan Camenisch,et al.  Separability and Efficiency for Generic Group Signature Schemes , 1999, CRYPTO.

[7]  Dongho Won,et al.  Group Signatures for Hierarchical Multigroups , 1997, ISW.

[8]  David Chaum,et al.  Wallet Databases with Observers , 1992, CRYPTO.

[9]  Ivan Damgård,et al.  Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols , 1994, CRYPTO.

[10]  Matthew K. Franklin,et al.  Multi-Autority Secret-Ballot Elections with Linear Work , 1996, EUROCRYPT.

[11]  Stefan A. Brands,et al.  Untraceable Off-line Cash in Wallet with Observers , 2002 .

[12]  N. Asokan,et al.  Key agreement in ad hoc networks , 2000, Comput. Commun..

[13]  Gene Tsudik,et al.  Some Open Issues and New Directions in Group Signatures , 1999, Financial Cryptography.

[14]  Holger Petersen,et al.  On Signature Schemes with Threshold Verification Detecting Malicious Verifiers , 1997, Security Protocols Workshop.

[15]  Jan Camenisch,et al.  Efficient group signature schemes for large groups , 1997 .

[16]  Eyal Kushilevitz,et al.  Fair e-Lotteries and e-Casinos , 2001, CT-RSA.

[17]  Jacques Stern,et al.  Practical multi-candidate election system , 2001, PODC '01.

[18]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[19]  Ivan Stojmenovic,et al.  Ad hoc Networking , 2004 .

[20]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[21]  Stefan BrandsCWI,et al.  Untraceable Oo-line Cash in Wallets with Observers , 1993 .

[22]  Zygmunt J. Haas,et al.  Securing ad hoc networks , 1999, IEEE Netw..

[23]  Jan Camenisch,et al.  Efficient Group Signature Schemes for Large Groups (Extended Abstract) , 1997, CRYPTO.

[24]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[25]  Marc Joye,et al.  A Practical and Provably Secure Coalition-Resistant Group Signature Scheme , 2000, CRYPTO.

[26]  David Chaum,et al.  Group Signatures , 1991, EUROCRYPT.

[27]  Mam Riess Jones.  Color Coding , 1962, Human factors.

[28]  Holger Petersen,et al.  How to Convert any Digital Signature Scheme into a Group Signature Scheme , 1997, Security Protocols Workshop.

[29]  Yael Tauman Kalai,et al.  How to Leak a Secret: Theory and Applications of Ring Signatures , 2001, Essays in Memory of Shimon Even.

[30]  Seung Joo Kim,et al.  Convertible Group Signatures , 1996, ASIACRYPT.

[31]  Giovanni Di Crescenzo,et al.  On monotone formula closure of SZK , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[32]  Adi Shamir,et al.  How to share a secret , 1979, CACM.