Verifiable Computing for Specific Applications

Abstract

Beyond the families of schemes we have seen so far, there exist verifiable computing schemes for specific functions, which we present here. More precisely, “From Secrecy to Soundness: Efficient Verification via Secure Computation” by Applebaum et al. allows the computation of arithmetic branching programs, “Signatures of Correct Computation” by Papamanthou et al. allows to compute multivariate polynomials of fixed degree and derivations of multivariate polynomials, “Efficient Techniques for Publicly Verifiable Delegation of Computation” by Elkhiyaoui et al. allows the verification of matrix vector multiplications and univariate polynomials, “Efficient Computation Outsourcing for Inverting a Class of Homomorphic Functions” by Zhang et al. provides verification for the inversion of a class of functions, “Secure Delegation of Elliptic-Curve Pairing” by Chevallier-Mames et al. allows to verifiably compute cryptographic bilinear maps, “Efficiently Verifiable Computation on Encrypted Data” by Fiore et al. presents a way to verify univariate polynomial evaluations over encrypted data, “TrueSet: Nearly Practical Verifiable Set Computations” by Kosba et al. allows to verify set operations, “Verifiable Delegation of Computation over Large Datasets” by Benabbas et al. addresses verifiable computing schemes for multivariate polynomials of fixed degree, and “Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations” by Sun et al. provides a batch verifiable computation scheme for multiple functions evaluated on a fixed input.