Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions
From MaRDI portal
Publication:5919680
DOI10.1016/j.tcs.2019.08.016zbMath1448.94205OpenAlexW3022739703WikidataQ127356117 ScholiaQ127356117MaRDI QIDQ5919680
Goichiro Hanaoka, Keisuke Tanaka, Fuyuki Kitagawa, Takahiro Matsuda, Keisuke Hara
Publication date: 18 October 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.08.016
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
- Tightly SIM-SO-CCA secure public key encryption from standard assumptions
- Simulation-based selective opening security for receivers under chosen-ciphertext attacks
- Selective Opening Security for Receivers
- Standard Security Does Not Imply Security against Selective-Opening
- Simulation-Based Selective Opening CCA Security for PKE from Key Encapsulation Mechanisms
- Constructions Secure Against Receiver Selective Opening and Chosen Ciphertext Attacks
- Receiver Selective Opening Security from Indistinguishability Obfuscation
- Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts
- Lossy trapdoor functions and their applications
- Perfect Non-interactive Zero Knowledge for NP
- Chosen-Ciphertext Security via Correlated Products
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- How to use indistinguishability obfuscation
- Tightly-Secure Authenticated Key Exchange
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Theory of Cryptography
- Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions
This page was built for publication: Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions
