A Forward-Secure Public-Key Encryption Scheme

By Ran Canetti, Shai Halevi, Jonathan Katz. Journal of Cryptology, 2003

951 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/68dd597bf210da9d7e090713e57b327ba339475b

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

In Computational Theory and Mathematics

Citations in the corpus

New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts (2010, positive): “We prove this by applying the theorems of Katz, Sahai, and Waters [14].”
Efficient Lattice (H)IBE in the Standard Model (2010, methodology): “A weaker notion of IBE security given by Canetti, Halevi, and Katz [15] forces the adversary to announce ahead of time the public key it will target, which is known as a selective-identity attack ( IND-sID-CCA2 ).”
Fuzzy Identity-Based Encryption (2005, background): “Shamir’s secret sharing within the exponent gives our scheme the crucial property of being error-tolerant since only a subset of the private key components are needed to decrypt a message.”
Attribute-based encryption for fine-grained access control of encrypted data (2006, methodology): “seen as analogous to the selective-ID model [15, 16, 7] used in identity-based encryption (IBE) schemes [34, 9, 17].”
Decentralizing Attribute-Based Encryption (2011, methodology): “Other standard model solutions followed [20, 9, 10, 52, 27], along with extensions to the hierarchical IBE setting [34, 28, 11].”
Direct chosen ciphertext security from identity-based techniques (2005, background): “Somewhat surprisingly, Canetti Halevi and Katz [11] were able to show how to elegantly construct a CCA2-secure cryptosystem from any identity-based encryption (IBE) scheme secure in the selective-ID model [10].”
Chosen-ciphertext secure proxy re-encryption (2007, methodology): “[11] Ran Canetti, Shai Halevi, and Jonathan Katz.”
Vanish: Increasing Data Privacy with Self-Destructing Data (2009, background): “A potential alternative to standard encryption might be to use forward-secure encryption [6, 13], yet our goal is strictly stronger than forward secrecy.”
MPSS: Mobile Proactive Secret Sharing (2010, methodology): “scheme [Canetti et al. 2003], which is the first known forward-secure encryption scheme in the literature.”
Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys (2007, methodology): “Concerning the security, we follow the definition of the classical security notions for BE (security against static adversaries) [10], which is close to the notion of selectiveID security, used in [6, 11].”
Dining Cryptographers Revisited (2004, background): “, [6]), as well as the random oracle assumption [4].”
Riposte: An Anonymous Messaging System Handling Millions of Users (2015, background): “Even the first-attempt scheme sketched in Section III-A providesforward securityin the event that all of the servers’ secret keys are compromised [14].”
Identity-based encryption with efficient revocation (2008, methodology): “Since the existing Fuzzy IBE schemes are only secure in the weaker selective-ID model [9], where the adversary has to declare the challenge identity up front, with the above approach we can only achieve selective-ID security as well.”
New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques (2012, methodology): “This proof technique was previously used in the context of identity-based encryption [9] [11] [6] [7] [34].”
Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures (2008, methodology): “Since the adversary must commit to the challenge ciphertext policies before the setup phase, this model can be considered to be analogous to the selective-ID model [8, 9] used in identity-based encryption schemes.”