Chosen-Ciphertext Security from Identity-Based Encryption

By Dan Boneh, Ran Canetti, Shai Halevi, Jonathan Katz. SIAM journal on computing (Print), 2004

1,135 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/0af6383c9526d26e4a2c78cf884d220b0ca2625e

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

Provably secure ciphertext policy ABE (2007, methodology): “In [4], Canetti, Halevi and Katz gave a generic construction for CCA secure public key encryption, using CPA secure IBE and strongly existentially unforgeable signatures.”
Chosen-ciphertext secure proxy re-encryption (2007, methodology): “[11] Ran Canetti, Shai Halevi, and Jonathan Katz.”
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.”
Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption (2010, methodology): “It is easy to convert the (CPA-secure) proposed FE scheme to a CCA-secure FE scheme by employing an existing general conversion such as that by Canetti, Halevi and Katz [11] or that by Boneh and Katz [8] (using additional 8-dimensional dual spaces (B d+1 , B * d+1 ) with n d+1 := 2 on the proposed F”
Attribute based data sharing with attribute revocation (2010, methodology): “[7] R. Canetti, S. Halevi, and J. Katz.”
Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys (2007, background): “The Cannetti, Halevi, and Katz [12] result applies here.”
VABKS: Verifiable attribute-based keyword search over outsourced encrypted data (2014, background): “• Selective security against chosen-keyword attack: Without being given any matching search token, A cannot infer any information about the plaintext keyword of a keyword ciphertext in the selective security model, where A must determine IEnc it intends to attack before the system is boostrapped [35”
A ciphertext-policy attribute-based encryption scheme with constant ciphertext length (2009, methodology): “This technique is the same as the CHK (Canetti, Halevi and Katz) technique [13] that is a generic construction for a CCA-secure public key encryption using a CPA-secure IBE and an SEU one-time signature.”
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions (2009, methodology): “Chosen Ciphertext Security We note that using the transformation of Canetti, Halevi, and Katz [12] we can achieve chosen ciphertext security from the HIBE scheme of Section 5.”
Direct chosen ciphertext security from identity-based techniques (2005, methodology): “) cannot be determined at setup time by the simulator as in previous IBE-to-CCA2 transformations such as CHK [11] and BK [8].”
Charm: a framework for rapidly prototyping cryptosystems (2013, methodology): “4 Adapter chain converting the Boneh–Boyen selective-ID secure IBE [17] into a CCA-secure public-key hybrid encryption scheme via the CHK transform [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.”
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption (2010, methodology): “…(CPA-secure) basic (H)PE scheme to a CCA-secure (H)PE scheme by employing an existing general conversion such as that by Canetti, Halevi and Katz [16] or that by Boneh and Katz [11] (us-ing an additional level with two-dimensions for the basic (H)PE scheme, and a strongly unforgeable one-time…”
Lossy trapdoor functions and their applications (2008, methodology): “Another interesting comparison is to the techniques used to construct CCA-secure cryptosystems from identity-based encryption (IBE) [60] that were introduced by Canetti, Halevi, and Katz [17] and improved in later work [15, 16, 14].”
Efficient Identity-Based Encryption Without Random Oracles (2005, methodology): “Since the transformations [10, 6] only require Selective-ID security at the second level our hybrid construction is CCA secure without any significant further degradation in the security reduction relative to our non-hierarchical construction.”
Identity-Based Proxy Re-encryption (2007, background): “…encryption has proven useful in solving several key-distribution issues, and has permitted the development of a variety of novel cryptographic protocols, e.g., secret handshakes [2], public-key searchable encryption [5] [19], CCA2-secure public-key encryption [10], and digital signatures [6].”
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups (2008, background): “This property is required for some applications [1,13,42].”
Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption (2008, methodology): “In order to apply the Canetti–Halevi–Katz methodology [22], we need one-time signatures.”