{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T11:45:36Z","timestamp":1699357536801},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,3,28]],"date-time":"2020-03-28T00:00:00Z","timestamp":1585353600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,28]],"date-time":"2020-03-28T00:00:00Z","timestamp":1585353600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s11786-020-00462-4","type":"journal-article","created":{"date-parts":[[2020,3,28]],"date-time":"2020-03-28T12:02:39Z","timestamp":1585396959000},"page":"641-656","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient and Secure Delegation of Exponentiation in General Groups to a Single Malicious Server"],"prefix":"10.1007","volume":"14","author":[{"given":"Giovanni","family":"Di Crescenzo","sequence":"first","affiliation":[]},{"given":"Matluba","family":"Khodjaeva","sequence":"additional","affiliation":[]},{"given":"Delaram","family":"Kahrobaei","sequence":"additional","affiliation":[]},{"given":"Vladimir","family":"Shpilrain","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,28]]},"reference":[{"issue":"1","key":"462_CR1","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1006\/inco.1995.1125","volume":"121","author":"L Adleman","year":"1995","unstructured":"Adleman, L., Huang, M., Kompella, K.: Efficient checkers for number-theoretic computations. Inf. Comput. 121(1), 93\u2013102 (1995)","journal-title":"Inf. Comput."},{"key":"462_CR2","unstructured":"Anshel, I., Atkins, D., Goldfeld, D., Gunnels, P. E.: Post Quantum Group theoretic Cryptography, in https:\/\/www.securerf.com\/wp-content\/uploads\/2017\/01\/SecureRF-GTDH-Quantum-Resistant-12-16.pdf, vol. 10, pp. 1\u201311 (2016)"},{"issue":"6","key":"462_CR3","first-page":"215","volume":"54","author":"M Atallah","year":"2001","unstructured":"Atallah, M., Pantazopoulos, K.N., Rice, J., Spafford, E.: Secure outsourcing of scientific computations. Adv. Comput. 54(6), 215\u2013272 (2001)","journal-title":"Adv. Comput."},{"key":"462_CR4","doi-asserted-by":"crossref","unstructured":"Atallah, M., Frikken, K.: Securely outsourcing linear algebra computations. In: Proceedings of 5th ACM ASIACCS, pp. 48\u201359, ACM (2010)","DOI":"10.1145\/1755688.1755695"},{"key":"462_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Garay, J., Rabin, T.: Fast batch verification for modular exponentiation and digital signatures. In: Proceedings of EUROCRYPT 1998, LNCS 1403, pp. 236\u2013250. Springer (1998)","DOI":"10.1007\/BFb0054130"},{"key":"462_CR6","doi-asserted-by":"crossref","unstructured":"Benjamin, D., Atallah, M.: Private and cheating-free outsourcing of algebraic computations. In: Proceedings of 6th PST, pp. 240\u2013245. IEEE Computer Society (2008)","DOI":"10.1109\/PST.2008.12"},{"issue":"1","key":"462_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/200836.200880","volume":"42","author":"M Blum","year":"1995","unstructured":"Blum, M., Kannan, S.: Designing programs that check their work. J. ACM 42(1), 269\u2013291 (1995)","journal-title":"J. ACM"},{"issue":"3","key":"462_CR8","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0022-0000(93)90044-W","volume":"47","author":"M Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing\/correcting with applications to numerical problems. J. Comput. Syst. Sci. 47(3), 549\u2013595 (1993)","journal-title":"J. Comput. Syst. Sci."},{"key":"462_CR9","doi-asserted-by":"crossref","unstructured":"Boyko, V., Peinado, M., Venkatesan, R.: Speeding up discrete log and factoring based schemes via precomputations. In: Proceedings of EUROCRYPT 1998, LNCS 1403, pp. 221\u2013235. Springer (1998)","DOI":"10.1007\/BFb0054129"},{"key":"462_CR10","doi-asserted-by":"crossref","unstructured":"Canard, S., Devigne, J., Sanders, O.: Delegating a pairing can be both secure and efficient. In: Proceedings of ACNS 2014, LNCS 8479, pp. 549\u2013565. Springer (2014)","DOI":"10.1007\/978-3-319-07536-5_32"},{"key":"462_CR11","doi-asserted-by":"crossref","unstructured":"Cavallo, B., Di Crescenzo, G., Kahrobaei, D., Shpilrain, V.: Efficient and secure delegation of group exponentiation to a single server. In: Proceeedings of RFIDSec 2015, LNCS 9440, pp 156\u2013173. Springer (2015)","DOI":"10.1007\/978-3-319-24837-0_10"},{"key":"462_CR12","doi-asserted-by":"crossref","unstructured":"Chen, X., Li , J., Ma ,J., Tang, Q., Lou, W.: New algorithms for secure outsourcing of modular exponentiations. In: Proceedings of ESORICS 2012, LNCS 7459, pp. 541\u2013556. Springer (2012)","DOI":"10.1007\/978-3-642-33167-1_31"},{"key":"462_CR13","doi-asserted-by":"crossref","unstructured":"Chevalier, C., Laguillaumie, F., Vergnaud, D.: Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions. In: Proceedings of ESORICS 2016, LNCS 9878, pp. 261\u2013278. Springer (2016)","DOI":"10.1007\/978-3-319-45744-4_13"},{"key":"462_CR14","doi-asserted-by":"crossref","unstructured":"Chevallier-Mames, B., Coron, J., McCullagh, N., Naccache, D., Scott, M.: Secure delegation of elliptic-curve pairing. In: Proceedings of CARDIS 2010, LNCS 6035, pp. 24\u201335. Springer (2010)","DOI":"10.1007\/978-3-642-12510-2_3"},{"key":"462_CR15","doi-asserted-by":"crossref","unstructured":"Chung, K., Kalai, Y. Vadhan, S.: Improved delegation of computation using fully homomorphic encryption. In: Proceedings of CRYPTO 2010, LNCS 6223, pp. 483\u2013501. Springer (2010)","DOI":"10.1007\/978-3-642-14623-7_26"},{"key":"462_CR16","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Khodjaeva, M., Kahrobaei, D., Shpilrain, V.: Computing multiple exponentiations in discrete log and rsa groups: from batch verification to batch delegation. In: Proceedings of 3rd IEEE SPC Workshop (IEEE CNS), pp. 531\u2013539, IEEE (2017)","DOI":"10.1109\/CNS.2017.8228702"},{"key":"462_CR17","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Khodjaeva, M., Kahrobaei, D., Shpilrain, V.: Practical and secure outsourcing of discrete log group exponentiation to a single malicious server. In: Proceedings of 9th ACM Cloud Computing Security Workshop (ACM CCS), pp. 17\u201328, ACM (2017)","DOI":"10.1145\/3140649.3140657"},{"key":"462_CR18","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Khodjaeva, M., Kahrobaei, D., Shpilrain, V.: Secure delegation to a single malicious server: exponentiation in RSA-type groups. In: Proceedings of 5th IEEE SPC Workshop (IEEE CNS), pp. 1\u20139, IEEE (2019)","DOI":"10.1109\/CNS.2019.8802691"},{"key":"462_CR19","doi-asserted-by":"crossref","unstructured":"Dijk, M., Clarke, D. , Gassend, B., Suh, G., Devadas, S.: Speeding Up Exponentiation using an Untrusted Computational Resource, in Designs, Codes and Cryptography. vol. 39(2), pp. 253\u2013273. Springer (2006)","DOI":"10.1007\/s10623-005-3710-8"},{"key":"462_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2016.11.005","volume":"90","author":"Y Ding","year":"2017","unstructured":"Ding, Y., Xu, Z., Ye, J., Choo, K.: Secure outsourcing of modular exponentiations under single untrusted programme model. J. Comput. Syst. Sci. 90, 1\u201313 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"462_CR21","doi-asserted-by":"crossref","unstructured":"Fiore, D., Gennaro, R.: Publicly verifiable delegation of large polynomials and matrix computations, with applications. In: Proceedings of 19th ACM CCS, pp. 501\u2013512, ACM (2012)","DOI":"10.1145\/2382196.2382250"},{"key":"462_CR22","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In: Proceedings of CRYPTO 2010, LNCS 6223, pp. 465\u2013482. Springer (2010)","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"462_CR23","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st ACM STOC, pp. 169\u2013178, ACM (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"462_CR24","doi-asserted-by":"crossref","unstructured":"Girault, M., Lefranc, D.: Server-aided verification: theory and practice. In: Proceedings of ASIACRYPT 2005, LNCS 3788, pp. 605\u2013623. Springer (2005)","DOI":"10.1007\/11593447_33"},{"key":"462_CR25","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proceedings of 19th ACM STOC, pp. 218\u2013229, ACM (1987)","DOI":"10.1145\/28395.28420"},{"issue":"2","key":"462_CR26","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1515\/gcc-2016-0013","volume":"8","author":"J Gryak","year":"2016","unstructured":"Gryak, J., Kahrobaei, D.: The status of polycyclic group-based cryptography: a survey and open problems. Groups Complex. Cryptol. 8(2), 171\u2013186 (2016)","journal-title":"Groups Complex. Cryptol."},{"key":"462_CR27","doi-asserted-by":"crossref","unstructured":"Hart, D., Kim, D., Micheli, G., Pascual-Perez, G., Petit, C., Quek, Y.: A practical cryptanalysis of WalnutDSA. In: IACR International Workshop on Public Key Cryptography, pp. 381\u2013406. Springer (2018)","DOI":"10.1007\/978-3-319-76578-5_13"},{"key":"462_CR28","doi-asserted-by":"crossref","unstructured":"Hohenberger, S., Lysyanskaya, A.: How to securely outsource cryptographic computations. In: Proceedings of TCC 2005, LNCS 3378, pp. 264\u2013282. Springer (2005)","DOI":"10.1007\/978-3-540-30576-7_15"},{"key":"462_CR29","doi-asserted-by":"crossref","unstructured":"Horan, K., Kahrobaei, D.: The hidden subgroup problem and post-quantum group-based cryptography. In: Proceedings of ICMS 2018, LNCS 10931, pp. 218\u2013226, Springer (2018)","DOI":"10.1007\/978-3-319-96418-8_26"},{"key":"462_CR30","doi-asserted-by":"crossref","unstructured":"Jakobsson, M., Wetzel, S.: Secure server-aided signature generation. In: Proceedings of PKC 2001, LNCS 1992, pp. 383\u2013401. Springer (2001)","DOI":"10.1007\/3-540-44586-2_28"},{"key":"462_CR31","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, 787\u2013796 (2013)","journal-title":"Clust. Comput."},{"key":"462_CR32","doi-asserted-by":"crossref","unstructured":"Matsumoto, T., Kato, K., Imai, H.: Speeding up computation with insecure auxiliary devices, In: Proceedings of CRYPTO 1988, LNCS 403, pp. 497\u2013506. Springer (1988)","DOI":"10.1007\/0-387-34799-2_35"},{"key":"462_CR33","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q., Shparlinski, I.E., Stern, J.: Distribution of modular sums and the security of the server aided exponentiation. In: Cryptography and Computational Number Theory , Progress in Computer Science and Applied Logic, vol. 20, pp. 331\u2013342, Springer (2001)","DOI":"10.1007\/978-3-0348-8295-8_24"},{"key":"462_CR34","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th IEEE FOCS, pp. 124\u2013134. IEEE (1994)"},{"key":"462_CR35","doi-asserted-by":"crossref","unstructured":"Wang, Y., Wu, Q., Wong, D., Qin, B., Chow, S., Liu, Z., Tao, X.: Securely outsourcing exponentiations with single untrusted program for cloud storage. In: Proceedings of ESORICS 2014, LNCS 8712, pp. 326\u2013343. Springer (2014)","DOI":"10.1007\/978-3-319-11203-9_19"},{"issue":"4","key":"462_CR36","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/3241037","volume":"62","author":"P Wallden","year":"2019","unstructured":"Wallden, P., Kashefi, E.: Cyber security in the quantum era. Commun. ACM 62(4), 120 (2019)","journal-title":"Commun. ACM"},{"key":"462_CR37","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proceedings of 23rd IEEE FOCS, pp. 160\u2013168. IEEE (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"462_CR38","doi-asserted-by":"crossref","unstructured":"Ye, J., Chen, X., Ma, J.: An improved algorithm for secure outsourcing of modular exponentiations. In: Proceedings of 29th IEEE AINA Workshops, pp. 73\u201376. IEEE (2015)","DOI":"10.1109\/WAINA.2015.34"},{"key":"462_CR39","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Kahrobaei, D., Khodjaeva, M., Shpilrain V.: Efficient and Secure Delegation to a Single Malicious Server: Exponentiation over Non-Abelian Groups. In: Proceedings of ICMS 2018, LNCS 10931, pp. 137\u2013146. Springer (2018)","DOI":"10.1007\/978-3-319-96418-8_17"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-020-00462-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-020-00462-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-020-00462-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,28]],"date-time":"2021-03-28T00:37:14Z","timestamp":1616891834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-020-00462-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,28]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["462"],"URL":"https:\/\/doi.org\/10.1007\/s11786-020-00462-4","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,28]]},"assertion":[{"value":"1 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}