{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:53:05Z","timestamp":1757541185913,"version":"3.40.3"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031055775"},{"type":"electronic","value":"9783031055782"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-05578-2_3","type":"book-chapter","created":{"date-parts":[[2022,5,8]],"date-time":"2022-05-08T17:06:22Z","timestamp":1652029582000},"page":"33-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Survey on\u00a0Delegated Computation"],"prefix":"10.1007","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":[[2022,5,6]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Feigenbaum, J., Kilian, J.: On hiding information from an oracle. In: J. Comput. Syst. Sci. 39(1), 21\u201350 (1989)","DOI":"10.1016\/0022-0000(89)90018-4"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Ahmad, H., et al.: Primitives towards verifiable computation: a survey. Front. Comput. Sci. 12(3), 451\u2013478 (2018). https:\/\/doi.org\/10.1007\/s11704-016-6148-4","DOI":"10.1007\/s11704-016-6148-4"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Barreto, P.S.L.M., Costello, C., Misoczki, R., Naehrig, M., Pereira, G.C.C.F., Zanon, G.: Subgroup security in pairing-based cryptography. In: Lauter, K., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LATINCRYPT 2015. LNCS, vol. 9230, pp. 245\u2013265. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22174-8_14","DOI":"10.1007\/978-3-319-22174-8_14"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or,M., Goldwasser, S., Kilian, J., Wigderson, A.: Multi-prover interactive proofs: how to remove intractability assumptions. In: STOC, pp. 113\u2013131 (1988)","DOI":"10.1145\/62212.62223"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Blum, M., Kannan, S.: Designing programs that check their work, In J. ACM 42(1), 269\u2013291 (1995). Also Proc. of ACM STOC 89","DOI":"10.1145\/200836.200880"},{"issue":"4","key":"3_CR6","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput. 13(4), 850\u2013864 (1984)","journal-title":"SIAM J. Comput."},{"key":"3_CR7","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Program result checking against adaptive programs and in cryptographic settings. In: Distributed Computing and Cryptography, pp. 107\u2013118 (1989)"},{"issue":"3","key":"3_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":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Bos, J.W., Costello, C., Naehrig, M.: Exponentiating in pairing groups. In: Lange, T., Lauter, K., Lison\u011bK P. (eds.) SAC 2013. LNCS, vol. 8282. Springer, Cham (2013)","DOI":"10.1007\/978-3-662-43414-7_22"},{"issue":"3","key":"3_CR11","first-page":"449","volume":"19","author":"J Cai","year":"2017","unstructured":"Cai, J., Ren, Y., Jiang, T.: Verifiable outsourcing computation of modular exponentiations with single server. Int. J. Netw. Secur. 19(3), 449\u2013457 (2017)","journal-title":"Int. J. Netw. Secur."},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-319-07536-5_32","volume-title":"Applied Cryptography and Network Security","author":"S Canard","year":"2014","unstructured":"Canard, S., Devigne, J., Sanders, O.: Delegating a pairing can be both secure and efficient. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 549\u2013565. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07536-5_32"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s11786-020-00462-4","volume":"14","author":"G Di Crescenzo","year":"2020","unstructured":"Di Crescenzo, G., Khodjaeva, M., Kahrobaei, D., Shpilrain, V.: Efficient and secure delegation of exponentiation in general groups to a single malicious server. Math. Comput. Sci. 14(3), 641\u2013656 (2020). https:\/\/doi.org\/10.1007\/s11786-020-00462-4","journal-title":"Math. Comput. Sci."},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-642-33167-1_31","volume-title":"Computer Security \u2013 ESORICS 2012","author":"X Chen","year":"2012","unstructured":"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\u2013556. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33167-1_31"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Chevalier, C., Laguillaumie, F., Vergnaud, D.: Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions. In: Proceedings of ESORICS: 261\u2013278, Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-030-58951-6","DOI":"10.1007\/978-3-030-58951-6"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Chevallier-Mames, B., Coron, J.-S., McCullagh, N., Naccache, D., Scott, M.: Secure delegation of elliptic-curve pairing. In: Proceedings of the 9th IFIP WG 8.8\/11.2 International Conference on Smart Card Research and Advanced Application, pp. 24\u201335 (2010). https:\/\/doi.org\/10.1007\/978-3-642-12510-2_3","DOI":"10.1007\/978-3-642-12510-2_3"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R Cramer","year":"2003","unstructured":"Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM J. Comput. 33(1), 167\u2013226 (2003)","journal-title":"SIAM J. Comput."},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Crandall, R., Pomerance, C.: Prime Numbers: A Computational Perspective, 2nd edn., Springer, Cham (2005). https:\/\/doi.org\/10.1007\/0-387-28979-8-2005","DOI":"10.1007\/0-387-28979-8-2005"},{"key":"3_CR19","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 CCSW, pp. 17\u201328 (2017)","DOI":"10.1145\/3140649.3140657"},{"key":"3_CR20","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 the IEEE CNS, pp. 1\u20139 (2019)","DOI":"10.1109\/CNS.2019.8802691"},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1515\/jmc-2019-0036","volume":"14","author":"G Di Crescenzo","year":"2020","unstructured":"Di Crescenzo, G., Khodjaeva, M., Kahrobaei, D., Shpilrain, V.: Delegating a product of group exponentiations with application to signature schemes. In J. Math. Cryptol. 14(1), 438\u2013459 (2020)","journal-title":"In J. Math. Cryptol."},{"issue":"3","key":"3_CR22","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s11786-020-00462-4","volume":"14","author":"G Di Crescenzo","year":"2020","unstructured":"Di Crescenzo, G., Khodjaeva, M., Kahrobaei, D., Shpilrain, V.: Efficient and secure delegation of exponentiation in general groups to a single malicious server. Math. Comput. Sci. 14(3), 641\u2013656 (2020). https:\/\/doi.org\/10.1007\/s11786-020-00462-4","journal-title":"Math. Comput. Sci."},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Di Crescenzo, G., Khodjaeva, M., Kahrobaei, D., Shpilrain, V.: Secure and efficient delegation of elliptic-curve pairing. In: Proceedings of ACNS 2020, LNCS, vol. 12146. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81645-2","DOI":"10.1007\/978-3-030-81645-2"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-030-68487-7_6","volume-title":"Smart Card Research and Advanced Applications","author":"G Di Crescenzo","year":"2021","unstructured":"Di Crescenzo, G., Khodjaeva, M., Kahrobaei, D., Shpilrain, V.: Secure and efficient delegation of\u00a0pairings with online inputs. In: Liardet, P.-Y., Mentens, N. (eds.) CARDIS 2020. LNCS, vol. 12609, pp. 84\u201399. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68487-7_6"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Khodjaeva, M., Shpilrain, V., Kahrobaei, D., Krishnan, R.: Single-server delegation of ring multiplications from quasilinear-time clients. In 14th International Conference on Security of Information and Networks (SIN), pp. 1\u20138 (2021)","DOI":"10.1109\/SIN54109.2021.9699330"},{"issue":"6","key":"3_CR26","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"3_CR27","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10623-005-3710-8","volume":"39","author":"M Dijk","year":"2006","unstructured":"Dijk, M., Clarke, D., Gassend, B., Suh, G., Devadas, S.: Speeding up exponentiation using an untrusted computational resource. Designs Codes Cryptogr. 39(2), 253\u2013273 (2006)","journal-title":"Designs Codes Cryptogr."},{"issue":"4","key":"3_CR28","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T El Gamal","year":"1985","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J.: Encrypting problem instances: or ..., can you take advantage of someone without having to trust him? In: Proceedings of CRYPTO, pp. 477\u2013488 (1985)","DOI":"10.1007\/3-540-39799-X_38"},{"issue":"3","key":"3_CR30","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1137\/070711761","volume":"39","author":"M F\u00fcrer","year":"2009","unstructured":"F\u00fcrer, M.: Faster integer multiplication. SIAM J. Comput. 39(3), 979\u20131005 (2009)","journal-title":"SIAM J. Comput."},{"key":"3_CR31","unstructured":"Galbraith, S.: Mathematics of Public-Key Cryptography, Cambridge Press, Cambridge (2018)"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/11593447_33","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"M Girault","year":"2005","unstructured":"Girault, M., Lefranc, D.: Server-aided verification: theory and practice. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 605\u2013623. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11593447_33"},{"issue":"1","key":"3_CR33","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":"3_CR34","doi-asserted-by":"publisher","unstructured":"Guillevic, A., Vergnaud, D.: Algorithms for outsourcing pairing computation. In Joye M., Moradi, A. (eds.) Smart Card Research and Advanced Applications. CARDIS 2014. LNCS, vol. 8968. Springer, Berlin (2011). https:\/\/doi.org\/10.1007\/978-3-642-27257-8","DOI":"10.1007\/978-3-642-27257-8"},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"Hohenberger, S., Lysyanskaya, A.: How to securely outsource cryptographic computations. In: Proceedings of the TCC, pp. 264\u201382 (2005)","DOI":"10.1007\/978-3-540-30576-7_15"},{"key":"3_CR36","doi-asserted-by":"publisher","unstructured":"Kachisa, E.J., Schaefer, E.F., Scott, M.: Constructing Brezing-Weng pairing friendly elliptic curves using elements in the cyclotomic field. In Galbraith, S.D., Paterson, K.G. (eds.) Pairing-Based Cryptography - Pairing 2008. LNCS, vol. 5209. Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-3-540-85538-5","DOI":"10.1007\/978-3-540-85538-5"},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Algorithmic Number Theory","author":"A Joux","year":"2000","unstructured":"Joux, A.: A one round protocol for tripartite Diffie\u2013Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 385\u2013393. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722028_23"},{"issue":"1","key":"3_CR38","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1145\/58562.214082","volume":"36","author":"M Kaminski","year":"1989","unstructured":"Kaminski, M.: A note on probabilistically verifying integer and polynomial products. J. ACM 36(1), 142\u2013149 (1989)","journal-title":"J. ACM"},{"key":"3_CR39","unstructured":"Kang, B.G., Lee, M.S., Park, M.S.: Efficient delegation of pairing computation. In: IACR Cryptology ePrint Archive, n. 259 (2005)"},{"key":"3_CR40","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of many-digital numbers by automatic computers. In: Proceedings of the USSR Academy of Sciences, pp. 145: 293\u2013294. Translation in Physics-Doklady, 7, pp. 595\u2013596 (1963)"},{"key":"3_CR41","unstructured":"Karatsuba, A.A.: The complexity of computations. In: Proceedings of the Steklov Institute of Mathematics, pp. 211: 169\u2013183. Translation from Trudy Mat. Inst. Steklova, vol. 211, pp. 186\u2013202 (1995)"},{"issue":"4","key":"3_CR42","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. Cluster Comput. 16(4), 787\u2013796 (2013). https:\/\/doi.org\/10.1007\/s10586-013-0252-0","journal-title":"Cluster Comput."},{"key":"3_CR43","doi-asserted-by":"publisher","first-page":"11","DOI":"10.6028\/jres.120.002","volume":"120","author":"D Moody","year":"2015","unstructured":"Moody, D., Peralta, R., Perlner, R., Regenscheid, A., Roginsky, A., Chen, L.: Report on pairing-based cryptography. J. Res. Natl. Inst. Stand. Technol. 120, 11\u201327 (2015)","journal-title":"J. Res. Natl. Inst. Stand. Technol."},{"key":"3_CR44","doi-asserted-by":"crossref","unstructured":"Matsumoto, T., Hideki Imai, K.-K.: Speeding up secret computations with insecure auxiliary devices. In: Proceedings of CRYPTO, pp. 497\u2013506 (1988)","DOI":"10.1007\/0-387-34799-2_35"},{"key":"3_CR45","unstructured":"Menezes, A., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Location Boca Raton (1996)"},{"key":"3_CR46","doi-asserted-by":"crossref","unstructured":"Pedersen, R., Uzunkol, O.: Secure delegation of isogeny computations and cryptographic applications. In: Proceedings of the ACM CCSW, pp. 29\u201342 (2019)","DOI":"10.1145\/3338466.3358913"},{"issue":"2","key":"3_CR47","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1504\/IJSN.2020.106832","volume":"15","author":"Y Ping","year":"2020","unstructured":"Ping, Y., Guo, X., Wang, B., Zhou, J.: Secure outsourcing of modular inverses and scalar multiplications on elliptic curves. Int. J. Secur. Netw. 15(2), 101\u2013110 (2020)","journal-title":"Int. J. Secur. Netw."},{"key":"3_CR48","unstructured":"Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: Symposium on Cryptography and Information Security (SCIS) (2000)"},{"key":"3_CR49","unstructured":"Scott, M.: Unbalancing pairing-based key exchange protocols. In: IACR Cryptology ePrint Archive, n. 688 (2013)"},{"key":"3_CR50","unstructured":"Scott, M.: A note on group membership tests for $$\\mathbb{G}_1$$, $$\\mathbb{G}_2$$ and $$\\mathbb{G}_T$$ on BLS pairing-friendly curves. In: IACR Cryptology ePrint Archive, n. 1130 (2021)"},{"key":"3_CR51","doi-asserted-by":"crossref","unstructured":"Shan, Z., Ren, K., Blanton, M., Wang, C.: Practical secure computation outsourcing: a survey. ACM Comput. Surv. 51(2), 31:1\u201331:40 (2018)","DOI":"10.1145\/3158363"},{"key":"3_CR52","doi-asserted-by":"crossref","unstructured":"Uzunkol, O., Rangasamy, J., Kuppusamy, L.: Hide the modulus: a secure non-interactive fully verifiable delegation scheme for modular exponentiations via CRT. In: ISC, pp. 250\u2013267 (2018)","DOI":"10.1007\/978-3-319-99136-8_14"},{"issue":"1","key":"3_CR53","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F Vercauteren","year":"2010","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Trans. Inf. Theory 56(1), 455\u2013461 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-319-11203-9_19","volume-title":"Computer Security - ESORICS 2014","author":"Y 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: Kuty\u0142owski, M., Vaidya, J. (eds.) ESORICS 2014. LNCS, vol. 8712, pp. 326\u2013343. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11203-9_19"},{"issue":"6","key":"3_CR55","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1145\/268999.269003","volume":"44","author":"H Wasserman","year":"2019","unstructured":"Wasserman, H., Blum, M.: Software reliability via run-time result-checking. J. ACM 44(6), 826\u2013849 (2019)","journal-title":"J. ACM"},{"key":"3_CR56","unstructured":"Yao, A.: A lower bound to palindrome recognition by probabilistic turing machines. In Tech. Rep. STAN-CS-77-647 (1977)"},{"issue":"3","key":"3_CR57","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s11036-017-0872-3","volume":"22","author":"X Yu","year":"2017","unstructured":"Yu, X., Yan, Z., Vasilakos, A.V.: A survey of verifiable computation. Mob. Netw. Appl. 22(3), 438\u2013453 (2017). https:\/\/doi.org\/10.1007\/s11036-017-0872-3","journal-title":"Mob. Netw. Appl."},{"key":"3_CR58","doi-asserted-by":"crossref","unstructured":"Zhao, L., Zhang, M., Shen, H., Zhang, Y., Shen, J.: Privacy-preserving outsourcing schemes of modular exponentiations using single untrusted cloud server. KSII Trans. Internet Inf. Syst. 11 (2) (2017)","DOI":"10.3837\/tiis.2017.02.011"},{"key":"3_CR59","doi-asserted-by":"crossref","unstructured":"Zhou, K., Ren, J.: Secure outsourcing of scalar multiplication on elliptic curves. In: ICC, pp. 1\u20135 (2016)","DOI":"10.1109\/ICC.2016.7511325"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-05578-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,8]],"date-time":"2022-05-08T17:06:53Z","timestamp":1652029613000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-05578-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031055775","9783031055782"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-05578-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tampa, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.usf.edu\/arts-sciences\/conferences\/dlt2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}