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_10zbMATH Open1274.94057OpenAlexW2096043087WikidataQ59163699 ScholiaQ59163699MaRDI QIDQ3408192FDOQ3408192

Authors: Ronald Cramer, Dennis Hofheinz, Eike Kiltz 

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

Recommendations

• A CCA2-secure multi-decrypter encryption scheme without random oracles
• Efficient CCA-Secure Public-Key Encryption Schemes from RSA-Related Assumptions
• On CCA-Secure Somewhat Homomorphic Encryption
• A generic construction of CCA-secure deterministic encryption
• Efficient fully CCA-secure predicate encryptions from pair encodings
• Achievable \textsf{CCA2} relaxation for homomorphic encryption
• Improving the efficiency of re-randomizable and replayable CCA secure public key encryption
• Structure preserving CCA secure encryption and applications
• Concise multi-challenge CCA-secure encryption and signatures with almost tight security
• CCA-secure predicate encryption from pair encoding in prime order groups: generic and efficient

zbMATH Keywords

public-key encryptionchosen-ciphertext security

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Probabilistic encryption
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Title not available (Why is that?)
• Advances in Cryptology - EUROCRYPT 2004
• Chosen‐Ciphertext Security from Identity‐Based Encryption
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Nonmalleable Cryptography
• Theory of Cryptography
• Title not available (Why is that?)
• Secure Hybrid Encryption from Weakened Key Encapsulation
• Practical Chosen Ciphertext Secure Encryption from Factoring
• Advances in Cryptology – CRYPTO 2004
• Title not available (Why is that?)
• Lossy trapdoor functions and their applications
• Pseudorandom Functions and Factoring
• The Twin Diffie-Hellman Problem and Applications
• The Group of Signed Quadratic Residues and Applications
• Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
• A New Randomness Extraction Paradigm for Hybrid Encryption
• Chosen-Ciphertext Security via Correlated Products
• In search of mathematical primitives for deriving universal projective hash families

Cited In (6)

• Simulation-sound arguments for LWE and applications to KDM-CCA2 security
• CCA-security from adaptive all-but-one lossy trapdoor functions
• Toward an easy-to-understand structure for achieving chosen ciphertext security from the decisional Diffie-Hellman assumption
• Secure integration of asymmetric and symmetric encryption schemes
• Practical chosen ciphertext secure encryption from factoring
• Naor-Yung paradigm with shared randomness and applications

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

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