On black-box verifiable outsourcing
From MaRDI portal
Publication:6581787
DOI10.1007/978-3-031-48615-9_6zbMATH Open1544.94212MaRDI QIDQ6581787
Srinivasan Raghuraman, Amit Agarwal, Navid Alamati, Dakshita Khurana, Peter Rindal
Publication date: 1 August 2024
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Locally random reductions: Improvements and applications
- Batch checking with applications to linear functions
- Self-testing/correcting with applications to numerical problems
- Random oracles and non-uniformity
- Non-interactive batch arguments for NP from standard assumptions
- SNARGs for P from sub-exponential DDH and QR
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Improved Delegation of Computation Using Fully Homomorphic Encryption
- From Secrecy to Soundness: Efficient Verification via Secure Computation
- Random Oracles and Auxiliary Input
- Computationally Sound Proofs
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Checking approximate computations over the reals
- How to delegate computations
- Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
This page was built for publication: On black-box verifiable outsourcing
