Time-Optimal Interactive Proofs for Circuit Evaluation

Recently, researchers have been working toward the development of practical general-purpose protocols for verifiable computation. These protocols enable a computationally weak verifier to offload computations to a powerful but untrusted prover, while providing the verifier with a guarantee that the prover performed the computations correctly. Despite substantial progress, existing implementatio…

Paper

Similar papers

© 2026 NYSGPT2525 LLC