Direct chosen ciphertext security from identity-based techniques

By Xavier Boyen, Qixiang Mei, Brent Waters. Conference on Computer and Communications Security, 2005

300 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems

View Paper: https://www.semanticscholar.org/paper/74bc2d394294eecba7a60af73c004ea957ac59bf

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. Xavier Boyen
4. Eike Kiltz
5. Chris Peikert
6. Amit Sahai
7. Allison Bishop
8. Shai Halevi

In Computational Theory and Mathematics

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

In Information Systems

1. Brent Waters
2. Xavier Boyen
3. Eike Kiltz
4. Dan Boneh
5. Benoît Libert
6. Chris Peikert
7. Jonathan Katz
8. Shai Halevi

Citations in the corpus

• Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption (2008, methodology): “The security proofs (in a model that naturally generalizes the one of the scheme with temporary delegation) rely on the same assumption but with a looser reduction due to the use of Waters’ technique.”
• Chosen-Ciphertext Security from Identity-Based Encryption (2004, background): “Both NIZK proofs and smooth hash proof systems were shown to meet the requirements for these proofs of well-formedness, and thus all the schemes mentioned above (with the possible exception of [ ddn00 ]) may be viewed as instantiations of a single paradigm.”
• Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) (2006, methodology): “Adaptive chosen-ciphertext security can be achieved very effectively using one of several techniques [15,11,13], all of which are applicable here.”
• Secure Hybrid Encryption from Weakened Key Encapsulation (2007, methodology): “On the other hand, the security proofs of all known schemes based on IBE techniques [10,9,19,20,18] inherently rely on some sort of external consistency check for the ciphertexts.”
• Attribute-based encryption for fine-grained access control of encrypted data (2006, unknown): “methods [11, 12] to achieve greater efficiency.”
• Lossy trapdoor functions and their applications (2008, methodology): “2 Another interesting comparison is to the techniques used to prove CCA security from IdentityBased Encryption (IBE) [45] that were introduced by Canetti, Halevi, and Katz [11] and improved in later work [9, 10, 8].”