{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:26:07Z","timestamp":1742970367089,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030932053"},{"type":"electronic","value":"9783030932060"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-93206-0_14","type":"book-chapter","created":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T14:04:49Z","timestamp":1639663489000},"page":"223-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem"],"prefix":"10.1007","author":[{"given":"Xiulan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanbin","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengliang","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,17]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: The shortest vector problem in L$${}_{\\text{2}}$$ is NP-hard for randomized reductions (extended abstract). In: Vitter, J.S. (ed.) Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, 23\u201326 May 1998, pp. 10\u201319. ACM (1998). https:\/\/doi.org\/10.1145\/276698.276705","DOI":"10.1145\/276698.276705"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-75187-8_4","volume-title":"Computer Algebra in Scientific Computing","author":"W Backes","year":"2007","unstructured":"Backes, W., Wetzel, S.: An efficient LLL gram using buffered transformations. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2007. LNCS, vol. 4770, pp. 31\u201344. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75187-8_4"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Benjamin, D., Atallah, M.J.: Private and cheating-free outsourcing of algebraic computations. In: Korba, L., Marsh, S., Safavi-Naini, R. (eds.) Sixth Annual Conference on Privacy, Security and Trust, PST 2008, Fredericton, New Brunswick, Canada, 1\u20133 October 2008, pp. 240\u2013245. IEEE Computer Society (2008). https:\/\/doi.org\/10.1109\/PST.2008.12","DOI":"10.1109\/PST.2008.12"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Bi, J., Coron, J., Faug\u00e8re, J., Nguyen, P.Q., Renault, G., Zeitoun, R.: Rounding and chaining LLL: finding faster small roots of univariate polynomial congruences. IACR Cryptol. ePrint Arch. 2014, 437 (2014). http:\/\/eprint.iacr.org\/2014\/437","DOI":"10.1007\/978-3-642-54631-0_11"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Chen, X., Li, J., Ma, J., Tang, Q., Lou, W.: New algorithms for secure outsourcing of modular exponentiations. IEEE Trans. Parallel Distributed Syst. 25(9), 2386\u20132396 (2014). https:\/\/doi.org\/10.1109\/TPDS.2013.180","DOI":"10.1109\/TPDS.2013.180"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics, vol. 138. Springer, Heidelberg (1993). https:\/\/www.worldcat.org\/oclc\/27810276","DOI":"10.1007\/978-3-662-02945-9"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-68339-9_14","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"D Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a small root of a univariate modular equation. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 155\u2013165. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_14"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Fiore, D., Gennaro, R.: Publicly verifiable delegation of large polynomials and matrix computations, with applications. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) The ACM Conference on Computer and Communications Security, CCS 2012, Raleigh, NC, USA, 16\u201318 October 2012, pp. 501\u2013512. ACM (2012). https:\/\/doi.org\/10.1145\/2382196.2382250","DOI":"10.1145\/2382196.2382250"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-14623-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"R Gennaro","year":"2010","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 465\u2013482. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_25"},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Dwork, C. (ed.) Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, 17\u201320 May 2008, pp. 197\u2013206. ACM (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"14_CR11","doi-asserted-by":"publisher","unstructured":"H\u00e5stad, J., Just, B., Lagarias, J.C., Schnorr, C.: Polynomial time algorithms for finding integer relations among real numbers. SIAM J. Comput. 18(5), 859\u2013881 (1989). https:\/\/doi.org\/10.1137\/0218059","DOI":"10.1137\/0218059"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-30576-7_15","volume-title":"Theory of Cryptography","author":"S Hohenberger","year":"2005","unstructured":"Hohenberger, S., Lysyanskaya, A.: How to securely outsource cryptographic computations. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 264\u2013282. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_15"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Hu, C., Alhothaily, A., Alrawais, A., Cheng, X., Sturtivant, C., Liu, H.: A secure and verifiable outsourcing scheme for matrix inverse computation. In: 2017 IEEE Conference on Computer Communications, INFOCOM 2017, Atlanta, GA, USA, 1\u20134 May 2017, pp. 1\u20139. IEEE (2017). https:\/\/doi.org\/10.1109\/INFOCOM.2017.8057199","DOI":"10.1109\/INFOCOM.2017.8057199"},{"key":"14_CR14","unstructured":"Lagrange, J.L.: Recherches d\u2019arithm\u00e9tique. Proc. Nouv. M\u00e9m. Acad. (1773)"},{"issue":"4","key":"14_CR15","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Liu, D., Bertino, E., Yi, X.: Privacy of outsourced k-means clustering. In: Moriai, S., Jaeger, T., Sakurai, K. (eds.) 9th ACM Symposium on Information, Computer and Communications Security, ASIA CCS 2014, Kyoto, Japan, 03\u201306 June 2014, pp. 123\u2013134. ACM (2014). https:\/\/doi.org\/10.1145\/2590296.2590332","DOI":"10.1145\/2590296.2590332"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/978-3-030-36711-4_51","volume-title":"Neural Information Processing","author":"J Liu","year":"2019","unstructured":"Liu, J., Bi, J.: Secure outsourcing of lattice basis reduction. In: Gedeon, T., Wong, K.W., Lee, M. (eds.) ICONIP 2019, Part II. LNCS, vol. 11954, pp. 603\u2013615. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36711-4_51"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11426639_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"PQ Ngu\u00ean","year":"2005","unstructured":"Ngu\u00ean, P.Q., Stehl\u00e9, D.: Floating-point LLL revisited. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 215\u2013233. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_13"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11792086_18","volume-title":"Algorithmic Number Theory","author":"PQ Nguyen","year":"2006","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: LLL on the average. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 238\u2013256. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11792086_18"},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Saruchi, Morel, I., Stehl\u00e9, D., Villard, G.: LLL reducing with the most significant bits. In: Nabeshima, K., Nagasaka, K., Winkler, F., Sz\u00e1nt\u00f3, \u00c1. (eds.) International Symposium on Symbolic and Algebraic Computation, ISSAC 20, Kobe, Japan, 23\u201325 July 2014, pp. 367\u2013374. ACM (2014). https:\/\/doi.org\/10.1145\/2608628.2608645","DOI":"10.1145\/2608628.2608645"},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Schnorr, C.: A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci. 53, 201\u2013224 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90064-8","DOI":"10.1016\/0304-3975(87)90064-8"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/3-540-46416-6_24","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"CP Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Factoring integers and computing discrete logarithms via diophantine approximation. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 281\u2013293. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_24"},{"key":"14_CR23","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 9.2) (2020). https:\/\/www.sagemath.org"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Tian, C., Yu, J., Zhang, H., Xue, H., Wang, C., Ren, K.: Novel secure outsourcing of modular inversion for arbitrary and variable modulus. IEEE Trans. Serv. Comput., 1 (2019). https:\/\/doi.org\/10.1109\/TSC.2019.2937486","DOI":"10.1109\/TSC.2019.2937486"},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Yang, Y., et al.: A comprehensive survey on secure outsourced computation and its applications. IEEE Access 7, 159426\u2013159465 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2949782","DOI":"10.1109\/ACCESS.2019.2949782"},{"key":"14_CR26","doi-asserted-by":"publisher","unstructured":"Zhang, F., Ma, X., Liu, S.: Efficient computation outsourcing for inverting a class of homomorphic functions. Inf. Sci. 286, 19\u201328 (2014). https:\/\/doi.org\/10.1016\/j.ins.2014.07.017","DOI":"10.1016\/j.ins.2014.07.017"},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"Zhang, H., Yu, J., Tian, C., Xu, G., Gao, P., Lin, J.: Practical and secure outsourcing algorithms for solving quadratic congruences in internet of things. IEEE Internet Things J. 7(4), 2968\u20132981 (2020). https:\/\/doi.org\/10.1109\/JIOT.2020.2964015","DOI":"10.1109\/JIOT.2020.2964015"},{"key":"14_CR28","doi-asserted-by":"publisher","unstructured":"Zhang, L., Zhang, H., Yu, J., Xian, H.: Blockchain-based two-party fair contract signing scheme. Inf. Sci. 535, 142\u2013155 (2020). https:\/\/doi.org\/10.1016\/j.ins.2020.05.054","DOI":"10.1016\/j.ins.2020.05.054"},{"key":"14_CR29","doi-asserted-by":"publisher","unstructured":"Zheng, Y., Tian, C., Zhang, H., Yu, J., Li, F.: Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures. J. Comput. Syst. Sci. 121, 18\u201333 (2021). https:\/\/doi.org\/10.1016\/j.jcss.2021.04.006. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000021000441","DOI":"10.1016\/j.jcss.2021.04.006"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93206-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T06:04:10Z","timestamp":1643004250000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93206-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030932053","9783030932060"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93206-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISPEC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security Practice and Experience","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ispec2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ispec2021.nuist.edu.cn","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"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":"94","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":"23","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":"24% - 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":"6","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)"}},{"value":"Doble peer review","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}