Fiat-Shamir for highly sound protocols is instantiable

DOI10.1016/j.tcs.2018.05.001zbMath1408.94953OpenAlexW2807180547WikidataQ129710962 ScholiaQ129710962MaRDI QIDQ1637340

Publication date: 8 June 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.05.001

zbMATH Keywords

standard model signature schemes indistinguishability obfuscation non-interactive zero knowledge Fiat-Shamir transform

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Fiat–Shamir for Highly Sound Protocols Is Instantiable

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Hybrid commitments and their applications to zero-knowledge proof systems
Efficient signature generation by smart cards
Security arguments for digital signatures and blind signatures
From obfuscation to the security of Fiat-Shamir for proofs
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
Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
End-to-End Verifiable Elections in the Standard Model
An Efficient Parallel Repetition Theorem
The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
Foundations of Cryptography
Financial Cryptography
Why “Fiat-Shamir for Proofs” Lacks a Proof
Signature Schemes Secure against Hard-to-Invert Leakage
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
Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence
Compact E-Cash
On the (im)possibility of obfuscating programs
Leakage-Resilient Signatures with Graceful Degradation
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
Automata, Languages and Programming
Online/Offline OR Composition of Sigma Protocols
On Extractability Obfuscation
Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles

This page was built for publication: Fiat-Shamir for highly sound protocols is instantiable