An Identity Based Encryption Scheme Based on Quadratic Residues

By Clifford C. Cocks. IMA Conference on Cryptography and Coding, 2001

1,161 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

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

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. Allison Bishop
5. Craig Gentry
6. Xavier Boyen
7. Vinod Vaikuntanathan
8. Shai Halevi

In Information Systems

1. Brent Waters
2. Xavier Boyen
3. Dan Boneh
4. Amit Sahai
5. Allison Bishop
6. Craig Gentry
7. Benoît Libert
8. Shai Halevi

Citations in the corpus

• Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps (2005, background): “While identity-based signature schemes (IBS) rapidly emerged [20, 23] after 1984 (see [5] for a thorough study of them), and despite another bandwidth-consuming proposal [18], it is only in 2001 that bilinear mappings over elliptic curve were found to yield the first fully practical identity-based e”
• Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys (2007, background): “Since 2001, several schemes have been introduced [14, 26, 12, 8, 7, 6, 17].”
• Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization (2011, methodology): “Several techniques used by SW were inspired by prior work on Identity-Based Encryption [36, 13, 23, 18, 10].”
• Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) (2006, background): “However, it was not until much later that Boneh and Franklin [10] and Cocks [17] presented the first practical solutions.”
• Witness encryption and its applications (2013, neutral): “(LWE) parameters [6, 1], or RSA modulus [8].”
• Predicate Privacy in Encryption Systems (2009, background): “The single challenge security game resembles security games used previously in the IBE and predicate encryption literature.”
• Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption (2010, methodology): “Predicate encryption (PE) for inner products was presented by Katz, Sahai and Waters [27] as a generalized (fine-grained) notion of encryption that covers identity-based encryption (IBE) [6,7,9,19,21,26], hidden-vector encryption (HVE) [12] and attribute-based encryption (ABE) [5,25,32,33,34].”
• Functional Encryption: Definitions and Challenges (2011, methodology): “Some examples include Identity-Based Encryption [Sha84, BF03, Coc01 ], searchable encryption [BCOP04] and Attribute-Based Encryption [SW05].”
• Multipurpose Identity-Based Signcryption (A Swiss Army Knife for Identity-Based Cryptography) (2003, methodology): “Interestingly, a more conventional approach to IBE was proposed shortly thereafter [10], albeit not as efficient as the pairing-based IBE scheme of Boneh and Franklin.”
• Secure Identity Based Encryption Without Random Oracles (2004, background): “Cocks [ Coc01 ] describes another construction using quadratic residues modulo a composite.”
• Decentralizing Attribute-Based Encryption (2011, methodology): “The first IBE schemes were constructed by Boneh and Franklin [13] and Cocks [24].”
• Identity-Based Encryption from the Weil Pairing (2001, background): “Recently, Cocks [ 8 ] proposed another IBE system whose security is based on the dicult y of distinguishing quadratic residues from non-residues in the ring Z=NZ where N is an RSA modulus (i.e., a product of two large primes).”
• Identity-Based Encryption with Outsourced Revocation in Cloud Computing (2015, background): “On the aspect of construction, these first schemes [4], [14] were proven secure in random oracle.”
• Revocation and Tracing Schemes for Stateless Receivers (2001, background): “The recent proposals of Boneh and Franklin [8] and Cocks [16] fit this requirement.”
• Multi-Dimensional Range Query over Encrypted Data (2007, background): “A pairing is an efficiently computable, non-degenerate function, e : G × G → G (cid:2) , satisfying the bilinear property that e ( g r , (cid:4) g s ) = e ( g, (cid:4) g ) rs .”
• Chosen-Ciphertext Security from Identity-Based Encryption (2004, methodology): “The concept of identity-based encryption was introduced by Shamir [s84], and provablysecure IBE schemes (in the random oracle model) were recently demonstrated by Boneh and Franklin [bf01] and Cocks [ c01 ].”