Fiat-Shamir for highly sound protocols is instantiable
From MaRDI portal
(Redirected from Publication:2827720)
Fiat-Shamir for highly sound protocols is instantiable (scientific article; zbMATH DE number 6641755)
Fiat-Shamir for highly sound protocols is instantiable (scientific article; zbMATH DE number 6641755)
Recommendations
Cites work
- A Parallel Repetition Theorem for Any Interactive Argument
- A second look at Fischlin's transformation
- 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
- Black-box non-black-box zero knowledge
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Compact E-Cash
- Efficient concurrent zero-knowledge in the auxiliary string model
- Efficient Non-interactive Proof Systems for Bilinear Groups
- End-to-End Verifiable Elections in the Standard Model
- Fiat-Shamir for highly sound protocols is instantiable
- Financial Cryptography
- From obfuscation to the security of Fiat-Shamir for proofs
- How not to prove yourself: pitfalls of the fiat-shamir heuristic and applications to helios
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 708798 (Why is no real title available?)
- scientific article; zbMATH DE number 1942413 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- scientific article; zbMATH DE number 2086722 (Why is no real title available?)
- Improved OR-composition of sigma-protocols
- Lower bounds for non-black-box zero knowledge
- Magic functions
- On the correlation intractability of obfuscated pseudorandom functions
- On the Non-malleability of the Fiat-Shamir Transform
- On the Power of Secure Two-Party Computation
- Online/offline OR composition of sigma protocols
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Randomness condensers for efficiently samplable, seed-dependent sources
- Replacing a random oracle: full domain hash from indistinguishability obfuscation
- Security arguments for digital signatures and blind signatures
- Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
- Why ``Fiat-Shamir for proofs lacks a proof
Cited in
(16)- Fiat-Shamir for highly sound protocols is instantiable
- From obfuscation to the security of Fiat-Shamir for proofs
- Delayed-input cryptographic protocols
- On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
- Does Fiat-Shamir require a cryptographic hash function?
- On the (In)security of Kilian-based SNARGs
- Non-interactive zero knowledge \textit{proofs} in the random oracle model
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- Concurrent non-malleable commitments (and more) in 3 rounds
- Interactive oracle proofs
- On the (in)security of Fischlin's paradigm
- Fiat-Shamir: from practice to theory
- \(k\)-critical graphs in \(P_5\)-free graphs
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Multi-theorem Fiat-Shamir transform from correlation-intractable hash functions
- Fiat-Shamir security of FRI and related SNARKs
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)
