(Enter summary)
Abstract: Constructing practical and provably secure group signature schemes has been a very active research topic in recent years. A group signature can be viewed as a digital signature with certain extra properties. Notably, anyone can verify that a signature is generated by a legitimate group member, while the actual signer can only be identified (and linked) by a designated entity called a group manager. (Update)
Cited by: More
Secure Online English Auctions - Jarrod Trevathan Email
(Correct)
Anonymous Identification in Ad Hoc Groups - Yevgeniy Dodis Aggelos (2004)
(Correct)
Accumulators from Bilinear Pairings and Applications to ID-based.. - Nguyen (2005)
(Correct)
Active bibliography (related documents): More All
0.6: On the Security of a Group Signature Scheme with Forward Security - Wang (2003)
(Correct)
0.5: Signature Schemes and Applications to Cryptographic Protocol.. - Lysyanskaya (2002)
(Correct)
0.5: Dynamic Accumulators and Application to Efficient.. - Camenisch, Lysyanskaya (2002)
(Correct)
Similar documents based on text: More All
0.9: Quasi-Efficient Revocation of Group Signatures - Ateniese, Tsudik (2001)
(Correct)
0.8: A Practical and Provably Secure Coalition-Resistant.. - Ateniese.. (2000)
(Correct)
0.8: Practical Forward Secure Group Signature Schemes - Song
(Correct)
Related documents from co-citation: More All
8: Collision-free accumulators and fail-stop signature schemes without trees
- Baric, Pfitzmann - 1997
7: Group signatures (context) - Chaum, van Heijst - 1992
6: How to prove yourself: Practical solutions to identification and signature probl..
- Fiat, Shamir - 1987
BibTeX entry: (Update)
G. Tsudik and S. Xu, "Accumulating composites and improved group signing," in Advances in Cryptology---ASIACRYPT-2003. http://citeseer.ist.psu.edu/tsudik03accumulating.html More
@misc{ tsudik03accumulating,
author = "G. Tsudik and S. Xu",
title = "Accumulating composites and improved group signing",
text = "G. Tsudik and S. Xu, Accumulating composites and improved group signing,
in Advances in Cryptology---ASIACRYPT-2003.",
year = "2003",
url = "citeseer.ist.psu.edu/tsudik03accumulating.html" }
Citations (may not include all citations):
659
Random Oracles Are Practical: A Paradigm for Designing Ecien..
- Bellare, Rogaway
601
A Public-Key Cryptosystem and a Signature Scheme Based on th.. (context) - ElGamal - 1985
501
A Digital Signature Scheme Secure against Adaptive Chosen-me..
- Goldwasser, Micali et al. - 1988
411
How to Prove Yourself: Practical Solutions to Identi cation ..
- Fiat, Shamir
166
Wallet Databases with Observers (context) - Chaum, Pedersen
162
Public Key Cryptosystems Based on Composite Degree Residuosi..
- Paillier
159
A Concrete Security Treatment of Symmetric Encryption: Analy.. (context) - Bellare, Desai et al.
154
Group Signatures (context) - Chaum, van Heyst
103
Statistical Zero Knowledge Protocols to Prove Modular Polyno.. (context) - Fujisaki, Okamoto
101
Collision-Free Accumulators and Fail-Stop Signature Schemes ..
- Baric, tzmann
93
A Practical and Provably Secure Coalition-Resistant Group Si..
- Ateniese, Camenisch et al.
89
the Security of ElGamal Based Encryption
- Tsiounis, Yung
76
New Group Signature Schemes (context) - Chen, Pedersen
76
Identity Escrow
- Kilian, Petrank
54
Ecient Signature Generation by Smart Cards (context) - Schnorr - 1991
43
Some Open Issues and New Directions in Group Signatures
- Ateniese, Tsudik
36
RSA-Based Undeniable Signatures
- Gennaro, Krawczyk et al. - 2000
35
Group Signature Schemes and Payment Systems Based on the Dis.. (context) - Camenisch - 1998
32
Ecient Group Signature Schemes for Large Groups (context) - Camenisch, Stadler
28
Dynamic Accumulators and Application to Ecient Revocation of.. (context) - Camenisch, Lysyanskaya
25
Practical Forward Secure Group Signature Schemes
- Song
24
Finding a Small Root of a Bivariate Integer Equation; Factor.. (context) - Coppersmith
22
Paillier's Cryptosystem Revisited
- Catalano, Gennaro et al.
21
A Group Signature Scheme based on an RSA-variant
- Camenisch, Michels
18
Separability and Eciency for Generic Group Signature Schemes (context) - Camenisch, Michels
17
Ecient Proof that a Committed Number lies in an Interval (context) - Boudot
16
Two-Party Generation of DSA Signatures
- MacKenzie, Reiter
16
Personal Communication (context) - Coppersmith - 2003
13
An Improved Pseudo-Random Generator Based on the Discrete Lo..
- Gennaro
7
An Integer Commitment Scheme Based on Groups with Hidden Ord.. (context) - Damgard, Fujisaki
6
Ecient Computation Modulo a Shared Secret with Application t.. (context) - Algesheimer, Camenisch et al.
6
Group Signatures with Ecient Revocation (context) - Bresson, Stern
6
Quasi-Ecient Revocation of Group Signatures (context) - Ateniese, Song et al.
4
Foundations of Group Signatures: Formal De nitions (context) - Bellare, Micciancio et al.
3
Ecient Concurrent Zero-Knowledge in the Auxiliary String Mod..
- Damgard
1
Each Come - Easy Go Divisible Cash (context) - Chan, Frankel et al.
1
Cash Scheme System Based on the Representation Problem (context) - Brands, -Line
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://eprint.iacr.org/curr/): More
Cryptanalysis of Stream Cipher COS (2, 128) Mode I - Wu, Bao (2002)
(Correct)
Tree-based Group Key Agreement - Kim, Perrig, Tsudik (2002)
(Correct)
Generic Lower Bounds for Root Extraction and Signature.. - Damgård, Koprowski (2002)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC