Toward an Easy-to-Understand Structure for Achieving Chosen Ciphertext Security from the Decisional Diffie-Hellman Assumption

DOI10.1007/978-3-642-16280-0_16zbMath1286.94089OpenAlexW1487749346MaRDI QIDQ4933224

Noboru Kunihiro, Shota Yamada, Goichiro Hanaoka

Publication date: 12 October 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-16280-0_16

zbMATH Keywords

public key encryptionCCA securitythe decisional Diffie-Hellman assumption

Mathematics Subject Classification ID

Cryptography (94A60)

Uses Software

• KEM-DEM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
• Lossy trapdoor functions and their applications
• Adaptive Trapdoor Functions and Chosen-Ciphertext Security
• Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
• Chosen-Ciphertext Security via Correlated Products
• Secure Hybrid Encryption from Weakened Key Encapsulation
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Bit Encryption Is Complete
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM
• The Twin Diffie-Hellman Problem and Applications

This page was built for publication: Toward an Easy-to-Understand Structure for Achieving Chosen Ciphertext Security from the Decisional Diffie-Hellman Assumption