1. Ananth P., Chandran N., Goyal V., Kanukurthi B., Ostrovsky R.: Achieving privacy in verifiable computation with multiple servers-without FHE and without pre-processing. In: Krawczyk H. (ed.) PKC 2014, vol. 8383, pp. 149–166. LNCSSpringer, Heidelberg (2014).
2. Applebaum B., Ishai Y., Kushilevitz E.: From secrecy to soundness: efficient verification via secure computation. In: Abramsky S., Gavoille C., Kirchner C., Meyer auf der Heide F., Spirakis P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 152–163. Springer, Heidelberg (2010)
3. Babai L.: Trading group theory for randomness. In: STOC 1985, pp. 421–429.
4. Barbosa M., Farshim P.: Delegatable homomorphic encryption with applications to secure outsourcing of computation. In: Dunkelman O. (ed.) CT-RSA 2012, vol. 7178, pp. 296–312. LNCSSpringer, Heidelberg (2012).
5. Beimel A., Ishai Y., Malkin T.G.: Reducing the servers computation in private information retrieval: PIR with preprocessing. In: Bellare M. (ed.) CRYPTO 2000, vol. 1880, pp. 55–73. LNCSSpringer, Heidelberg (2000).