A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

By Ronald Cramer, Victor Shoup. 1998

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Dan Boneh
2. Brent Waters
3. Mihir Bellare
4. Craig Gentry
5. Ran Canetti
6. Xavier Boyen
7. Jens Groth
8. Jonathan Katz

Citations in the corpus

• Prio: Private, Robust, and Scalable Computation of Aggregate Statistics (2017, background): “Towards this end, we assume the existence of a publickey infrastructure and the basic cryptographic primitives (CCA-secure public-key encryption [43, 108, 109], digital signatures [71], etc.”
• Mix and Match: Secure Function Evaluation via Ciphertexts (2000, methodology): “We concentrate in particular in this paper on use of the El Gamal cryptosystem [24], although use of other semantically secure cryptosystems, such as Cramer-Shoup [18], is possible.”
• Practical Identity-Based Encryption Without Random Oracles (2006, methodology): “Our approach to proving these claims closely follows the proof of security for the Cramer-Shoup encryption scheme [17], in that both proofs rely heavily on the notion of linear independence.”
• Universally Composable Commitments (2001, methodology): “Hellman assumption follows from the proof in [ cs98 ].”
• Composition and integrity preservation of secure reactive systems (2000, background): “For instance, the accepted cryptographic definition of secure asymmetric encryption only requires that an adversary in a strong type of attack cannot find out anything about the message (see [5, 8]), but nothing about possible relations on the ciphertexts.”
• Short Group Signatures (2004, methodology): “Likewise, if DDH holds in G 1 then Cramer-Shoup encryption [18] is secure in G 1 , and can be used in the group signature scheme.”
• A Proposal for an ISO Standard for Public Key Encryption (2001, methodology): “One can easily verify the following, using following the line of reasoning in [ CS98 ] and [Sho00b].”
• A New Paradigm of Hybrid Encryption Scheme (2004, methodology): “Cramer and Shoup showed the first provably secure practical public-key encryption scheme in the standard model [ 3 , 6]. It is secure against adaptive chosen ciphertext attack (IND-CCA) under the Decisional Diffie-Hellman (DDH) assumption.”
• A framework for password-based authenticated key exchange1 (2003, methodology): “7.2 The DDH Cramer Shoup Scheme We now extend the above smooth projective hashing scheme to the Cramer Shoup CCA2-secure encryption scheme [Cramer and Shoup 1998].”
• Signature Schemes and Anonymous Credentials from Bilinear Maps (2004, methodology): “The public key of the revocation manager is the public key of the Cramer-Shoup encryption scheme [18] in the group G = 〈g〉, i.”
• 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].”