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

DOI10.1007/978-3-031-68403-6_1MaRDI QIDQ6660291

Noga Amit, Guy N. Rothblum

Publication date: 10 January 2025

zbMATH Keywords

delegationone-way functionsbatch verificationinteractive arguments

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of interactive proofs with bounded communication
• Minimum disclosure proofs of knowledge
• On interactive proofs with a laconic prover
• Collision resistant hashing for paranoids: dealing with multiple collisions
• Batch verification and proofs of proximity with polylog overhead
• The Knowledge Complexity of Interactive Proof Systems
• Algebraic methods for interactive proof systems
• A Hierarchy Theorem for Interactive Proofs of Proximity
• How to Delegate Computations: The Power of No-Signaling Proofs
• A Parallel Repetition Theorem for Any Interactive Argument
• Multi-collision resistance: a paradigm for keyless hash functions
• Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence
• Constant-round interactive proofs for delegating computation
• Computational Complexity
• One Way Hash Functions and DES
• Collision-resistance from multi-collision-resistance
• Constant-round arguments from one-way functions

This page was built for publication: Constant-round arguments for batch-verification and bounded-space computations from one-way functions