Fiat–Shamir for Highly Sound Protocols Is Instantiable
From MaRDI portal
Publication:2827720
DOI10.1007/978-3-319-44618-9_11zbMath1416.94055OpenAlexW2509136145MaRDI QIDQ2827720
Arno Mittelbach, Daniele Venturi
Publication date: 21 October 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-44618-9_11
standard modelsignature schemesindistinguishability obfuscationnon-interactive zero knowledgeFiat-Shamir transform
Related Items
Interactive Oracle Proofs ⋮ Delayed-input cryptographic protocols ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Security arguments for digital signatures and blind signatures
- Fiat-Shamir for highly sound protocols is instantiable
- From obfuscation to the security of Fiat-Shamir for proofs
- Lower bounds for non-black-box zero knowledge
- On the Correlation Intractability of Obfuscated Pseudorandom Functions
- A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles
- Improved OR-Composition of Sigma-Protocols
- On the Power of Secure Two-Party Computation
- On the Non-malleability of the Fiat-Shamir Transform
- Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources
- End-to-End Verifiable Elections in the Standard Model
- Magic Functions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Financial Cryptography
- Why “Fiat-Shamir for Proofs” Lacks a Proof
- How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
- A Second Look at Fischlin’s Transformation
- A Parallel Repetition Theorem for Any Interactive Argument
- How to use indistinguishability obfuscation
- Black-box non-black-box zero knowledge
- An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
- Compact E-Cash
- Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Online/Offline OR Composition of Sigma Protocols
- Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
