Public key encryption schemes with bounded CCA security and optimal ciphertext length based on the CDH assumption

Authors:
Mayana Pereira;Rafael Dowsley;Goichiro Hanaoka;Anderson C. A. Nascimento
Affiliations:
Department of Electrical Engeneering, University of Brasília, Brasília, DF, Brazil;National Institute of Advanced Industrial Science and Technology, Tokyo, Japan;National Institute of Advanced Industrial Science and Technology, Tokyo, Japan;Department of Electrical Engeneering, University of Brasília, Brasília, DF, Brazil
Venue:
ISC'10 Proceedings of the 13th international conference on Information security
Year:
2010

Citing 11
Cited 0

A hard-core predicate for all one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Public-key cryptosystems provably secure against chosen ciphertext attacks

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

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of 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
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack

SIAM Journal on 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
The Twin Diffie–Hellman Problem and Applications

Journal of Cryptology
Secure hybrid encryption from weakened key encapsulation

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Bounded CCA2-secure encryption

ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a public key encryption scheme was proposed against adversaries with a bounded number of decryption queries based on the decisional Diffie-Helman Problems. In this paper, we show that the same result can be easily obtained based on weaker computational assumption, namely: the computational Diffie-Helman assumption.