A Practical and Provably Secure Coalition-Resistant Group Signature Scheme

By Giuseppe Ateniese, Jan Camenisch, Marc Joye, Gene Tsudik. Annual International Cryptology Conference, 2000

913 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/5e3eb90dd47807b1ab9d7a5e871750935f6a4ac5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Networks and Communications

Citations in the corpus

A Signature Scheme with Efficient Protocols (2002, neutral): “[1] group signature scheme.”
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials (2002, methodology): “We note that both our dynamic accumulator scheme and the ACJT identity escrow/group signature scheme rely on the strong RSA assumption.”
Traceable Signatures (2004, methodology): “We capture these two framing notions with the experiment described in figure 4 (we remark that “exculpability” of group signatures [2] is integrated in this experiment).”
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation (2001, methodology): “We solve it by extending ideas found in the constructions of strong-RSA-based signature schemes [23,30] and group signature schemes [2].”
On Signatures of Knowledge (2006, background): “Next, let us show how signatures of knowledge give rise to a simple group signature scheme [11, 7, 1, 2, 5].”
How to win the clonewars: efficient periodic n-times anonymous authentication (2006, background): “A suite of cryptographic primitives such as group signatures [27, 21, 1, 6] and anonymous credentials [25, 30, 39, 14, 16, 17] has been developed to let us prove that a piece of data comes from an authorized source without revealing the identity of that particular source.”
A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols (2010, background): “In fact, minor flaws in protocol designs [3,11,45] (which can be fixed easily once detected) can lead to serious security flaws [36,41,55].”
Forward-Secure Signatures with Optimal Signing and Verifying (2001, background): “[12, 6, 27].”
Direct anonymous attestation (2004, methodology): “The main difference of this DAA-signing protocol to the signature generation in prior schemes such as [1, 6, 8] is that here we have distributed the necessary operation to two parties, the TPM and the host.”
Terra: a virtual machine-based platform for trusted computing (2003, neutral): “A practical implementation is given in [9].”
Secret handshakes from pairing-based key agreements (2003, methodology): “For example, signatures generated with a group signature scheme [14, 11, 18 , 9] only allow the verifier to determine the signature was generated by someone in the group.”
Short Group Signatures (2004, methodology): “[2], where the challenge c rather than the values R1, .”
Anonymous Identification in Ad Hoc Groups (2004, background): “Subsequent work on group signatures and on anonymous identification in general [20, 24, 13, 18, 16, 23, 3, 1, 11, 14, 6, 2] allowed for more efficient designs and formal modelling of the primitive, with the current state of the art being the scheme by Ateniese et al.”
Signature Schemes and Anonymous Credentials from Bilinear Maps (2004, background): “All prior schemes [1, 9, 10, 2] required proofs of knowledge of representations over groups modulo large moduli (for example, modulo an RSA modulus, whose recommended length is about 2K Bits).”