skip to main content
10.1145/2897845.2897910acmconferencesArticle/Chapter ViewAbstractPublication Pagesasia-ccsConference Proceedingsconference-collections
research-article

Efficient Techniques for Publicly Verifiable Delegation of Computation

Published:30 May 2016Publication History

ABSTRACT

With the advent of cloud computing, individuals and companies alike are looking for opportunities to leverage cloud resources not only for storage but also for computation. Nevertheless, the reliance on the cloud to perform computation raises the unavoidable challenge of how to assure the correctness of the delegated computation. In this regard, we introduce two cryptographic protocols for publicly verifiable computation that allow a lightweight client to securely outsource to a cloud server the evaluation of high-degree univariate polynomials and the multiplication of large matrices. Similarly to existing work, our protocols follow the amortized verifiable computation approach. Furthermore, by exploiting the mathematical properties of polynomials and matrices, they are more efficient and give way to public delegatability. Finally, besides their efficiency, our protocols are provably secure under well-studied assumptions.

References

  1. James Alderman, Christian Janson, Carlos Cid, and Jason Crampton. Revocation in publicly verifiable outsourced computation. In Information Security and Cryptology, pages 51--71. Springer, 2014.Google ScholarGoogle Scholar
  2. James Alderman, Christian Janson, Carlos Cid, and Jason Crampton. Access control in publicly verifiable outsourced computation. In Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security, ASIA CCS, volume 15, pages 657--662, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Michael Backes, Dario Fiore, and Raphael M. Reischuk. Verifiable delegation of computation on outsourced data. In Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, pages 863--874. ACM, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer, and Madars Virza. SNARKs for C: Verifying program executions succinctly and in zero knowledge. In Advances in Cryptology--CRYPTO 2013, pages 90--108. Springer, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  5. Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, and Madars Virza. Succinct non-interactive zero knowledge for a Von Neumann architecture. In USENIX Security, pages 781--796, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Siavosh Benabbas, Rosario Gennaro, and Yevgeniy Vahlis. Verifiable delegation of computation over large datasets. In Phillip Rogaway, editor, Advances in Cryptology -- CRYPTO 2011, volume 6841 of Lecture Notes in Computer Science, pages 111--131. Springer Berlin Heidelberg, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Nir Bitansky, Ran Canetti, Alessandro Chiesa, and Eran Tromer. From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pages 326--349. ACM, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Dan Boneh and David Mandell Freeman. Homomorphic signatures for polynomial functions. In Advances in Cryptology--EUROCRYPT 2011, pages 149--168. Springer, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Dario Catalano and Dario Fiore. Practical homomorphic macs for arithmetic circuits. In EUROCRYPT, pages 336--352. Springer, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  10. Dario Catalano, Dario Fiore, and Bogdan Warinschi. Homomorphic signatures with efficient verification for polynomial functions. In Advances in Cryptology--CRYPTO 2014, pages 371--389. Springer, 2014.Google ScholarGoogle ScholarCross RefCross Ref
  11. Dario Fiore and Rosario Gennaro. Publicly verifiable delegation of large polynomials and matrix computations, with applications. In Proceedings of the 2012 ACM Conference on Computer and Communications Security, CCS '12, pages 501--512. ACM, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Rosario Gennaro and Daniel Wichs. Fully homomorphic message authenticators. In Advances in Cryptology-ASIACRYPT 2013, pages 301--320. Springer, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  13. Rosario Gennaro, Craig Gentry, and Bryan Parno. Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In Advances in Cryptology--CRYPTO 2010, pages 465--482. Springer, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Rosario Gennaro, Craig Gentry, Bryan Parno, and Mariana Raykova. Quadratic span programs and succinct NIZKs without PCPs. In EUROCRYPT, volume 7881, pages 626--645. Springer, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  15. Craig Gentry and Daniel Wichs. Separating succinct non-interactive arguments from all falsifiable assumptions. In Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, pages 99--108. ACM, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Aniket Kate, Gregory M. Zaverucha, and Ian Goldberg. Constant-size commitments to polynomials and their applications. In Advances in Cryptology-ASIACRYPT 2010, pages 177--194. Springer, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  17. Charalampos Papamanthou, Elaine Shi, and Roberto Tamassia. Signatures of correct computation. In Theory of Cryptography, pages 222--242. Springer, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Bryan Parno, Mariana Raykova, and Vinod Vaikuntanathan. How to delegate and verify in public: Verifiable computation from attribute-based encryption. In Ronald Cramer, editor, Theory of Cryptography, volume 7194 of Lecture Notes in Computer Science, pages 422--439. Springer Berlin Heidelberg, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Bryan Parno, Jon Howell, Craig Gentry, and Mariana Raykova. Pinocchio: Nearly practical verifiable computation. In IEEE Symposium on Security and Privacy (SP), 2013, pages 238--252. IEEE, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Liang Feng Zhang and Reihaneh Safavi-Naini. Verifiable delegation of computations with storage-verification trade-off. In Mirosław Kutyłowski and Jaideep Vaidya, editors, Computer Security - ESORICS 2014, volume 8712 of Lecture Notes in Computer Science, pages 112--129. Springer International Publishing, 2014.Google ScholarGoogle Scholar
  21. Yihua Zhang and Marina Blanton. Efficient secure and verifiable outsourcing of matrix multiplications. Cryptology ePrint Archive, Report 2014/133, 2014.Google ScholarGoogle Scholar

Index Terms

  1. Efficient Techniques for Publicly Verifiable Delegation of Computation

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        ASIA CCS '16: Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security
        May 2016
        958 pages
        ISBN:9781450342339
        DOI:10.1145/2897845

        Copyright © 2016 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 30 May 2016

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        ASIA CCS '16 Paper Acceptance Rate73of350submissions,21%Overall Acceptance Rate418of2,322submissions,18%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader