A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems

DOI10.1007/978-3-642-11799-2_10zbMath1274.94057OpenAlexW2096043087WikidataQ59163699 ScholiaQ59163699MaRDI QIDQ3408192

Ronald Cramer, Eike Kiltz, Dennis Hofheinz

Publication date: 24 February 2010

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_10

zbMATH Keywords

public-key encryptionchosen-ciphertext security

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Practical chosen ciphertext secure encryption from factoring ⋮ Secure integration of asymmetric and symmetric encryption schemes ⋮ Toward an Easy-to-Understand Structure for Achieving Chosen Ciphertext Security from the Decisional Diffie-Hellman Assumption ⋮ CCA-security from adaptive all-but-one lossy trapdoor functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• In search of mathematical primitives for deriving universal projective hash families
• Pseudorandom Functions and Factoring
• The Group of Signed Quadratic Residues and Applications
• Lossy trapdoor functions and their applications
• 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
• Practical Chosen Ciphertext Secure Encryption from Factoring
• A New Randomness Extraction Paradigm for Hybrid Encryption
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Nonmalleable Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Chosen‐Ciphertext Security from Identity‐Based Encryption
• The Twin Diffie-Hellman Problem and Applications
• Theory of Cryptography

This page was built for publication: A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems