Efficient techniques for publicly verifiable delegation of computation

ASIA CCS 2016 - Proceedings of the 11th ACM Asia Conference on Computer and Communications Security

Volumn , Issue , 2016, Pages 119-128

  Elkhiyaoui, Kaoutar ^a   Önen, Melek ^a   Azraoui, Monir ^a   Molva, Refik ^a  

^a EURECOM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLOUD COMPUTING;

CLOUD SERVERS; CRYPTOGRAPHIC PROTOCOLS; MATHEMATICAL PROPERTIES; PROVABLY SECURE; PUBLICLY VERIFIABLE; UNIVARIATE;

MATRIX ALGEBRA;

EID: 84979681531     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2897845.2897910     Document Type: Conference Paper

References (21)

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.
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.
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.
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.
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.
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.
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.
8. Dan Boneh and David Mandell Freeman. Homomorphic signatures for polynomial functions. In Advances in Cryptology-EUROCRYPT 2011, pages 149-168. Springer, 2011.
9. Dario Catalano and Dario Fiore. Practical homomorphic macs for arithmetic circuits. In EUROCRYPT, pages 336-352. Springer, 2013.
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.
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.
12. Rosario Gennaro and Daniel Wichs. Fully homomorphic message authenticators. In Advances in Cryptology-ASIACRYPT 2013, pages 301-320. Springer, 2013.
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.
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.
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.
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.
17. Charalampos Papamanthou, Elaine Shi, and Roberto Tamassia. Signatures of correct computation. In Theory of Cryptography, pages 222-242. Springer, 2013.
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.
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.
20. Liang Feng Zhang and Reihaneh Safavi-Naini. Verifiable delegation of computations with storage-verification trade-off. In Miroslaw Kutylowski and Jaideep Vaidya, editors, Computer Security - ESORICS 2014, volume 8712 of Lecture Notes in Computer Science, pages 112-129. Springer International Publishing, 2014.
21. Yihua Zhang and Marina Blanton. Efficient secure and verifiable outsourcing of matrix multiplications. Cryptology ePrint Archive, Report 2014/133, 2014.