Constant-round arguments from one-way functions

DOI10.1145/3564246.3585244MaRDI QIDQ6499319zbMATH OpenFDO

Authors Noga Amit, Guy N. Rothblum

Publication date 8 May 2024

Full work available at URL https://doi.org/10.1145/3564246.3585244

zbMATH Keywords

delegationdoubly-efficient proof systemsinteractive argumentsone-way functions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A hierarchy theorem for interactive proofs of proximity
• Algebraic methods for interactive proof systems
• Alternation
• Automata, Languages and Programming
• Bit commitment using pseudorandomness
• Collision resistant hashing for paranoids: dealing with multiple collisions
• Collision-resistance from multi-collision-resistance
• Computational Complexity
• Constant-Round Interactive Proof Systems for AC0[2] and NC1
• Constant-round interactive proofs for delegating computation
• Delegating computation: interactive proofs for muggles
• Efficient checking of polynomials and proofs and the hardness of approximation problems
• Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
• How to Delegate Computations: The Power of No-Signaling Proofs
• scientific article; zbMATH DE number 4195165 (Why is no real title available?)
• scientific article; zbMATH DE number 176510 (Why is no real title available?)
• scientific article; zbMATH DE number 1303133 (Why is no real title available?)
• scientific article; zbMATH DE number 1088254 (Why is no real title available?)
• scientific article; zbMATH DE number 7250162 (Why is no real title available?)
• scientific article; zbMATH DE number 4185024 (Why is no real title available?)
• Interactive proofs of proximity: delegating computation in sublinear time
• IP = PSPACE
• Locally computable UOWHF with linear shrinkage
• Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
• Minimum disclosure proofs of knowledge
• Multi-collision resistance: a paradigm for keyless hash functions
• Non-interactive batch arguments for NP from standard assumptions
• On interactive proofs with a laconic prover
• On the complexity of interactive proofs with bounded communication
• One Way Hash Functions and DES
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
• The Knowledge Complexity of Interactive Proof Systems
• Universal Arguments and their Applications

Cited in

(1)

• Constant-round arguments for batch-verification and bounded-space computations from one-way functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499319)