A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks

DOI10.1007/978-3-642-01001-9_20zbMath1239.94038OpenAlexW2169265599MaRDI QIDQ3627444

Nishanth Chandran, Jan Camenisch, Victor Shoup

Publication date: 12 May 2009

Published in: Advances in Cryptology - EUROCRYPT 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-01001-9_20

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (42)

The key-dependent message security of key-alternating Feistel ciphers ⋮ Master-Key KDM-Secure IBE from Pairings ⋮ On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ Signature schemes secure against hard-to-invert leakage ⋮ Tightly secure signatures and public-key encryption ⋮ The KDM-CCA Security of REACT ⋮ Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions ⋮ On black-box extension of a non-interactive zero-knowledge proof system for secret equality ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ CPA-to-CCA transformation for KDM security ⋮ Round-optimal password-based authenticated key exchange ⋮ QANIZK for adversary-dependent languages and their applications ⋮ Extendable threshold ring signatures with enhanced anonymity ⋮ Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions ⋮ Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model ⋮ Strongly Unforgeable Signature Resilient to Polynomially Hard-to-Invert Leakage Under Standard Assumptions ⋮ Generic constructions of master-key KDM secure attribute-based encryption ⋮ Shorter quasi-adaptive NIZK proofs for linear subspaces ⋮ Reproducible circularly secure bit encryption: applications and realizations ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ Constructions Secure Against Receiver Selective Opening and Chosen Ciphertext Attacks ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ KDM security for identity-based encryption: constructions and separations ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ An algebraic framework for Diffie-Hellman assumptions ⋮ Tagged One-Time Signatures: Tight Security and Optimal Tag Size ⋮ Improved Structure Preserving Signatures Under Standard Bilinear Assumptions ⋮ Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts ⋮ Efficient Confirmer Signatures from the “Signature of a Commitment” Paradigm ⋮ Completeness of Single-Bit Projection-KDM Security for Public Key Encryption ⋮ Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model ⋮ Non-interactive Confirmer Signatures ⋮ Key-dependent message security: generic amplification and completeness ⋮ A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks ⋮ Key-Dependent Message Security for Division Function: Discouraging Anonymous Credential Sharing ⋮ Master-key KDM-secure ABE via predicate encoding ⋮ Naor-Yung Paradigm with Shared Randomness and Applications ⋮ Memory Erasability Amplification ⋮ Bounded KDM Security from iO and OWF ⋮ Efficient fully structure-preserving signatures and shrinking commitments ⋮ Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes ⋮ On Symmetric Encryption and Point Obfuscation

Cites Work

This page was built for publication: A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks