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 elementsReceiver-anonymity in rerandomizable RCCA-secure cryptosystems resolvedStructure-Preserving Signatures from Standard Assumptions, RevisitedConstant-size structure-preserving signatures: generic constructions and simple assumptionsSelectively linkable group signatures -- stronger security and preserved verifiabilitySubversion-resilient enhanced privacy IDChosen ciphertext secure keyed-homomorphic public-key cryptosystemsUniversally composable subversion-resilient cryptographyImproved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence ClassesFully homomorphic NIZK and NIWI proofsHardware security without secure hardware: how to decrypt with a password and a serverReconciling non-malleability with homomorphic encryptionAlmost tightly-secure re-randomizable and replayable CCA-secure public key encryptionExtendable threshold ring signatures with enhanced anonymityHow to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving OnesStructure-preserving signatures on equivalence classes and constant-size anonymous credentialsMix-nets from re-randomizable and replayable CCA-secure public-key encryptionTraceable receipt-free encryptionReverse firewalls for oblivious transfer extension and applications to zero-knowledgeIdentity-based encryption for fair anonymity applications: defining, implementing, and applying rerandomizable RCCA-secure IBEZero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomialsPolicy-compliant signaturesImproving the efficiency of re-randomizable and replayable CCA secure public key encryptionChosen Ciphertext Secure Keyed-Homomorphic Public-Key EncryptionTagged One-Time Signatures: Tight Security and Optimal Tag SizeEfficient Completely Context-Hiding Quotable and Linearly Homomorphic SignaturesVerifiable Elections That Scale for FreeStructure-Preserving Chosen-Ciphertext Security with Shorter Verifiable CiphertextsNon-malleable Codes with Split-State RefreshCryptography with UpdatesContinuously non-malleable codes with split-state refreshLinearly-homomorphic signatures and scalable mix-netsLeakage resilience from program obfuscationReverse firewalls for actively secure MPCs




This page was built for publication: Malleable Proof Systems and Applications