Toward Compact Public Key Encryption Based on CDH Assumption via Extended Twin DH Assumption

DOI10.1007/978-3-642-24316-5_11zbMath1298.94090OpenAlexW1861839410MaRDI QIDQ3092354

Tomoko Yonemura, Yoshikazu Hanatani, Hirofumi Muratani

Publication date: 16 September 2011

Published in: Provable Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24316-5_11

zbMATH Keywords

public key encryptionCDH assumptionIND-CCA securityKEMextended strong twin DH assumptionextended trapdoor test

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
• Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
• Efficient Chosen-Ciphertext Security via Extractable Hash Proofs
• Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
• The Twin Diffie-Hellman Problem and Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Toward Compact Public Key Encryption Based on CDH Assumption via Extended Twin DH Assumption