Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
From MaRDI portal
Publication:3102176
DOI10.1007/978-3-642-25385-0_4zbMath1227.94048OpenAlexW2102090397MaRDI QIDQ3102176
Benoît Libert, Brett Hemenway, Damien Vergnaud, Rafail Ostrovsky
Publication date: 2 December 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25385-0_4
commitmenthomomorphic encryptionchosen-ciphertext securitypublic key encryptionlossy encryptionselective opening
Related Items (32)
SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions ⋮ Targeted lossy functions and applications ⋮ Receiver Selective Opening Security from Indistinguishability Obfuscation ⋮ Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions ⋮ Standard Security Does Not Imply Indistinguishability Under Selective Opening ⋮ Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts ⋮ Regular lossy functions and their applications in leakage-resilient cryptography ⋮ Fully leakage-resilient signatures ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ Simulation-based selective opening security for receivers under chosen-ciphertext attacks ⋮ Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ Compact and tightly selective-opening secure public-key encryption schemes ⋮ Simulation-based bi-selective opening security for public key encryption ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Possibility and impossibility results for receiver selective opening secure PKE in the multi-challenge setting ⋮ Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers ⋮ Receiver selective opening security for identity-based encryption in the multi-challenge setting ⋮ Constructions Secure Against Receiver Selective Opening and Chosen Ciphertext Attacks ⋮ Lossy Key Encapsulation Mechanism and Its Applications ⋮ Towards Tightly Secure Deterministic Public Key Encryption ⋮ The polynomial approximate common divisor problem and its application to the fully homomorphic encryption ⋮ Sender-Equivocable Encryption Schemes Secure against Chosen-Ciphertext Attacks Revisited ⋮ Practical public key encryption with selective opening security for receivers ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ Non-malleability Under Selective Opening Attacks: Implication and Separation ⋮ CCA-security from adaptive all-but-one lossy trapdoor functions ⋮ Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited ⋮ Deterministic Public-Key Encryption Under Continual Leakage ⋮ Backdoors in Pseudorandom Number Generators: Possibility and Impossibility Results ⋮ IBE with tight security against selective opening and chosen-ciphertext attacks
This page was built for publication: Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
