Malleable proof systems and applications
From MaRDI portal
Recommendations
Cited in
(45)- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
- Linearly-homomorphic signatures and scalable mix-nets
- Reverse firewalls for actively secure MPCs
- Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved
- Selectively linkable group signatures -- stronger security and preserved verifiability
- Subversion-resilient enhanced privacy ID
- Universally composable subversion-resilient cryptography
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Fully homomorphic NIZK and NIWI proofs
- Improving the efficiency of re-randomizable and replayable CCA secure public key encryption
- Leakage resilience from program obfuscation
- Reconciling non-malleability with homomorphic encryption
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Hardware security without secure hardware: how to decrypt with a password and a server
- Policy-compliant signatures
- Structure-preserving signatures and commitments to group elements
- How to obtain fully structure-preserving (automorphic) signatures from structure-preserving ones
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Structure-preserving signatures from standard assumptions, revisited
- Succinct malleable NIZKs and an application to compact shuffles
- Chosen ciphertext secure keyed-homomorphic public-key encryption
- Tagged one-time signatures: tight security and optimal tag size
- Efficient completely context-hiding quotable and linearly homomorphic signatures
- Verifiable elections that scale for free
- Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
- Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
- Non-malleable Codes with Split-State Refresh
- Cryptography with updates
- Continuously non-malleable codes with split-state refresh
- Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption
- Extendable threshold ring signatures with enhanced anonymity
- Mix-nets from re-randomizable and replayable CCA-secure public-key encryption
- Traceable receipt-free encryption
- Reverse firewalls for oblivious transfer extension and applications to zero-knowledge
- Identity-based encryption for fair anonymity applications: defining, implementing, and applying rerandomizable RCCA-secure IBE
- Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
- Equivalence Between Non-malleability Against Replayable CCA and Other RCCA-Security Notions
- Threshold structure-preserving signatures
- Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
- Practical traceable receipt-free encryption
- Malleable SNARKs and their applications
- Leveraging small message spaces for cca1 security in additively homomorphic and bgn-type encryption
- Commit-and-prove system for vectors and applications to threshold signing
- Updatable privacy-preserving blueprints
- Dynamic zk-SNARKs (with applications to sparse zk-SNARKs and IVC)
This page was built for publication: Malleable proof systems and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894414)
