Chosen-Ciphertext Security via Correlated Products
From MaRDI portal
Publication:3611780
DOI10.1007/978-3-642-00457-5_25zbMath1213.94130OpenAlexW1590654318MaRDI QIDQ3611780
Publication date: 3 March 2009
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00457-5_25
Related Items (27)
Non-malleable functions and their applications ⋮ Simpler CCA-Secure Public Key Encryption from Lossy Trapdoor Functions ⋮ Receiver Selective Opening Security from Indistinguishability Obfuscation ⋮ Relational Hash: Probabilistic Hash for Verifying Relations, Secure Against Forgery and More ⋮ Regular lossy functions and their applications in leakage-resilient cryptography ⋮ Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model ⋮ A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels ⋮ More constructions of lossy and correlation-secure trapdoor functions ⋮ Secure integration of asymmetric and symmetric encryption schemes ⋮ On derandomizing Yao's weak-to-strong OWF construction ⋮ Leakage-resilient cryptography from puncturable primitives and obfuscation ⋮ CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN ⋮ A black-box construction of non-malleable encryption from semantically secure encryption ⋮ Toward an Easy-to-Understand Structure for Achieving Chosen Ciphertext Security from the Decisional Diffie-Hellman Assumption ⋮ Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions ⋮ CCA security and trapdoor functions via key-dependent-message security ⋮ An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations ⋮ On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model ⋮ CCA-security from adaptive all-but-one lossy trapdoor functions ⋮ General Construction of Chameleon All-But-One Trapdoor Functions ⋮ The magic of ELFs ⋮ Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN ⋮ The Magic of ELFs ⋮ A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems ⋮ Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ A public key cryptosystem and a signature scheme based on discrete logarithms
This page was built for publication: Chosen-Ciphertext Security via Correlated Products
