Part of the SpringerBriefs in Computer Science book series (BRIEFSCOMPUTER)


In this chapter we provide an introduction to our survey. First, we motivate the research field of verifiable computing. Afterwards, we present a roadmap to this book explaining the setting we a concerned with followed by the relevant properties, i.e. the level of security, privacy, and efficiency, the type of verifiability, and the function class provided. Finally, we show the organization of our work.


  1. 1.
    L. Babai, Trading group theory for randomness, in Proceedings of the 17th Annual ACM Symposium on Theory of Computing, Providence, RI, 6–8 May 1985, pp. 421–429Google Scholar
  2. 2.
    D. Fiore, A. Mitrokotsa, L. Nizzardo, E. Pagnin, Multi-key homomorphic authenticators, in Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part II, Hanoi, 4–8 December 2016, pp. 499–530Google Scholar
  3. 3.
    R. Gennaro, C. Gentry, B. Parno, Non-interactive verifiable computing: outsourcing computation to untrusted workers, in Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference, Proceedings, Santa Barbara, CA, 15–19 August 2010, pp. 465–482Google Scholar

Copyright information

© The Author(s) 2017

Authors and Affiliations

  1. 1.Theoretische InformatikTechnische Universität DarmstadtDarmstadtGermany

Personalised recommendations