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.
- 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 Scholar
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarCross Ref
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- Dan Boneh and David Mandell Freeman. Homomorphic signatures for polynomial functions. In Advances in Cryptology--EUROCRYPT 2011, pages 149--168. Springer, 2011. Google ScholarDigital Library
- Dario Catalano and Dario Fiore. Practical homomorphic macs for arithmetic circuits. In EUROCRYPT, pages 336--352. Springer, 2013.Google ScholarCross Ref
- 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 ScholarCross Ref
- 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 ScholarDigital Library
- Rosario Gennaro and Daniel Wichs. Fully homomorphic message authenticators. In Advances in Cryptology-ASIACRYPT 2013, pages 301--320. Springer, 2013.Google ScholarCross Ref
- 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 ScholarDigital Library
- 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 ScholarCross Ref
- 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 ScholarDigital Library
- 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 ScholarCross Ref
- Charalampos Papamanthou, Elaine Shi, and Roberto Tamassia. Signatures of correct computation. In Theory of Cryptography, pages 222--242. Springer, 2013. Google ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 Scholar
- Yihua Zhang and Marina Blanton. Efficient secure and verifiable outsourcing of matrix multiplications. Cryptology ePrint Archive, Report 2014/133, 2014.Google Scholar
Index Terms
Efficient Techniques for Publicly Verifiable Delegation of Computation
Recommendations
A New Efficient Publicly Verifiable Signcryption Scheme and Its Multiple Recipients Variant
IITA '08: Proceedings of the 2008 Second International Symposium on Intelligent Information Technology Application - Volume 01Signcryption is a novel public key primitive first proposed by Zheng in 1997 to achieve the functionality of both an encryption scheme and a signature scheme simultaneously. It therefore offers the three services: privacy, authenticity and non-...
Attribute-Based Encryption with Publicly Verifiable Outsourced Decryption
Network and System SecurityAbstractAttribute-based encryption (ABE) is a useful cryptographic primitive for access control and fine-grained sharing on encrypted data. However, the main drawback of ABE is that the computational cost grows linearly with the complexity of the access ...
Practical and Efficient Attribute-Based Encryption with Constant-Size Ciphertexts in Outsourced Verifiable Computation
ASIA CCS '16: Proceedings of the 11th ACM on Asia Conference on Computer and Communications SecurityIn cloud computing, computationally weak users are always willing to outsource costly computations to a cloud, and at the same time they need to check the correctness of the result provided by the cloud. Such activities motivate the occurrence of ...
Comments