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

DOI10.1007/978-3-642-13013-7_1zbMath1271.94020OpenAlexW2102697875WikidataQ59163711 ScholiaQ59163711MaRDI QIDQ3562884

Eike Kiltz, Victor Shoup, Tibor Jager, Kristiyan Haralambiev

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)

Related Items (10)

Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More ⋮ Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys ⋮ Memory lower bounds of reductions revisited ⋮ Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions ⋮ Practical chosen ciphertext secure encryption from factoring ⋮ Strongly secure authenticated key exchange from factoring, codes, and lattices ⋮ Key Encapsulation Mechanisms from Extractable Hash Proof Systems, Revisited ⋮ Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman ⋮ Toward Compact Public Key Encryption Based on CDH Assumption via Extended Twin DH Assumption ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties

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