Constant-round arguments from one-way functions

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
On the complexity of interactive proofs with bounded communication
Bit commitment using pseudorandomness
Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
Minimum disclosure proofs of knowledge
On interactive proofs with a laconic prover
Collision resistant hashing for paranoids: dealing with multiple collisions
Efficient checking of polynomials and proofs and the hardness of approximation problems
Non-interactive batch arguments for NP from standard assumptions
Delegating Computation
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
Universal Arguments and their Applications
The Knowledge Complexity of Interactive Proof Systems
Alternation
Algebraic methods for interactive proof systems
IP = PSPACE
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
A Hierarchy Theorem for Interactive Proofs of Proximity
Locally Computable UOWHF with Linear Shrinkage
How to Delegate Computations: The Power of No-Signaling Proofs
Constant-Round Interactive Proof Systems for AC0[2 and NC1]
Multi-collision resistance: a paradigm for keyless hash functions
Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
Constant-round interactive proofs for delegating computation
Interactive proofs of proximity
Automata, Languages and Programming
Computational Complexity
One Way Hash Functions and DES
Collision-resistance from multi-collision-resistance

This page was built for publication: Constant-round arguments from one-way functions