Non-interactive publicly-verifiable delegation of committed programs

DOI10.1007/978-3-031-31371-4_20OpenAlexW4367666496MaRDI QIDQ6067380

Amit Sahai, Riddhi Ghosal, Brent Waters

Publication date: 16 November 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-31371-4_20

Mathematics Subject Classification ID

Cryptography (94A60) Theory of data (68Pxx)

Cites Work

• On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
• The hunting of the SNARK
• Witness indistinguishability for any single-round argument with applications to access control
• Non-interactive batch arguments for NP from standard assumptions
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Somewhere statistical soundness, post-quantum security, and SNARGs
• Practical verified computation with streaming interactive proofs
• Secure Two-Party Computation with Low Communication
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
• How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
• On the Communication Complexity of Secure Function Evaluation with Long Output
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Delegating Computation
• Delegating RAM Computations
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Improved Delegation of Computation Using Fully Homomorphic Encryption
• Computationally Sound Proofs
• Succinct Non-interactive Arguments via Linear Interactive Proofs
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Non-interactive delegation and batch NP verification from standard computational assumptions
• Constant-Round Interactive Proofs for Delegating Computation
• Fiat-Shamir: from practice to theory
• How to delegate computations publicly
• Multi-collision resistance: a paradigm for keyless hash functions
• Succinct delegation for low-space non-deterministic computation
• How to delegate computations
• Recursive composition and bootstrapping for SNARKS and proof-carrying data
• Delegation for bounded space
• Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)

This page was built for publication: Non-interactive publicly-verifiable delegation of committed programs