Relaxing Chosen-Ciphertext Security

By Ran Canetti, Hugo Krawczyk, Jesper Buus Nielsen. Annual International Cryptology Conference, 2003

311 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

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

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. Craig Gentry
4. Amit Sahai
5. Shai Halevi
6. Allison Bishop
7. Benoît Libert
8. Jonathan Katz

In Computer Networks and Communications

1. Dan Boneh
2. Susan Hohenberger
3. Jens Groth
4. Shai Halevi
5. Jonathan Katz
6. Brent Waters
7. Ran Canetti
8. Robert Huijie Deng

Citations in the corpus

• Attribute-Based Encryption With Verifiable Outsourced Decryption (2013, background): “[32] called replayable CCA (RCCA) security, which allows modifications to the ciphertext provided they cannot change the underlyingmessage in ameaningful way.”
• Chosen-ciphertext secure proxy re-encryption (2007, methodology): “This definitional approach is reminiscent of the definition of Replayable CCA security in [13].”
• hPRESS: A Hardware-Enhanced Proxy Re-Encryption Scheme Using Secure Enclave (2020, methodology): “Their system provably fits a unidirectional extension of the Canetti–Hohenberger security model [20].”
• KSF-OABE: Outsourced Attribute-Based Encryption with Keyword Search Function for Cloud Storage (2017, methodology): “The d ifference between our security model and that in [34] is that we define an additional game to simulate the TypeII adversary with the ou tsourcing keys for all users.”
• Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption (2008, background): “The definition of chosen-ciphertext security that we first consider is naturally inspired from the bidirectional case [19] which in turn extends ideas from Canetti, Krawczyk and Nielsen [20] to the proxy re-encryption setting.”
• Fully homomorphic encryption using ideal lattices (2009, background): “There are relaxed notions of CCA2 security [3, 16 , 52], but they do not apply to a fully homomorphic scheme.”
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures (2006, methodology): “This allows us to construct constant/linear size cryptographic protocols for digital signatures, RCCAsecure encryption[20], verifiable encryption and group signatures.”
• Chosen-Ciphertext Security from Identity-Based Encryption (2004, result): “Our results of Section 4 have no counterpart in [ mry04 ].”
• Securely Outsourcing Attribute-Based Encryption with Checkability (2014, methodology): “Having this intuition, we follow the RCCA (replayable chosen ciphertext attack) security in [29], [3] to define”
• Outsourcing the Decryption of ABE Ciphertexts (2011, methodology): “We thus adopt a relaxation due to Canetti, Krawczyk and Nielsen [13] called replayable CCA security, which allows modifica-tions to the ciphertext provided they cannot change the underlying message in a meaningful way.”