{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:16Z","timestamp":1740122356775,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:00:00Z","timestamp":1555372800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:00:00Z","timestamp":1555372800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"The \u201cStrategic Priority Research Program\u201d of the Chinese Academy of Sciences","award":["XDA06010701"],"award-info":[{"award-number":["XDA06010701"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61402471","61472414"],"award-info":[{"award-number":["61402471","61472414"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61170280"],"award-info":[{"award-number":["61170280"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"IIE\u2019s Cryptography Research Project"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10586-019-02930-4","type":"journal-article","created":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T05:03:46Z","timestamp":1555391026000},"page":"43-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Verifiable outsourcing computation for modular exponentiation from shareable functions"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9967-8545","authenticated-orcid":false,"given":"Muhua","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,16]]},"reference":[{"key":"2930_CR1","doi-asserted-by":"crossref","unstructured":"Hohenberger, S., Lysyanskaya, A.: How to securely outsource cryptographic computations. In: Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, 10\u201312 Feb 2005. Proceedings, pp. 264\u2013282 (2005)","DOI":"10.1007\/978-3-540-30576-7_15"},{"key":"2930_CR2","doi-asserted-by":"crossref","unstructured":"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\u201312 Sept 2012. Proceedings, pp. 541\u2013556 (2012)","DOI":"10.1007\/978-3-642-33167-1_31"},{"issue":"9","key":"2930_CR3","doi-asserted-by":"publisher","first-page":"2386","DOI":"10.1109\/TPDS.2013.180","volume":"25","author":"X Chen","year":"2014","unstructured":"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\u20132396 (2014)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"2930_CR4","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-319-11203-9_19","volume-title":"Computer Security - ESORICS 2014","author":"Yujue Wang","year":"2014","unstructured":"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\u201311 Sept 2014. Proceedings, Part I, pp. 326\u2013343 (2014)"},{"key":"2930_CR5","doi-asserted-by":"crossref","unstructured":"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\u201330 Sept 2016. Proceedings, Part I, pp. 261\u2013278 (2016)","DOI":"10.1007\/978-3-319-45744-4_13"},{"issue":"5","key":"2930_CR6","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10207-015-0308-7","volume":"15","author":"MS Kiraz","year":"2016","unstructured":"Kiraz, M.S., Uzunkol, O.: Efficient and verifiable algorithms for secure outsourcing of cryptographic computations. Int. J. Inf. Sec. 15(5), 519\u2013537 (2016)","journal-title":"Int. J. Inf. Sec."},{"issue":"4","key":"2930_CR7","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/s10586-013-0252-0","volume":"16","author":"X Ma","year":"2013","unstructured":"Ma, X., Li, J., Zhang, F.: Outsourcing computation of modular exponentiations in cloud computing. Clust. Comput. 16(4), 787\u2013796 (2013)","journal-title":"Clust. Comput."},{"key":"2930_CR8","unstructured":"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\u00e9al, pp. 522\u2013533 (1994)"},{"key":"2930_CR9","doi-asserted-by":"crossref","unstructured":"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\u201321 Oct 2011, pp. 445\u2013454 (2011)","DOI":"10.1145\/2046707.2046759"},{"issue":"1","key":"2930_CR10","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"2930_CR11","unstructured":"Babai, L.: Trading group theory for randomness. In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 6\u20138 May 1985, Providence, pp. 421\u2013429 (1985)"},{"key":"2930_CR12","doi-asserted-by":"crossref","unstructured":"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\u20138 May 1991, New Orleans, pp. 21\u201331 (1991)","DOI":"10.1145\/103418.103428"},{"key":"2930_CR13","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Improved efficient arguments (preliminary version). In: Advances in Cryptology-CRYPTO \u201995, 15th Annual International Cryptology Conference, Santa Barbara, 27\u201331 Aug 1995. Proceedings, pp. 311\u2013324 (1995)","DOI":"10.1007\/3-540-44750-4_25"},{"key":"2930_CR14","unstructured":"Micali, S.: CS proofs (extended abstracts). In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, 20\u201322 Nov 1994, pp. 436\u2013453 (1994)"},{"key":"2930_CR15","doi-asserted-by":"crossref","unstructured":"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\u201320 May 2008, pp. 113\u2013122 (2008)","DOI":"10.1145\/1374376.1374396"},{"key":"2930_CR16","doi-asserted-by":"crossref","unstructured":"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\u201319 Aug 2010. Proceedings, pp. 465\u2013482 (2010)","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"2930_CR17","doi-asserted-by":"crossref","unstructured":"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\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"2930_CR18","doi-asserted-by":"crossref","unstructured":"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\u201319 Aug 2010. Proceedings, pp. 483\u2013501 (2010)","DOI":"10.1007\/978-3-642-14623-7_26"},{"key":"2930_CR19","unstructured":"Barbosa, M., Farshim, P.: Delegatable homomorphic encryption with applications to secure outsourcing of computation. In: Topics in Cryptology-CT-RSA 2012-The Cryptographers\u2019 Track at the RSA Conference 2012, San Francisco, Feb. 27\u2013March 2, 2012. Proceedings, pp. 296\u2013312 (2012)"},{"key":"2930_CR20","doi-asserted-by":"crossref","unstructured":"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\u201321 March 2012. Proceedings, pp. 422\u2013439 (2012)","DOI":"10.1007\/978-3-642-28914-9_24"},{"key":"2930_CR21","doi-asserted-by":"crossref","unstructured":"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\u201913, Palo Alto, 1\u20134 June 2013. pp. 555\u2013564 (2013)","DOI":"10.1145\/2488608.2488678"},{"key":"2930_CR22","doi-asserted-by":"crossref","unstructured":"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\u201318 Aug 2011. Proceedings, pp. 111\u2013131 (2011)","DOI":"10.1007\/978-3-642-22792-9_7"},{"key":"2930_CR23","doi-asserted-by":"crossref","unstructured":"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\u201912, Raleigh, 16\u201318 Oct 2012. pp. 501\u2013512 (2012)","DOI":"10.1145\/2382196.2382250"},{"key":"2930_CR24","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-36594-2_13","volume-title":"Theory of Cryptography","author":"Charalampos Papamanthou","year":"2013","unstructured":"Papamanthou, C., Shi, E., Tamassia, R.: Signatures of correct computation. In: TCC. pp. 222\u2013242 (2013)"},{"key":"2930_CR25","doi-asserted-by":"crossref","unstructured":"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\u20137 Nov 2014. pp. 844\u2013855 (2014)","DOI":"10.1145\/2660267.2660366"},{"key":"2930_CR26","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-319-16745-9_4","volume-title":"Information Security and Cryptology","author":"James Alderman","year":"2015","unstructured":"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\u201315 Dec 2014. Revised Selected Papers, pp. 51\u201371 (2014)"},{"key":"2930_CR27","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-642-36594-2_28","volume-title":"Theory of Cryptography","author":"Seung Geol Choi","year":"2013","unstructured":"Choi, S.G., Katz, J., Kumaresan, R., Cid, C.: Multi-client non-interactive verifiable computation. In: TCC. pp. 499\u2013518 (2013)"},{"issue":"8","key":"2930_CR28","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1109\/TIFS.2013.2271848","volume":"8","author":"J Lai","year":"2013","unstructured":"Lai, J., Deng, R.H., Guan, C., Weng, J.: Attribute-based encryption with verifiable outsourced decryption. IEEE Trans. Inf. Forensics Secur. 8(8), 1343\u20131354 (2013)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"3","key":"2930_CR29","doi-asserted-by":"publisher","first-page":"2141","DOI":"10.1016\/j.jpdc.2013.11.007","volume":"74","author":"F Chen","year":"2014","unstructured":"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\u20132151 (2014)","journal-title":"J. Parallel Distrib. Comput."},{"key":"2930_CR30","first-page":"142","volume":"2015","author":"SD Gordon","year":"2015","unstructured":"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)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"7","key":"2930_CR31","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1109\/TIFS.2015.2410137","volume":"10","author":"B Qin","year":"2015","unstructured":"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\u20131393 (2015)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"2930_CR32","first-page":"24","volume-title":"Lecture Notes in Computer Science","author":"Beno\u00eet Chevallier-Mames","year":"2010","unstructured":"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\u201316 April 2010. Proceedings, pp. 24\u201335 (2010)"},{"key":"2930_CR33","doi-asserted-by":"crossref","unstructured":"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\u201331 Oct 2007. Proceedings, pp. 74\u201390 (2007)","DOI":"10.1007\/978-3-540-75651-4_6"},{"key":"2930_CR34","doi-asserted-by":"crossref","unstructured":"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\u201313 June 2014. Proceedings, pp. 549\u2013565 (2014)","DOI":"10.1007\/978-3-319-07536-5_32"},{"key":"2930_CR35","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-16763-3_12","volume-title":"Smart Card Research and Advanced Applications","author":"Aurore Guillevic","year":"2015","unstructured":"Guillevic, A., Vergnaud, D.: Algorithms for outsourcing pairing computation. In: Smart Card Research and Advanced Applications-13th International Conference, CARDIS 2014, Paris, 5\u20137 Nov 2014. Revised Selected Papers, pp. 193\u2013211 (2014)"},{"key":"2930_CR36","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.tcs.2014.09.038","volume":"562","author":"X Chen","year":"2015","unstructured":"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\u2013121 (2015)","journal-title":"Theor. Comput. Sci."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-019-02930-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-019-02930-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-019-02930-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T01:23:08Z","timestamp":1663291388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-019-02930-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,16]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["2930"],"URL":"https:\/\/doi.org\/10.1007\/s10586-019-02930-4","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2019,4,16]]},"assertion":[{"value":"6 June 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}