Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
From MaRDI portal
Publication:5738790
DOI10.1007/978-3-662-54365-8_11zbMath1404.94090OpenAlexW2589967831MaRDI QIDQ5738790
No author found.
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01621022/file/SP-CCA-PKC_full-version.pdf
chosen-ciphertext securityRCCA securitystructure-preserving encryptionpublic ciphertext verifiability
Related Items (9)
Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved ⋮ Hardware security without secure hardware: how to decrypt with a password and a server ⋮ Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption ⋮ Mix-nets from re-randomizable and replayable CCA-secure public-key encryption ⋮ Identity-based encryption for fair anonymity applications: defining, implementing, and applying rerandomizable RCCA-secure IBE ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ Improving the efficiency of re-randomizable and replayable CCA secure public key encryption ⋮ Transferable e-cash: a cleaner model and the first practical instantiation ⋮ Structure-preserving public-key encryption with leakage-resilient CCA security
Cites Work
- Unnamed Item
- Unnamed Item
- Composable and Modular Anonymous Credentials: Definitions and Practical Constructions
- Attribute-Based Signatures for Circuits from Bilinear Map
- Targeted malleability
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
- Breaking ‘128-bit Secure’ Supersingular Binary Curves
- Non-interactive CCA-Secure Threshold Cryptosystems with Adaptive Security: New Framework and Constructions
- Malleable Proof Systems and Applications
- Group to Group Commitments Do Not Shrink
- Efficient Structure-Preserving Signature Scheme from Standard Assumptions
- A New Hash-and-Sign Approach and Structure-Preserving Signatures from DLIN
- Oblivious Transfer with Hidden Access Control from Attribute-Based Encryption
- Group Signatures with Almost-for-Free Revocation
- Tightly Secure Signatures and Public-Key Encryption
- Generalizing Efficient Multiparty Computation
- Fully Structure-Preserving Signatures and Shrinking Commitments
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
- Structure-Preserving Signatures from Standard Assumptions, Revisited
- Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
- Homomorphic Encryption with CCA Security
- Structure-Preserving Signatures and Commitments to Group Elements
- Universally Composable Adaptive Oblivious Transfer
- Rerandomizable RCCA Encryption
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Group Encryption: Non-interactive Realization in the Standard Model
- Securing threshold cryptosystems against chosen ciphertext attack
- Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
- Group Signatures with Message-Dependent Opening
- Chosen Ciphertext Secure Keyed-Homomorphic Public-Key Encryption
- Tagged One-Time Signatures: Tight Security and Optimal Tag Size
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Group Signatures with Message-Dependent Opening in the Standard Model
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
- Advances in Cryptology - CRYPTO 2003
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- On the Impossibility of Structure-Preserving Deterministic Primitives
- Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2006
- Theory of Cryptography
This page was built for publication: Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
