Advertisement

Verifiable outsourcing computation for modular exponentiation from shareable functions

  • Muhua LiuEmail author
  • Ying Wu
  • Rui Xue
  • Rui Zhang
Article
  • 43 Downloads

Abstract

Verifiable computation (VC) enables a computationally weak client to outsource the computation of a function f to a more powerful but untrusted server. The server returns an answer that allows the client to recover the correct result, accompanied by a proof of correctness. The basic requirement of a VC scheme is efficiency, i.e., the time consuming in preparing its input and verifying the server’s proof must be less than the time required to compute the function on its own. In this paper, we propose a novel outsourcing scheme for modular exponentiation from shareable functions, which is secure even in the presence of adaptive adversaries. Compared with previous works, our algorithm is superior in both efficiency and checkability. In order to keep the exponent privacy, our algorithm invokes the less subroutine, which accounts for the largest proportion of the time spent. The client can detect the error with overwhelming probability. We then gave a comparation that demonstrates the efficiency of the proposed outsourcing algorithm and scheme. Finally, we propose a generic scheme for shareable function family, and analyze the concrete security.

Keywords

Modular exponentiation Outsourcing computation Security and privacy Clouding computing 

Notes

Acknowledgements

This work is supported by the “Strategic Priority Research Program” of the Chinese Academy of Sciences, Grants No. XDA06010701, National Natural Science Foundation of China (Nos. 61402471, 61472414, 61170280), and IIE’s Cryptography Research Project.

References

  1. 1.
    Hohenberger, S., Lysyanskaya, A.: How to securely outsource cryptographic computations. In: Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, 10–12 Feb 2005. Proceedings, pp. 264–282 (2005)Google Scholar
  2. 2.
    Chen, X., Li, J., Ma, J., Tang, Q., Lou, W.: New algorithms for secure outsourcing of modular exponentiations. In: Computer Security-ESORICS 2012-17th European Symposium on Research in Computer Security, Pisa, 10–12 Sept 2012. Proceedings, pp. 541–556 (2012)Google Scholar
  3. 3.
    Chen, X., Li, J., Ma, J., Tang, Q., Lou, W.: New algorithms for secure outsourcing of modular exponentiations. IEEE Trans. Parallel Distrib. Syst. 25(9), 2386–2396 (2014)CrossRefGoogle Scholar
  4. 4.
    Wang, Y., Wu, Q., Wong, D.S., Qin, B., Chow, S.S.M., Liu, Z., Tan, X.: Securely outsourcing exponentiations with single untrusted program for cloud storage. In: Computer Security-ESORICS 2014-19th European Symposium on Research in Computer Security, Wroclaw, 7–11 Sept 2014. Proceedings, Part I, pp. 326–343 (2014)Google Scholar
  5. 5.
    Chevalier, C., Laguillaumie, F., Vergnaud, D.: Privately outsourcing exponentiation to a single server: Cryptanalysis and optimal constructions. In: Computer Security-ESORICS 2016-21st European Symposium on Research in Computer Security, Heraklion, 26–30 Sept 2016. Proceedings, Part I, pp. 261–278 (2016)Google Scholar
  6. 6.
    Kiraz, M.S., Uzunkol, O.: Efficient and verifiable algorithms for secure outsourcing of cryptographic computations. Int. J. Inf. Sec. 15(5), 519–537 (2016)CrossRefGoogle Scholar
  7. 7.
    Ma, X., Li, J., Zhang, F.: Outsourcing computation of modular exponentiations in cloud computing. Clust. Comput. 16(4), 787–796 (2013)CrossRefGoogle Scholar
  8. 8.
    Santis, A.D., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, Montréal, pp. 522–533 (1994)Google Scholar
  9. 9.
    Canetti, R., Riva, B., Rothblum, G.N.: Practical delegation of computation using multiple servers. In: Proceedings of the 18th ACM Conference on Computer and Communications Security, CCS 2011, Chicago, 17–21 Oct 2011, pp. 445–454 (2011)Google Scholar
  10. 10.
    Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186–208 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Babai, L.: Trading group theory for randomness. In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 6–8 May 1985, Providence, pp. 421–429 (1985)Google Scholar
  12. 12.
    Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 5–8 May 1991, New Orleans, pp. 21–31 (1991)Google Scholar
  13. 13.
    Kilian, J.: Improved efficient arguments (preliminary version). In: Advances in Cryptology-CRYPTO ’95, 15th Annual International Cryptology Conference, Santa Barbara, 27–31 Aug 1995. Proceedings, pp. 311–324 (1995)Google Scholar
  14. 14.
    Micali, S.: CS proofs (extended abstracts). In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, 20–22 Nov 1994, pp. 436–453 (1994)Google Scholar
  15. 15.
    Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, 17–20 May 2008, pp. 113–122 (2008)Google Scholar
  16. 16.
    Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In: Advances in Cryptology-CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara, 15–19 Aug 2010. Proceedings, pp. 465–482 (2010)Google Scholar
  17. 17.
    Yao, A.C.: Protocols for secure computations (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, 3-5 Nov 1982, pp. 160–164 (1982)Google Scholar
  18. 18.
    Chung, K., Kalai, Y.T., Vadhan, S.P.: Improved delegation of computation using fully homomorphic encryption. In: Advances in Cryptology-CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara 15–19 Aug 2010. Proceedings, pp. 483–501 (2010)Google Scholar
  19. 19.
    Barbosa, M., Farshim, P.: Delegatable homomorphic encryption with applications to secure outsourcing of computation. In: Topics in Cryptology-CT-RSA 2012-The Cryptographers’ Track at the RSA Conference 2012, San Francisco, Feb. 27–March 2, 2012. Proceedings, pp. 296–312 (2012)Google Scholar
  20. 20.
    Parno, B., Raykova, M., Vaikuntanathan, V.: How to delegate and verify in public: Verifiable computation from attribute-based encryption. In: Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Taormina, Sicily, 19–21 March 2012. Proceedings, pp. 422–439 (2012)Google Scholar
  21. 21.
    Goldwasser, S., Kalai, Y.T., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: Reusable garbled circuits and succinct functional encryption. In: Symposium on Theory of Computing Conference, STOC’13, Palo Alto, 1–4 June 2013. pp. 555–564 (2013)Google Scholar
  22. 22.
    Benabbas, S., Gennaro, R., Vahlis, Y.: Verifiable delegation of computation over large datasets. In: Advances in Cryptology-CRYPTO 2011-31st Annual Cryptology Conference, Santa Barbara, 14–18 Aug 2011. Proceedings, pp. 111–131 (2011)Google Scholar
  23. 23.
    Fiore, D., Gennaro, R.: Publicly verifiable delegation of large polynomials and matrix computations, with applications. In: the ACM Conference on Computer and Communications Security, CCS’12, Raleigh, 16–18 Oct 2012. pp. 501–512 (2012)Google Scholar
  24. 24.
    Papamanthou, C., Shi, E., Tamassia, R.: Signatures of correct computation. In: TCC. pp. 222–242 (2013)Google Scholar
  25. 25.
    Fiore, D., Gennaro, R., Pastro, V.: Efficiently verifiable computation on encrypted data. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, Scottsdale, 3–7 Nov 2014. pp. 844–855 (2014)Google Scholar
  26. 26.
    Alderman, J., Janson, C., Cid, C., Crampton, J.: Revocation in publicly verifiable outsourced computation. In: Information Security and Cryptology-10th International Conference, Inscrypt 2014, Beijing, 13–15 Dec 2014. Revised Selected Papers, pp. 51–71 (2014)Google Scholar
  27. 27.
    Choi, S.G., Katz, J., Kumaresan, R., Cid, C.: Multi-client non-interactive verifiable computation. In: TCC. pp. 499–518 (2013)Google Scholar
  28. 28.
    Lai, J., Deng, R.H., Guan, C., Weng, J.: Attribute-based encryption with verifiable outsourced decryption. IEEE Trans. Inf. Forensics Secur. 8(8), 1343–1354 (2013)CrossRefGoogle Scholar
  29. 29.
    Chen, F., Xiang, T., Yang, Y.: Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud. J. Parallel Distrib. Comput. 74(3), 2141–2151 (2014)CrossRefzbMATHGoogle Scholar
  30. 30.
    Gordon, S.D., Katz, J., Liu, F., Shi, E., Zhou, H.: Multi-client verifiable computation with stronger security guarantees. IACR Cryptol. ePrint Arch. 2015, 142 (2015)zbMATHGoogle Scholar
  31. 31.
    Qin, B., Deng, R.H., Liu, S., Ma, S.: Attribute-based encryption with efficient verifiable outsourced decryption. IEEE Trans. Inf. Forensics Secur. 10(7), 1384–1393 (2015)CrossRefGoogle Scholar
  32. 32.
    Chevallier-Mames, B., Coron, J., McCullagh, N., Naccache, D., Scott, M.: Secure delegation of elliptic-curve pairing. In: Smart Card Research and Advanced Application, 9th IFIP WG 8.8/11.2 International Conference, CARDIS 2010, Passau, 14–16 April 2010. Proceedings, pp. 24–35 (2010)Google Scholar
  33. 33.
    Tsang, P.P., Chow, S.S.M., Smith, S.W.: Batch pairing delegation. In: Advances in Information and Computer Security, Second International Workshop on Security, IWSEC 2007, Nara, 29–31 Oct 2007. Proceedings, pp. 74–90 (2007)Google Scholar
  34. 34.
    Canard, S., Devigne, J., Sanders, O.: Delegating a pairing can be both secure and efficient. In: Applied Cryptography and Network Security-12th International Conference, ACNS 2014, Lausanne, 10–13 June 2014. Proceedings, pp. 549–565 (2014)Google Scholar
  35. 35.
    Guillevic, A., Vergnaud, D.: Algorithms for outsourcing pairing computation. In: Smart Card Research and Advanced Applications-13th International Conference, CARDIS 2014, Paris, 5–7 Nov 2014. Revised Selected Papers, pp. 193–211 (2014)Google Scholar
  36. 36.
    Chen, X., Susilo, W., Li, J., Wong, D.S., Ma, J., Tang, S., Tang, Q.: Efficient algorithms for secure outsourcing of bilinear pairings. Theor. Comput. Sci. 562, 112–121 (2015)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.School of Mathematics and StatisticsHenan University of Science and TechnologyLuoyangPeople’s Republic of China
  2. 2.State Key Laboratory of Information SecurityInstitute of Information Engineering, Chinese Academy of SciencesBeijingPeople’s Republic of China
  3. 3.School of Cyber SecurityUniversity of Chinese Academy of SciencesBeijingPeople’s Republic of China

Personalised recommendations