Malleable Proof Systems and Applications
From MaRDI portal
Publication:2894414
DOI10.1007/978-3-642-29011-4_18zbMath1297.94057OpenAlexW2157376128MaRDI QIDQ2894414
Anna Lysyanskaya, Sarah Meiklejohn, Markulf Kohlweiss, Melissa Chase
Publication date: 29 June 2012
Published in: Advances in Cryptology – EUROCRYPT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29011-4_18
Related Items (34)
Structure-preserving signatures and commitments to group elements ⋮ Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved ⋮ Structure-Preserving Signatures from Standard Assumptions, Revisited ⋮ Constant-size structure-preserving signatures: generic constructions and simple assumptions ⋮ Selectively linkable group signatures -- stronger security and preserved verifiability ⋮ Subversion-resilient enhanced privacy ID ⋮ Chosen ciphertext secure keyed-homomorphic public-key cryptosystems ⋮ Universally composable subversion-resilient cryptography ⋮ Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ Fully homomorphic NIZK and NIWI proofs ⋮ Hardware security without secure hardware: how to decrypt with a password and a server ⋮ Reconciling non-malleability with homomorphic encryption ⋮ Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption ⋮ Extendable threshold ring signatures with enhanced anonymity ⋮ How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ 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 ⋮ Policy-compliant signatures ⋮ Improving the efficiency of re-randomizable and replayable CCA secure public key encryption ⋮ 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 ⋮ 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 ⋮ Linearly-homomorphic signatures and scalable mix-nets ⋮ Leakage resilience from program obfuscation ⋮ Reverse firewalls for actively secure MPCs
This page was built for publication: Malleable Proof Systems and Applications
