Fiat-Shamir for highly sound protocols is instantiable
From MaRDI portal
Publication:2827720
DOI10.1007/978-3-319-44618-9_11zbMATH Open1416.94055OpenAlexW2509136145MaRDI QIDQ2827720FDOQ2827720
Authors: D. 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
Recommendations
standard modelsignature schemesindistinguishability obfuscationnon-interactive zero knowledgeFiat-Shamir transform
Cites Work
- Security arguments for digital signatures and blind signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Lower bounds for non-black-box zero knowledge
- Efficient concurrent zero-knowledge in the auxiliary string model
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
- On the Non-malleability of the Fiat-Shamir Transform
- Compact E-Cash
- Title not available (Why is that?)
- How to use indistinguishability obfuscation
- A Parallel Repetition Theorem for Any Interactive Argument
- Magic Functions
- Title not available (Why is that?)
- A second look at Fischlin's transformation
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- End-to-End Verifiable Elections in the Standard Model
- How not to prove yourself: pitfalls of the fiat-shamir heuristic and applications to helios
- Replacing a random oracle: full domain hash from indistinguishability obfuscation
- A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles
- An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
- Improved OR-Composition of Sigma-Protocols
- On the Power of Secure Two-Party Computation
- Black-box non-black-box zero knowledge
- Fiat-Shamir for highly sound protocols is instantiable
- From obfuscation to the security of Fiat-Shamir for proofs
- On the Correlation Intractability of Obfuscated Pseudorandom Functions
- Randomness condensers for efficiently samplable, seed-dependent sources
- Financial Cryptography
- Why ``Fiat-Shamir for proofs lacks a proof
- Online/Offline OR Composition of Sigma Protocols
Cited In (8)
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Delayed-input cryptographic protocols
- Fiat-Shamir for highly sound protocols is instantiable
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds
- On the (in)security of Fischlin's paradigm
- On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
- \(k\)-critical graphs in \(P_5\)-free graphs
- Interactive Oracle Proofs
This page was built for publication: Fiat-Shamir for highly sound protocols is instantiable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827720)
