S. Ames, C. Hazay, Y. Ishai, and M. Venkitasubramaniam, Ligero: Lightweight sublinear arguments without a trusted setup, ACM CCS 2017, pp.2087-2104, 2017.

S. Arora and S. Safra, Probabilistic checking of proofs; A new characterization of NP, 33rd FOCS, pp.2-13, 1992.

D. Boneh and X. Boyen, Short signatures without random oracles and the SDH assumption in bilinear groups, Journal of Cryptology, vol.21, issue.2, pp.149-177, 2008.

C. Baum, J. Bootle, A. Cerulli, J. Pino, V. Groth et al., Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits, CRYPTO 2018, Part II, vol.10992, pp.669-699, 2018.

E. Ben-sasson, A. Chiesa, D. Genkin, E. Tromer, and M. Virza, SNARKs for C: Verifying program executions succinctly and in zero knowledge, CRYPTO 2013, Part II, vol.8043, pp.90-108, 2013.

J. Bootle, A. Cerulli, J. Groth, K. Sune, M. Jakobsen et al., Arya: Nearly linear-time zero-knowledge proofs for correct program execution, ASIACRYPT 2018, Part I, volume 11272 of LNCS, pp.595-626, 2018.

E. Ben-sasson, A. Chiesa, M. Riabzev, N. Spooner, M. Virza et al., Aurora: Transparent succinct arguments for R1CS, EUROCRYPT 2019, Part I, vol.11476, pp.103-128, 2019.

M. Bellare and O. Goldreich, On defining proofs of knowledge, LNCS, vol.92, pp.390-420, 1993.

Z. Brakerski, C. Gentry, and V. Vaikuntanathan, Leveled) fully homomorphic encryption without bootstrapping, pp.309-325, 2012.

A. Buldas and S. Laur, Knowledge-binding commitments with applications in time-stamping, LNCS, vol.4450, pp.150-165, 2007.

Z. Brakerski and V. Vaikuntanathan, Fully homomorphic encryption from ring-LWE and security for key dependent messages, LNCS, vol.6841, pp.505-524, 2011.

M. Campanelli, D. Fiore, and A. Querol, LegoSNARK: Modular design and composition of succinct zero-knowledge proofs, ACM CCS 2019, pp.2075-2092, 2019.

I. Chillotti, N. Gama, M. Georgieva, and M. Izabachène, Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds, ASIACRYPT 2016, Part I, vol.10031, pp.3-33, 2016.
URL : https://hal.archives-ouvertes.fr/cea-01832762

I. Chillotti, N. Gama, M. Georgieva, and M. Izabachène, Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE, Part I, vol.10624, pp.377-408, 2017.
URL : https://hal.archives-ouvertes.fr/cea-01832760

G. Cormode, M. Mitzenmacher, and J. Thaler, Practical verified computation with streaming interactive proofs, pp.90-112, 2012.

I. Damgård, Towards practical public key systems secure against chosen ciphertext attacks, CRYPTO'91, vol.576, pp.445-456, 1992.

L. Ducas and D. Micciancio, FHEW: Bootstrapping homomorphic encryption in less than a second, EUROCRYPT 2015, Part I, volume 9056 of LNCS, pp.617-640, 2015.

T. Elgamal, A public key cryptosystem and a signature scheme based on discrete logarithms, LNCS, vol.84, pp.10-18, 1984.

D. Fiore, R. Gennaro, and V. Pastro, Efficiently verifiable computation on encrypted data, ACM CCS 2014, pp.844-855, 2014.

D. Fiore and A. Nitulescu, On the (in)security of SNARKs in the presence of oracles, TCC 2016-B, Part I, vol.9985, pp.108-138
URL : https://hal.archives-ouvertes.fr/hal-01378013

. Springer, , 2016.

C. Gentry, Fully homomorphic encryption using ideal lattices, 41st ACM STOC, pp.169-178, 2009.

R. Gennaro, C. Gentry, and B. Parno, Non-interactive verifiable computing: Outsourcing computation to untrusted workers, CRYPTO 2010, vol.6223, pp.465-482, 2010.

R. Gennaro, C. Gentry, B. Parno, and M. Raykova, Quadratic span programs and succinct NIZKs without PCPs, LNCS, vol.7881, pp.626-645, 2013.

S. Goldwasser, Y. T. Kalai, R. A. Popa, V. Vaikuntanathan, and N. Zeldovich, How to run turing machines on encrypted data, CRYPTO 2013, Part II, vol.8043, pp.536-553, 2013.

S. Goldwasser, Y. T. Kalai, and G. N. Rothblum, Delegating computation: interactive proofs for muggles, 40th ACM STOC, pp.113-122, 2008.

S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof-systems (extended abstract), 17th ACM STOC, pp.291-304, 1985.

J. Groth, On the size of pairing-based non-interactive arguments, EUROCRYPT 2016, Part II, vol.9666, pp.305-326, 2016.

C. Gentry, A. Sahai, and B. Waters, Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based, CRYPTO 2013, Part I, vol.8042, pp.75-92, 2013.

C. Gentry and D. Wichs, Separating succinct non-interactive arguments from all falsifiable assumptions, 43rd ACM STOC, pp.99-108, 2011.

J. Kilian, A note on efficient zero-knowledge proofs and arguments (extended abstract), 24th ACM STOC, pp.723-732, 1992.

A. Kate, G. M. Zaverucha, and I. Goldberg, Constant-size commitments to polynomials and their applications, ASIACRYPT 2010, vol.6477, pp.177-194, 2010.

M. Maller, S. Bowe, M. Kohlweiss, and S. Meiklejohn, Sonic: Zero-knowledge SNARKs from linear-size universal and updatable structured reference strings, ACM CCS 2019, pp.2111-2128, 2019.

P. Paillier, Public-key cryptosystems based on composite degree residuosity classes, LNCS, vol.99, pp.223-238, 1999.

B. Parno, J. Howell, C. Gentry, and M. Raykova, Pinocchio: Nearly practical verifiable computation, 2013 IEEE Symposium on Security and Privacy, pp.238-252, 2013.

B. Parno, M. Raykova, and V. Vaikuntanathan, How to delegate and verify in public: Verifiable computation from attribute-based encryption, LNCS, vol.7194, pp.422-439, 2012.

D. Pointcheval and J. Stern, Security arguments for digital signatures and blind signatures, Journal of Cryptology, vol.13, issue.3, pp.361-396, 2000.

C. Papamanthou, E. Shi, and R. Tamassia, Signatures of correct computation, LNCS, vol.7785, pp.222-242, 2013.

R. Rivest, L. Adleman, and M. Dertouzos, On data banks and privacy homomorphisms. Foundations of Secure Computation, pp.169-177, 1978.

N. P. Smart and F. Vercauteren, Fully homomorphic encryption with relatively small key and ciphertext sizes, PKC 2010, vol.6056, pp.420-443, 2010.

S. Riad, Y. Wahby, A. J. Ji, J. Blumberg, M. Thaler et al., Full accounting for verifiable outsourcing, ACM CCS 2017, pp.2071-2086, 2017.

S. Riad, I. Wahby, J. Tzialla, M. Thaler, and . Walfish, Doubly-efficient zkSNARKs without trusted setup, 2018 IEEE Symposium on Security and Privacy, pp.926-943, 2018.

T. Xie, J. Zhang, Y. Zhang, C. Papamanthou, and D. Song, Libra: Succinct zero-knowledge proofs with optimal prover computation, CRYPTO 2019, Part III, vol.11694, pp.733-764, 2019.

Y. Zhang, D. Genkin, and J. Katz, Dimitrios Papadopoulos, and Charalampos Papamanthou. vSQL: Verifying arbitrary SQL queries over dynamic outsourced databases, 2017 IEEE Symposium on Security and Privacy, pp.863-880, 2017.