Short Group Signatures

By Dan Boneh, Xavier Boyen, Hovav Shacham. Annual International Cryptology Conference, 2004

2,240 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Geometry and Topology, Information Systems

View Paper: https://www.semanticscholar.org/paper/ace8cec40fb238e4982d0158d4ee63abb045dad2

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

1. Brent Waters
2. Dan Boneh
3. Amit Sahai
4. Jens Groth
5. Allison Bishop
6. Xavier Boyen
7. Jonathan Katz
8. Craig Gentry

In Geometry and Topology

1. Jens Groth
2. Brent Waters
3. Eike Kiltz
4. Xavier Boyen
5. David Pointcheval
6. Olivier Sanders
7. Amit Sahai
8. Xiaodong Lin

In Information Systems

1. Brent Waters
2. Dan Boneh
3. Jens Groth
4. Xavier Boyen
5. Amit Sahai
6. Jan Camenisch
7. Jonathan Katz
8. Eike Kiltz

Citations in the corpus

• Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System (2007, methodology): “That is, it is believed that the DLDH problem is a hard problem even in the bilinear groups where DDH is easy [ 10 ,23].”
• Pseudonym Schemes in Vehicular Networks: A Survey (2015, methodology): “To cope with the increase of communication overhead due to this additional certification layer, this protocol adopts short group signatures [143].”
• Efficient Noninteractive Proof Systems for Bilinear Groups (2008, methodology): “Security depends on the symmetric external Diffie-Hellman (SXDH) assumption [33,8,1,20,34] that says the DDH problem is hard in both G1 and G2.”
• 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].”
• Anonysense: privacy-aware people-centric sensing (2008, background): “[2] to allow MNs to generate group signatures.”
• ANONIZE: A Large-Scale Anonymous Survey System (2014, neutral): “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”
• Public-Key Cryptosystems Resilient to Key Leakage (2009, background): “Boneh, Boyen, and Shacham [8] introduced the Linear assumption, intended to take the place of DDH in groups where DDH is easy (specifically, in bilinear groups).”
• An Algebraic Framework for Diffie–Hellman Assumptions (2013, methodology): “2-Lin holds in generic bilinear groups [2] and it has virtually become the standard decisional assumption in the group in the bilinear setting.”
• Short Signatures Without Random Oracles (2004, methodology): “A related system using random oracles was recently described by Zhang et al. [ ZSNS04 ].”
• Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures (2008, methodology): “We also use the External Diffie-Hellman (XDH) assumption used in, for example, [3,20,7] to achieve recipient anonymity, which holds on MNT curves [17].”
• Group signatures with verifier-local revocation (2004, background): “At a high level, one can consider three natural communication models for re­voking a user s signing capabilities, without a.ecting other group members: 1.”