Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions
By Mihir Bellare, Daniele Micciancio, Bogdan Warinschi. International Conference on the Theory and Application of Cryptographic Techniques, 2003
785 citations recorded by the source corpus.
Subfields: Artificial Intelligence
View Paper: https://www.semanticscholar.org/paper/f7436413447dac05d1c37faf59cb0847422c0c01
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
- Brent Waters
- Dan Boneh
- Jens Groth
- Amit Sahai
- Susan Hohenberger
- Melissa Chase
- Allison Bishop
- Anna Lysyanskaya
Citations in the corpus
- ANONIZE: A Large-Scale Anonymous Survey System (2014, positive): “Roughly speaking, group [17], [18], [19] and ring [20] signatures allow members of a set of users to sign messages in a way that makes it indistinguishable who in the set signed the message (in the case of group signatures the set is fixed 6, whereas in the case of ring signatures the set can be sel”
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles (2006, background): “For the forgery to be nontrivial, the adversary must not have queried the signing oracle at M * .”
- Traceable Signatures (2004, background): “[5] provide a formal model for a relaxed group signature scenario where a dealer is supposed to run the user key-generation mechanism (rather than the user itself interactively with the group manager via the Join protocol).”
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures (2006, background): “Rather this should be seen as an interesting feasibility result; under a simple and natural security assumption there exists an up to a constant optimal dynamic group signature scheme satisfying the strong security definitions from [5] [7] poly(k) BMW [5] (fixed group) Trapdoor permutations [7] poly”
- 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.”
- Structure-Preserving Signatures and Commitments to Group Elements (2010, methodology): “…using combinations of digital signatures and non-interactive zero-knowledge proofs of knowledge such as blind signatures [10] [43], group signatures [16] [19] [68], anonymous credential systems [15], verifiably encrypted signatures [26] [85], non-interactive group encryption [38] and so on, and…”
- Foundations of Group Signatures: The Case of Dynamic Groups (2005, methodology): “The first step toward this end was taken by [5], who consider the case where the group is static.”
- 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].”
- Attribute-Based Signatures (2011, methodology): “Non-interactive zero-knowledge proofs (including identitybased proofs) have previously been used in the context of efficient constructions of signature primitives [2, 24, 12, 21].”
- RingCT 2.0: A Compact Accumulator-Based (Linkable Ring Signature) Protocol for Blockchain Cryptocurrency Monero (2017, background): “, [14, 11, 7]), the group formation is spontaneous and there is no group manager to revoke the identity of the signer.”