An Identity-Based Signature from Gap Diffie-Hellman Groups
By Jae Choon Cha, Jung Hee Cheon. International Conference on Theory and Practice of Public Key Cryptography, 2003
1,074 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems
View Paper: https://www.semanticscholar.org/paper/9da98c523e4ef2e0985cfddf05c610673b51a39c
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
- David Mandell Freeman
- Jonathan Katz
- Edlyn Teske
- Dan Boneh
- Benoît Libert
- Chanathip Namprempre
- Gregory Neven
In Computational Theory and Mathematics
- Benoît Libert
- Edlyn Teske
- Gregory Neven
- Giuseppe Ateniese
- Paulo L. Barreto
- Jean-Jacques Quisquater
- Noel McCullagh
- Willy Susilo
In Information Systems
- David Mandell Freeman
- Edlyn Teske
- Jonathan Katz
- Michael Scott
- Paulo L. Barreto
- Mihir Bellare
- Noel McCullagh
- Jean-Jacques Quisquater
Citations in the corpus
- A Taxonomy of Pairing-Friendly Elliptic Curves (2010, background): “In a flurry of research results, many new and novel protocols have been suggested, including one-round three-way key exchange [44], identity-based encryption [12,75], identity-based signatures [19,70], and short signature schemes [13].”
- Toward secure key distribution in truly ad-hoc networks (2003, methodology): “For ID-based signatures, we recommend, e.g., the scheme of Cha and Cheon [ 5 ] which (building on work of Boneh, Lynn, and Shacham [4]) yields signatures that are”
- Certificateless Public Key Cryptography (2003, neutral): “There now exist identity-based key exchange protocols (interactive [31] as well as non-interactive [33]), signature schemes [10, 23, 26], hierarchical schemes [20] and a host of other primitives.”
- Improved Identity-Based Signcryption (2005, neutral): “(8) Also, Pr[D-ER ^ :E-ER ^ :H-ER ^ :S-ER ^ Ch2 ^ CG2℄ = Pr[D-ER℄ Pr[:E-ER ^ :H-ER ^ :S-ER℄ Pr[Ch2 ^ CG2℄ (by independen e).”
- A new identity based signcryption scheme from pairings (2003, methodology): “Other identity based schemes using pairings were proposed after 2001 ([6],[25],[14],[29],[8]).”
- A survey on peer-to-peer key management for mobile ad hoc networks (2007, methodology): “Integration of the distributed key generation scheme [Gennaro et al. 1999] into the setup algorithm of the identitybased signature scheme [Cha and Cheon 2003] will enable the generation of a distributed master private key.”
- Identity-Based Signcryption (2002, background): “Since then the ideas of [7] have been used to design several other identity-based schemes [9, 15, 16, 22].”
- Identity-Based Remote Data Integrity Checking With Perfect Data Privacy Preserving for Cloud Storage (2017, methodology): “The data owner stores the file M together with (r, {σi}, IDS(r||fname)), to the cloud, where IDS(r||fname) is an identity-based signature [38], [39] from the data owner on the value r||fname.”
- Charm: a framework for rapidly prototyping cryptosystems (2013, neutral): “Schnorr [23] Signature Integer ROM 33 RSA-PSS [11] Signature Integer ROM 32 EC-DSA & DSA [65] Signature EC/Integer n/a 32 HW09 [51] Signature Integer Standard 113 CHP [26] Signature Pairing Standard 30 CL03 [29] Signature Integer Standard 58 CL04 [30] Signature Pairing ROM 25 HW [51] Identity-based ”
- Secret handshakes from pairing-based key agreements (2003, background): “Finally, although our handshake schemes build on previous work in identity-based cryptography, identity-based signatures (see, for example [28, 12]) aren’t appropriate here because they aren’t intended to restrict verification to group members.”
- Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps (2005, methodology): “We recall here the usual model [5, 12, 15, 19, 24] of security for identity-based signatures which is an extension of the usual notion of existential unforgeability under chosen-message attacks [22].”