Practical chosen ciphertext secure encryption from factoring

DOI10.1007/s00145-011-9115-0zbMath1291.94097OpenAlexW2167595647WikidataQ59163682 ScholiaQ59163682MaRDI QIDQ1946594

Victor Shoup, Eike Kiltz, Dennis Hofheinz

Publication date: 15 April 2013

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/15191

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Toward RSA-OAEP Without Random Oracles ⋮ Efficient cryptosystems from \(2^k\)-th power residue symbols ⋮ Towards tight adaptive security of non-interactive key exchange ⋮ On the impossibility of purely algebraic signatures ⋮ Iteration entropy ⋮ An applications of signed quadratic residues in public key cryptography ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman ⋮ CCA-security from adaptive all-but-one lossy trapdoor functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The development of the number field sieve
• The twin Diffie-Hellman problem and applications
• Probabilistic encryption
• Stronger security proofs for RSA and Rabin bits.
• The random oracle methodology, revisited
• Chosen Ciphertext Secure Encryption under Factoring Assumption Revisited
• Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art
• Pseudorandom Functions and Factoring
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
• Lossy trapdoor functions and their applications
• Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
• Efficient Chosen-Ciphertext Security via Extractable Hash Proofs
• Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
• Secure Hybrid Encryption from Weakened Key Encapsulation
• Practical Chosen Ciphertext Secure Encryption from Factoring
• A New Randomness Extraction Paradigm for Hybrid Encryption
• A Simple Unpredictable Pseudo-Random Number Generator
• An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A modification of the RSA public-key encryption procedure (Corresp.)
• A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Nonmalleable Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Chosen‐Ciphertext Security from Identity‐Based Encryption
• Advances in Cryptology - CRYPTO 2003
• The Twin Diffie-Hellman Problem and Applications
• Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
• Selected Areas in Cryptography
• Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman
• Theory of Cryptography