Completeness of Single-Bit Projection-KDM Security for Public Key Encryption
From MaRDI portal
Publication:2790040
DOI10.1007/978-3-319-16715-2_11zbMath1332.94070OpenAlexW264662944MaRDI QIDQ2790040
Takahiro Matsuda, Keisuke Tanaka, Fuyuki Kitagawa, Goichiro Hanaoka
Publication date: 2 March 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-16715-2_11
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Key-dependent message security: generic amplification and completeness
- Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security
- Efficient Key Dependent Message Security Amplification Against Chosen Ciphertext Attacks
- Black-Box Circular-Secure Encryption beyond Affine Functions
- Efficient Circuit-Size Independent Public Key Encryption with KDM Security
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Bounded Key-Dependent Message Security
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Circular-Secure Encryption from Decision Diffie-Hellman
- OAEP Is Secure under Key-Dependent Messages
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Efficient Noninteractive Proof Systems for Bilinear Groups
- Circular Chosen-Ciphertext Security with Compact Ciphertexts
- Bit Encryption Is Complete
- KDM Security in the Hybrid Framework
This page was built for publication: Completeness of Single-Bit Projection-KDM Security for Public Key Encryption