Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
From MaRDI portal
Recommendations
- Efficient chosen-ciphertext security via extractable hash proofs
- Structure preserving CCA secure encryption and applications
- Structure-preserving certificateless encryption and its application
- Circular chosen-ciphertext security with compact ciphertexts
- Enhanced chosen-ciphertext security and applications
- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
- A practical approach to attaining chosen ciphertext security
- Chosen-ciphertext security without redundancy
- scientific article; zbMATH DE number 1962154
- Chosen Ciphertext Security with Optimal Ciphertext Overhead
Cites work
- A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
- A new hash-and-sign approach and structure-preserving signatures from DLIN
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Attribute-based signatures for circuits from bilinear map
- Breaking `128-bit secure' supersingular binary curves. (Or how to solve discrete logarithms in \({\mathbb F}_{2^{4 \cdot 1223}}\) and \({\mathbb F}_{2^{12 \cdot 367}}\))
- Chosen ciphertext secure keyed-homomorphic public-key encryption
- Composable and modular anonymous credentials: definitions and practical constructions
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient public-key cryptography in the presence of key leakage
- Efficient Structure-Preserving Signature Scheme from Standard Assumptions
- Fully structure-preserving signatures and shrinking commitments
- Generalizing efficient multiparty computation
- Group encryption: non-interactive realization in the standard model
- Group signatures with almost-for-free revocation
- Group signatures with message-dependent opening
- Group signatures with message-dependent opening in the standard model
- Group to group commitments do not shrink
- Homomorphic Encryption with CCA Security
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Malleable proof systems and applications
- Non-interactive CCA-secure threshold cryptosystems with adaptive security: New framework and constructions
- Non-malleability from malleability: simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures
- Oblivious transfer with hidden access control from attribute-based encryption
- On the impossibility of structure-preserving deterministic primitives
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Rerandomizable RCCA Encryption
- Securing threshold cryptosystems against chosen ciphertext attack
- Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Structure-preserving signatures and commitments to group elements
- Structure-preserving signatures from standard assumptions, revisited
- Tagged one-time signatures: tight security and optimal tag size
- Targeted malleability: homomorphic encryption for restricted computations
- Theory of Cryptography
- Theory of Cryptography
- Tightly Secure Signatures and Public-Key Encryption
- Topics in Cryptology – CT-RSA 2006
- Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
- Universally Composable Adaptive Oblivious Transfer
Cited in
(15)- Tight chosen ciphertext attack (CCA)-secure hybrid encryption scheme with full public verifiability
- On the impossibility of structure-preserving deterministic primitives
- Transferable e-cash: a cleaner model and the first practical instantiation
- Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved
- 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
- Structure-preserving public-key encryption with leakage-resilient CCA security
- Hardware security without secure hardware: how to decrypt with a password and a server
- Structure preserving CCA secure encryption and applications
- 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
- Equivalence Between Non-malleability Against Replayable CCA and Other RCCA-Security Notions
- Encryption mechanisms for receipt-free and perfectly private verifiable elections
- On structure-preserving cryptography and lattices
This page was built for publication: Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738790)
