Practical chosen ciphertext secure encryption from factoring
From the introduction: ``In this paper we propose a new public-key encryption scheme that is based on \textit{M. O. Rabin}'s trapdoor one-way permutation [Digital signatures and public key functions as intractable as factorization. Technical Report MIT/LCS/TR-212, Massachusetts Institute of Technology (January 1979)]. We can prove that the security of our scheme against adaptive chosen-ciphertext attacks (CCA security) is equivalent to the factoring assumption. Furthermore, the scheme is practical as its encryption performs only roughly two, and its decryption roughly one modular exponentiation. To the best of our knowledge, this is the first scheme that simultaneously enjoys those two properties. The highly readable introduction contains, moreover, more interesting information, a.o. on the history of the problem, random oracle schemes, details of the authors' construction, details of proof, and the efficiency. The result of this paper were announced by the first two authors in [Advances in cryptology -- EUROCRYPT 2009. 28th annual international conference on the theory and applications of cryptographic techniques. Lect. Notes Comput. Sci. 5479, 313--332 (2009; Zbl 1239.94052)].
- scientific article; zbMATH DE number 2128178
- scientific article; zbMATH DE number 2128173
- scientific article; zbMATH DE number 2128179
- scientific article; zbMATH DE number 2128169
- scientific article; zbMATH DE number 2128172
- scientific article; zbMATH DE number 2128174
- scientific article; zbMATH DE number 2128168
- scientific article; zbMATH DE number 2128176
- scientific article; zbMATH DE number 2128170
- Some observations on the theory of cryptographic hash functions
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A modification of the RSA public-key encryption procedure (Corresp.)
- A New Randomness Extraction Paradigm for Hybrid Encryption
- A Simple Unpredictable Pseudo-Random Number Generator
- A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
- A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
- Basing non-interactive zero-knowledge on (enhanced) trapdoor permutations: the state of the art
- Chosen ciphertext secure encryption under factoring assumption revisited
- Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
- Efficient chosen-ciphertext security via extractable hash proofs
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 1302834 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- Lossy trapdoor functions and their applications
- Nonmalleable Cryptography
- Practical Chosen Ciphertext Secure Encryption from Factoring
- Probabilistic encryption
- Pseudorandom Functions and Factoring
- RSA and Rabin Functions: Certain Parts are as Hard as the Whole
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Selected Areas in Cryptography
- Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
- Stronger security proofs for RSA and Rabin bits.
- The development of the number field sieve
- The random oracle methodology, revisited.
- The twin Diffie-Hellman problem and applications
- The Twin Diffie-Hellman Problem and Applications
- Theory of Cryptography
- Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
- Efficient public key encryption with smallest ciphertext expansion from factoring
- CCA-security from adaptive all-but-one lossy trapdoor functions
- Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Security analysis and improvement of a double-trapdoor encryption scheme
- Towards tight adaptive security of non-interactive key exchange
- On the impossibility of purely algebraic signatures
- scientific article; zbMATH DE number 1618038 (Why is no real title available?)
- scientific article; zbMATH DE number 1618066 (Why is no real title available?)
- A new Rabin-type trapdoor permutation equivalent to factoring
- Improved efficiency of chosen ciphertext secure encryption from factoring
- Provably Secure Key Assignment Schemes from Factoring
- Chosen ciphertext secure encryption under factoring assumption revisited
- A practical approach to attaining chosen ciphertext security
- scientific article; zbMATH DE number 1303967 (Why is no real title available?)
- A Practical Public Key Cryptosystem from Paillier and Rabin Schemes
- scientific article; zbMATH DE number 2009959 (Why is no real title available?)
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Iteration entropy
- An applications of signed quadratic residues in public key cryptography
- Toward RSA-OAEP without random oracles
- Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
- Magic adversaries versus individual reduction: science wins either way
- A simpler construction of CCA2-secure public-key encryption under general assumptions
This page was built for publication: Practical chosen ciphertext secure encryption from factoring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1946594)
