Practical chosen ciphertext secure encryption from factoring
type: Item
instance of: scholarly article
title: Practical chosen ciphertext secure encryption from factoring
zbMATH Open document ID: 1291.94097
author: Eike Kiltz
author: Victor Shoup
author: Dennis Hofheinz
published in: Journal of Cryptology
publication date: 2013-04-15T00:00:00Z
full work available at URL: https://ir.cwi.nl/pub/15191
review text: 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)].
reviewed by: Olaf Ninnemann
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6153966
Wikidata QID: Q59163682
MaRDI profile type: Publication
OpenAlex ID: W2167595647
cites work: RSA and Rabin Functions: Certain Parts are as Hard as the Whole
cites work: Q4365732
cites work: Q4249316
cites work: An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
cites work: A Simple Unpredictable Pseudo-Random Number Generator
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Chosen‐Ciphertext Security from Identity‐Based Encryption
cites work: Advances in Cryptology - CRYPTO 2003
cites work: The random oracle methodology, revisited
cites work: The Twin Diffie-Hellman Problem and Applications
cites work: The twin Diffie-Hellman problem and applications
cites work: Q4737235
cites work: Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
cites work: A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
cites work: Nonmalleable Cryptography
cites work: Stronger security proofs for RSA and Rabin bits.
cites work: Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art
cites work: Probabilistic encryption
cites work: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
cites work: Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
cites work: Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
cites work: Secure Hybrid Encryption from Weakened Key Encapsulation
cites work: Practical Chosen Ciphertext Secure Encryption from Factoring
cites work: Theory of Cryptography
cites work: Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman
cites work: A New Randomness Extraction Paradigm for Hybrid Encryption
cites work: Advances in Cryptology – CRYPTO 2004
cites work: The development of the number field sieve
cites work: A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order
cites work: Chosen Ciphertext Secure Encryption under Factoring Assumption Revisited
cites work: Pseudorandom Functions and Factoring
cites work: Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
cites work: Lossy trapdoor functions and their applications
cites work: Selected Areas in Cryptography
cites work: Q4035737
cites work: Efficient Chosen-Ciphertext Security via Extractable Hash Proofs
cites work: A modification of the RSA public-key encryption procedure (Corresp.)
DBLP publication ID: journals/joc/HofheinzKS13
DOI: 10.1007/S00145-011-9115-0
Recommended article: Q3155205
Recommended article: Q3155200
Recommended article: Q3155207
Recommended article: Q3155195
Recommended article: Q3155199
Recommended article: Q3155201
Recommended article: Q3155194
Recommended article: Q3155203
Recommended article: Q3155196
Recommended article: Some observations on the theory of cryptographic hash functions
description: scientific article; zbMATH DE number 6153966