Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack

By Ronald Cramer, Victor Shoup. SIAM journal on computing (Print), 2003

1,022 citations recorded by the source corpus.

Subfields: Artificial Intelligence

View Paper: https://www.semanticscholar.org/paper/90121e5f24c1392c00dadb7e5b6233bac41954a7

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. Eike Kiltz
4. Amit Sahai
5. Shai Halevi
6. Jens Groth
7. Chris Peikert
8. Craig Gentry

Citations in the corpus

• Security of public-key cryptosystems based on Chebyshev polynomials (2004, background): “We refer the interested reader to the journal version [11] of such a paper [10] for details about the cryptosystem and for a brief hystorical excursus.”
• An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem (2004, neutral): “Workssuchas[8,9,14,19, 11 ,20]providedesignsofIND-CCA-secureasymmetricencryption”
• Chosen-Ciphertext Security from Identity-Based Encryption (2004, methodology): “Thus, given current techniques, this methodology for constructing CCA-secure cryptosystems serves as a “proof of feasibility” but does not lead to practical constructions.”
• New Algorithms for Secure Outsourcing of Modular Exponentiations (2012, methodology): “In this section, we propose two secure outsourcing algorithms for Cramer-Shoup encryption scheme [20] and Schnorr signature scheme [46].”
• How to use indistinguishability obfuscation: deniable encryption, and more (2014, background): “There exist known transformations [CS04] for CCA-KEMs to CCA-28 secure encryption.”
• A New Randomness Extraction Paradigm for Hybrid Encryption (2009, methodology): “In contrast, due to the dependence on the target colission resistant hash function, the efficient schemes from [2, 17] cannot be directly explained through Cramer and Shoup’s hash proof system framework [3] and therefore all require separate proofs.”
• Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption (2001, background): “Up until now, the only practical scheme that has been proposed that can be proven secure against adaptive chosen ciphertext attack under a reasonable intractability assumption is that of Cramer and Shoup [CS1, CS3 ].”
• Identity-Based Signcryption (2002, background): “1 Con dentiality The de facto de nition of security for public key encryption schemes is indistinguishability of encryptions under chosen ciphertext attack [1, 3, 5, 10, 11].”
• Secure Hybrid Encryption from Weakened Key Encapsulation (2007, methodology): “A folklore composition theorem (formalized in [13]) shows that if both KEM and DEM are CCA-secure then the hybrid encryption is CCA-secure.”
• A New Paradigm of Hybrid Encryption Scheme (2004, methodology): “The proposed hybrid encryption scheme is based on the basic Cramer-Shoup scheme [3, 6].”
• A Modular Analysis of the Fujisaki-Okamoto Transformation (2017, neutral): “Recall that any IND - CCA secure KEM can be combined with any (one-time) chosen-ciphertext secure symmetric encryption scheme to obtain a IND - CCA secure PKE scheme [19].”