On the Non-malleability of the Fiat-Shamir Transform
From MaRDI portal
Publication:2876923
DOI10.1007/978-3-642-34931-7_5zbMath1295.94063OpenAlexW159162986MaRDI QIDQ2876923
Markulf Kohlweiss, Daniele Venturi, Giorgia Azzurra Marson, Sebastian Faust
Publication date: 20 August 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/55405394/On_the_Non_malleability.pdf
Related Items (31)
Balancing privacy and accountability in blockchain identity management ⋮ Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes ⋮ A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs ⋮ Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation ⋮ Blind attribute-based encryption and oblivious transfer with fine-grained access control ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ Another look at extraction and randomization of Groth's zk-SNARK ⋮ Subversion-resilient enhanced privacy ID ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model) ⋮ Storing and Retrieving Secrets on a Blockchain ⋮ Witness-succinct universally-composable SNARKs ⋮ Spartan and bulletproofs are simulation-extractable (for free!) ⋮ Privacy-preserving blueprints ⋮ Efficient and universally composable single secret leader election from pairings ⋮ Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs ⋮ A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation ⋮ What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Traceable policy-based signatures and instantiation from lattices ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ Practical dynamic group signatures without knowledge extractors ⋮ Cryptographic reverse firewalls for interactive proof systems ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ Scalable Multi-party Private Set-Intersection ⋮ One-Shot Verifiable Encryption from Lattices ⋮ Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model ⋮ Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings ⋮ Naor-Yung Paradigm with Shared Randomness and Applications ⋮ Fiat–Shamir for Highly Sound Protocols Is Instantiable ⋮ Keyed-fully homomorphic encryption without indistinguishability obfuscation
This page was built for publication: On the Non-malleability of the Fiat-Shamir Transform
