Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model

DOI10.1007/978-3-642-13013-7_1MaRDI QIDQ3562884zbMATH OpenOpenAlexWikidataFDO

Authors Kristiyan Haralambiev, Tibor Jager, Eike Kiltz, Victor Shoup

Publication date 28 May 2010

Published in Public Key Cryptography – PKC 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13013-7_1

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
• Efficient public key encryption with equality test in the standard model
• Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
• Efficient Certificate-Based Encryption in the Standard Model
• Efficient probabilistic public-key cryptosystem based on the diffie-hellman problem
• Lattice-based completely non-malleable public-key encryption in the standard model
• Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption
• Simple and efficient KDM-CCA secure public key encryption

Cited in

(20)

• Dynamic and efficient joint encryption scheme in the plain public key model
• Memory lower bounds of reductions revisited
• Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
• Practical chosen ciphertext secure encryption from factoring
• Impossibility on tamper-resilient cryptography with uniqueness properties
• Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman
• Two-dimensional representation of cover free families and its applications: short signatures and more
• Toward compact public key encryption based on CDH assumption via extended twin DH assumption
• CCA Secure IB-KEM from the Computational Bilinear Diffie-Hellman Assumption in the Standard Model
• Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
• Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
• The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model
• Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
• Key encapsulation mechanisms from extractable hash proof systems, revisited
• Toward an easy-to-understand structure for achieving chosen ciphertext security from the decisional Diffie-Hellman assumption
• Strongly secure authenticated key exchange from factoring, codes, and lattices
• Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem
• Efficient probabilistic public-key cryptosystem based on the diffie-hellman problem
• Cryptanalysis and improvement of ``group public key encryption scheme supporting equality test without bilinear pairings
• Hybrid encryption in correlated randomness model and KEM combiners

This page was built for publication: Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562884)