CPA-to-CCA transformation for KDM security
From MaRDI portal
Publication:2175934
DOI10.1007/978-3-030-36033-7_5zbMath1455.94173OpenAlexW2989758142MaRDI QIDQ2175934
Takahiro Matsuda, Fuyuki Kitagawa
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36033-7_5
public-key encryptionchosen ciphertext securitydesignated-verifier non-interactive zero-knowledge argumentkey-dependent message security
Related Items (8)
Master-Key KDM-Secure IBE from Pairings ⋮ Cryptographic primitives with hinting property ⋮ Universal amplification of KDM security: from 1-key circular to multi-key KDM ⋮ Circular security is complete for KDM security ⋮ Cryptographic group actions and applications ⋮ CCA security and trapdoor functions via key-dependent-message security ⋮ Master-key KDM-secure ABE via predicate encoding ⋮ Chosen ciphertext security from injective trapdoor functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Anonymous IBE, leakage resilience and circular security from new assumptions
- A framework for achieving KDM-CCA secure public-key encryption
- New constructions of identity-based and key-dependent message secure encryption schemes
- Key dependent message security and receiver selective opening security for identity-based encryption
- Homomorphic secret sharing from lattices without FHE
- New constructions of reusable designated-verifier NIZKs
- Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
- Completeness of Single-Bit Projection-KDM Security for Public Key Encryption
- Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN
- Identity-Based Encryption with Master Key-Dependent Message Security and Leakage-Resilience
- Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security
- Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification
- Key-Dependent Message Security: Generic Amplification and Completeness
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Reproducible Circularly-Secure Bit Encryption: Applications and Realizations
- Bounded Key-Dependent Message Security
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Towards a Separation of Semantic and CCA Security for Public Key Encryption
- Circular-Secure Encryption from Decision Diffie-Hellman
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Garbling XOR Gates “For Free” in the Standard Model
- Fully homomorphic encryption using ideal lattices
- Fiat-Shamir: from practice to theory
- Constructing and Understanding Chosen Ciphertext Security via Puncturable Key Encapsulation Mechanisms
- Advances in Cryptology - EUROCRYPT 2004
- Soundness of Formal Encryption in the Presence of Key-Cycles
- CCA security and trapdoor functions via key-dependent-message security
This page was built for publication: CPA-to-CCA transformation for KDM security
