Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions

Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Mihir Bellare , Daniele Micciancio , Bogdan Warinschi

Citations:

110 - 3 self

BibTeX

@MISC{Bellare03foundationsof,
    author = {Mihir Bellare and Daniele Micciancio and Bogdan Warinschi},
    title = {Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions},
    year = {2003}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

This paper provides theoretical foundations for the group signature primitive. We introduce strong, formal definitions for the core requirements of anonymity and traceability. We then show that these imply the large set of sometimes ambiguous existing informal requirements in the literature, thereby unifying and simplifying the requirements for this primitive. Finally we prove the existence of a construct meeting our definitions based only on the assumption that trapdoor permutations exist.

Citations

1001	Probabilistic encryption - Goldwasser, Micali - 1984
711	A digital signature scheme secure against adaptive chosenmessage attacks - Goldwasser, Micali, et al. - 1988
432	Group Signatures - Chaum, Heijst - 1991
410	Nonmalleable cryptography - Dolev, Dwork, et al. - 2000
295	Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack - Rackoff, Simon - 1992
229	Efficient group signature schemes for large groups - Camenisch, Stadler - 1997
212	Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks - Naor, Yung - 1990
209	A practical and provably secure coalition-resistant group signature scheme - Ateniese, Camenisch, et al. - 2000
171	One-way functions are necessary and sufficient for secure signatures - Rompel - 1990
149	A forward-secure digital signature scheme - Bellare, Miner - 1999
143	Multiple non-interactive zero knowledge proofs based on a single random string - Feige, Lapidot, et al. - 1990
127	Non-malleable non-interactive zero-knowledge and adaptive chosenciphertext security. FOCS - Sahai - 1999
77	A group signature scheme with improved efficiency (extended abstract - Camenisch, Michels - 1998
77	The notion of security for probabilistic cryptosystems - Micali, Racko, et al. - 1988
68	A uniform-complexity treatment of encryption and zero-knowledge - Goldreich - 1993
65	Foundations of group signatures: The case of dynamic groups - Bellare, Shi, et al. - 2005
63	Efficient and generalized group signatures - Camenisch
58	New group signature schemes - Chen, Pedersen
54	Non-Interactive Zero-Knowledge Proof-Systems - Santis, Micali, et al.
34	Practical Forward Secure Group Signature Schemes - Song - 2001
31	How to sign given any trapdoor permutation - Bellare, Micali - 1992
30	How to convert any digital signature scheme into a group signature scheme - Petersen - 1997
28	Efficient Revocation in Group Signatures - Bresson, Stern - 1992
17	Group Signatures à la carte - Ateniese, Tsudik - 1999
12	Some open issues and directions in group signatures - Ateniese, Tsudik - 1999
5	Crptograpic applications of the non-interactive metaproof and many-prover systems - Santis, Yung - 1990
2	Quasi-efficient revocation in group signature schemes. Available at http://eprint.iacr.org/2001/101.pdf - Ateniese, Tsudik
1	of Standards and Technology. Dictionary of algorithms and data structures. http://www.nist.gov/dads - I