Chosen ciphertext secure encryption under factoring assumption revisited

Authors:
Qixiang Mei;Bao Li;Xianhui Lu;Dingding Jia
Affiliations:
State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing, China and School of Information, Guangdong Ocean University, Zhanjiang, China;State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing, China;State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing, China;State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing, China
Venue:
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Year:
2011

Citing 24
Cited 3

A simple unpredictable pseudo random number generator

SIAM Journal on Computing
An efficient probabilistic public key encryption scheme which hides all partial information

Proceedings of CRYPTO 84 on Advances in cryptology
A key distribution system equivalent to factoring

Journal of Cryptology
A hard-core predicate for all one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Non-malleable cryptography

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Pseudorandom Functions and Factoring

SIAM Journal on Computing
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack

SIAM Journal on Computing
Lossy trapdoor functions and their applications

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption

ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Chosen-Ciphertext Security via Correlated Products

TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Practical Chosen Ciphertext Secure Encryption from Factoring

EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
The Group of Signed Quadratic Residues and Applications

CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Using hash functions as a hedge against chosen ciphertext attack

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Chosen-ciphertext secure key-encapsulation based on gap hashed Diffie-Hellman

PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
A simpler construction of CCA2-secure public-key encryption under general assumptions

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Secure hybrid encryption from weakened key encapsulation

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
The twin Diffie-Hellman problem and applications

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
A twist on the naor-yung paradigm and its application to efficient CCA-secure encryption from hard search problems

TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Cryptography in subgroups of Zn

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Simple and efficient public-key encryption from computational diffie-hellman in the standard model

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography

Improved efficiency of chosen ciphertext secure encryption from factoring

ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Strongly secure authenticated key exchange from factoring, codes, and lattices

PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Improved tradeoff between encapsulation and decapsulation of HK09

Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In Eurocrypt 2009, Hofheinz and Kiltz proposed a practical chosen ciphertext (CCA) secure public key encryption under factoring assumption based on Rabin trapdoor one-way permutation. We show that when the modulus is special such that ZN* has semi-smooth order, the instantiation of Hofheinz-Kiltz 09 scheme (HK09) over a much smaller subgroup of quadratic residue group (Semi-smooth Subgroup) is CCA secure as long as this type of modulus is hard to be factored. Since the exponent domain of this instantiation is much smaller than the original one, the efficiency is substantially improved. In addition, we show how to construct a practical CCA secure encryption scheme from ElGamal trapdoor one-way function under factoring assumption.When instantiated over Semi-smooth Subgroup, this scheme has even better decryption efficiency than HK09 instantiation.