Abstract. In this paper, we investigate the recent paradigm for group signatures proposed by Rivest et al. at Asiacrypt ’01. We first improve on their ring signature paradigm by showing that it holds under a strictly weaker assumption, namely the random oracle model rather than the ideal cipher. Then we provide extensions to make ring signatures suitable in practical situations, such as threshold schemes or ad-hoc groups. Finally we propose an efficient scheme for threshold scenarios based on a combinatorial method and provably secure in the random oracle model. 1
|
1976
|
A method for obtaining digital signatures and public-key cryptosystems
– Rivest, Shamir, et al.
- 1978
|
|
1001
|
How to Share a Secret
– Shamir
- 1979
|
|
897
|
Random oracles are practical: A paradigm for designing efficient protocols
– Bellare, Rogaway
- 1993
|
|
788
|
A public key cryptosystem and a signature scheme based on discrete logarithms
– Elgamal
- 1985
|
|
409
|
Z.: Securing Ad Hoc Networks
– Zhou, Haas
- 1999
|
|
356
|
Undeniable signatures
– Chaum, Antwerpen
|
|
296
|
Ad Hoc Networking
– Perkins, Ed
- 2001
|
|
215
|
Wallet Databases with Observers
– Chaum, Perderson
- 1992
|
|
196
|
Threshold cryptosystem
– Desmedt, Frankel
- 1989
|
|
189
|
Authenticated key exchange secure against dictionary attacks
– Bellare, Pointcheval, et al.
- 2000
|
|
185
|
Proofs of partial knowledge and simplified design of witness hiding protocols
– Cramer, Damg˚ard, et al.
|
|
175
|
Security arguments for digital signatures and blind signatures
– Pointcheval, Stern
- 2000
|
|
174
|
Untraceable off-line cash in wallet with observers
– Brands
- 1993
|
|
169
|
Efficient group signature schemes for large groups
– Camenisch, Stadler
- 1997
|
|
159
|
Tsudik: A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
– Ateniese, Camenisch, et al.
- 2000
|
|
68
|
New group signature schemes
– Chen, Pedersen
- 1995
|
|
66
|
Multi-authority secret ballot elections with linear work
– Schoenmakers, Cramer, et al.
- 1996
|
|
62
|
Separability and Efficiency for Generic Group Signature Schemes
– Camenisch, Michels
- 1998
|
|
57
|
Some open issues and new directions in group signatures
– Ateniese, Tsudik
|
|
51
|
Etficient group signature schemes for large groups
– Camenisch, Stadler
- 1997
|
|
39
|
Practical multi-candidate election system
– Baudron, Fouque, et al.
- 2001
|
|
39
|
On monotone formula closure of SZK
– Santis, Crescenzo, et al.
|
|
32
|
How to convert any digital signature scheme into a group signature scheme
– Petersen
- 1997
|
|
28
|
Convertible group signatures
– Kim, Park, et al.
- 1996
|
|
28
|
Untraceable O-Line Cash in Wallets with Observers
– Brands
- 1994
|
|
13
|
Separability and eciency for generic group signature schemes
– Camenisch, Michels
- 1999
|
|
10
|
Color Coding
– Alon, Yuster, et al.
- 1995
|
|
9
|
Threshold Ring Signatures for Ad-hoc Groups, Advances in Cryptology – CRYPTO’2002, (these proceedings). 10 Fiat and Shamir [26] proposed a general method for converting public coins zeroknowledge proof systems into signatures. The analysis of the method i
– Bresson, Stern, et al.
|
|
8
|
Publicly verifiable lotteries: Applications of delaying functions
– Goldschlag, Stubblebine
- 1998
|
|
6
|
Group signatures for hierarchical multigroups
– Kim, Park, et al.
- 1998
|
|
6
|
Efficient Group Signature Schemes for Large Groups
– Camenish, Stadler
- 1997
|
|
4
|
Fair e-lotteries and e-casinos
– Kushilevitz, Rabin
- 2001
|
|
4
|
Proofs of Partial Knowledge and Simpli ed Design of Witness Hiding Protocols
– Cramer, Damgard, et al.
- 1995
|
|
2
|
Key Agreement in Ad-hoc Networks. Expanded version of a talk given at the Nordsec ’99 Workshop
– Asokan, Ginzboorg
- 1999
|
|
2
|
How to leak a secret. Private Com
– Rivest, Shamir, et al.
- 2001
|
|
2
|
Publicly veriable lotteries: Applications of delaying functions
– Goldschlag, Stubblebine
|
|
1
|
How to leak a secret. Private Communication
– Rivest, Shamir, et al.
- 2001
|
