Advertisement

Verifiable Outsourced Computation with Full Delegation

  • Qiang Wang
  • Fucai Zhou
  • Su Peng
  • Zifeng Xu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11337)

Abstract

With the development of cloud computing, verifiable computation (VC) has attracted considerable attentions due to its importance. However, the existing VC schemes suffer from two substantial shortcomings that limit their usefulness: (i) they have to invest expensive computational tasks in the preprocessing stage, which has exceeded the available computation capacity of the client, and (ii) they do not support frequent updates, so that each update needs to perform the computation from scratch. To resolve these problems, we propose a novel primitive called verifiable outsourced computation with full delegation (FD-VC), which greatly reduces the computation cost of the client by delegating the preprocessing to the cloud. During this phase, the cloud cannot obtain any knowledge of the verification key. To the best of our knowledge, it is the first VC scheme not only supporting full delegation but also supporting dynamic update. The highlight of our scheme is that verification and update cost are constant and independent of the degree of the polynomial. Our scheme is provably correct and secure based on bilinear pairing and the hardness assumption of Bilinear Diffie-Hellman Exponent problem, and our analyses show that our scheme is very practical and suitable for the real world applications.

Keywords

Verifiable computing Full delegation Dynamic update Bilinear pairing 

Notes

Acknowledgement

We thank the anonymous reviewers and Bao Li for their fruitful suggestions. This work was supported by the Natural Science Foundation of China under Grant Nos. 61772127, 61703088 and 61472184, the National Science and Technology Major Project under Grant No. 2013ZX03002006, the Liaoning Province Science and Technology Projects under Grant No. 2013217004, the Fundamental Research Funds for the Central Universities under Grant No. N151704002.

References

  1. 1.
    Chen, X., Li, J., Ma, J., Tang, Q., Lou, W.: New algorithms for secure outsourcing of modular exponentiations. In: Foresti, S., Yung, M., Martinelli, F. (eds.) ESORICS 2012. LNCS, vol. 7459, pp. 541–556. Springer, Heidelberg (2012).  https://doi.org/10.1007/978-3-642-33167-1_31CrossRefGoogle Scholar
  2. 2.
    BBC-NEW: The interview: a guide to the cyber attack on Hollywood. http://www.bbc.co.uk/news/entertainment-arts-30512032
  3. 3.
    Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. Cryptology ePrint Archive, Report 2009/547 (2009). http://eprint.iacr.org/
  4. 4.
    Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. J. ACM 45(1), 70–122 (1998)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp. 723-732 (1992)Google Scholar
  6. 6.
    Micali, S.: Computationally sound proofs. SIAM J. Comput. 30(4), 1253–1298 (2000). Preliminary version appeared in FOCS 1994MathSciNetCrossRefGoogle Scholar
  7. 7.
    Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for Muggles. In: Proceedings of the ACM Symposium on the Theory of Computing (2008)Google Scholar
  8. 8.
    Chung, K.-M., Kalai, Y., Vadhan, S.: Improved delegation of computation using fully homomorphic encryption. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 483–501. Springer, Heidelberg (2010).  https://doi.org/10.1007/978-3-642-14623-7_26CrossRefGoogle Scholar
  9. 9.
    Parno, B., Gentry, C., Howell, J., Raykova, M.: Pinocchio: nearly practical verifiable computation. In: Proceedings of the 34th IEEE Symposium on Security and Privacy, S&P 2013, pp. 238–252 (2013)Google Scholar
  10. 10.
    Costello, C., et al.: Geppetto: versatile verifiable computation. In: Proceedings of the 36th IEEE Symposium on Security and Privacy, S&P 2015, pp. 253–270 (2015)Google Scholar
  11. 11.
    Kalai, Y.T., Raz, R.: Probabilistically checkable arguments. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 143–159. Springer, Heidelberg (2009).  https://doi.org/10.1007/978-3-642-03356-8_9CrossRefGoogle Scholar
  12. 12.
    Fiore, D., Gennaro, R.: Publicly verifiable delegation of large polynomials and matrix computations, with applications. ePrint 2012/281 (2012)Google Scholar
  13. 13.
    Benabbas, S., Gennaro, R., Vahlis, Y.: Verifiable delegation of computation over large datasets. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 111–131. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-22792-9_7CrossRefGoogle Scholar
  14. 14.
    Parno, B., Raykova, M., Vaikuntanathan, V.: How to delegate and verify in public: verifiable computation from attribute-based encryption. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 422–439. Springer, Heidelberg (2012).  https://doi.org/10.1007/978-3-642-28914-9_24CrossRefGoogle Scholar
  15. 15.
    Fiore, D., Gennaro, R., Pastro, V.: Efficiently verifiable computation on encrypted data. In: Proceedings of the 21st ACM Conference on Computer and Communications Security, Scottsdale, AZ, USA, pp. 844–855 (2014)Google Scholar
  16. 16.
    Ma, H., Zhang, R., Wan, Z., Lu, Y., Lin, S.: Verifiable and exculpable outsourced attribute-based encryption for access control in cloud computing. IEEE Trans. Dependable Secur. Comput. 14(6), 679–692 (2015)CrossRefGoogle Scholar
  17. 17.
    Sun, W., et al.: Verifiable privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking. IEEE Trans. Parallel Distrib. Syst. 25(11), 3025–3035 (2014)CrossRefGoogle Scholar
  18. 18.
    Wang, Q., Zhou, F., Chen, C., Xuan, P., Wu, Q.: Secure collaborative publicly verifiable computation. IEEE Access 5(1), 2479–2488 (2017)CrossRefGoogle Scholar
  19. 19.
    Papamanthou, C., Shi, E., Tamassia, R.: Signatures of correct computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 222–242. Springer, Heidelberg (2013).  https://doi.org/10.1007/978-3-642-36594-2_13CrossRefzbMATHGoogle Scholar
  20. 20.
    Zhang, L.F., Safavi-Naini, R.: Batch verifiable computation of outsourced functions. J. Des. Codes Crypt. 77, 563–585 (2015)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001).  https://doi.org/10.1007/3-540-44647-8_13CrossRefGoogle Scholar
  22. 22.
    Boneh, D., Boyen, X., Goh, E.-J.: Hierarchical identity based encryption with constant size ciphertext. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 440–456. Springer, Heidelberg (2005).  https://doi.org/10.1007/11426639_26CrossRefGoogle Scholar
  23. 23.
    Ding, Y., Xu, Z., Ye, J., Choo, K.: Secure outsourcing of modular exponentiations under single untrusted programme model. J. Comput. Syst. Sci. 90, 1–17 (2016)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Software CollegeNortheastern UniversityShenyangChina
  2. 2.School of Computer Science and EngineeringNortheastern UniversityShenyangChina

Personalised recommendations