{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:16:55Z","timestamp":1740107815895,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,11,6]],"date-time":"2017-11-06T00:00:00Z","timestamp":1509926400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Open project of Guangxi Key Lab. of Crypto. and Info. Security","award":["GCIS201622","GCIS201621"],"award-info":[{"award-number":["GCIS201622","GCIS201621"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772150","61262008"],"award-info":[{"award-number":["61772150","61262008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s00500-017-2896-9","type":"journal-article","created":{"date-parts":[[2017,11,6]],"date-time":"2017-11-06T08:53:35Z","timestamp":1509958415000},"page":"1735-1744","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE"],"prefix":"10.1007","volume":"23","author":[{"given":"Huiyong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3571-7576","authenticated-orcid":false,"given":"Yong","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shijie","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,6]]},"reference":[{"key":"2896_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal S, Boneh D, Boyen X (2010) Efficient lattice (H) IBE in the standard model. In: Advances in cryptology\u2014EUROCRYPT 2010, Springer, pp 553\u2013572","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"2896_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai M (1996) Generating hard instances of lattice problems. In: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, ACM, pp 99\u2013108","DOI":"10.1145\/237814.237838"},{"key":"2896_CR3","doi-asserted-by":"crossref","unstructured":"Alperin-Sheriff J, Peikert C (2014) Faster bootstrapping with polynomial error. In: Advances in cryptology\u2014CRYPTO 2014, Springer, pp 297\u2013314","DOI":"10.1007\/978-3-662-44371-2_17"},{"key":"2896_CR4","doi-asserted-by":"crossref","unstructured":"Asharov G, Jain A, L\u00f3pez-Alt A, Tromer E, Vaikuntanathan V, Wichs D (2012) Multiparty computation with low communication, computation and interaction via threshold FHE. In: Advances in cryptology\u2014EUROCRYPT 2012, Springer, pp 483\u2013501","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"2896_CR5","doi-asserted-by":"crossref","unstructured":"Boneh D, Lewi K, Montgomery H, Raghunathan A (2013) Key homomorphic PRFs and their applications. In: Advances in cryptology\u2014CRYPTO 2013, Springer, pp 410\u2013428","DOI":"10.1007\/978-3-642-40041-4_23"},{"issue":"2","key":"2896_CR6","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z, Vaikuntanathan V (2014) Efficient fully homomorphic encryption from (standard) LWE. SIAM J Comput 43(2):831\u2013871","journal-title":"SIAM J Comput"},{"key":"2896_CR7","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V (2012) (Leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd innovations in theoretical computer science conference, ACM, pp 309\u2013325","DOI":"10.1145\/2090236.2090262"},{"key":"2896_CR8","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Langlois A, Peikert C, Regev O, Stehl\u00e9 D (2013) Classical hardness of learning with errors. In: Proceedings of the forty-fifth annual ACM symposium on theory of computing, ACM, pp 575\u2013584","DOI":"10.1145\/2488608.2488680"},{"issue":"4","key":"2896_CR9","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s00145-011-9105-2","volume":"25","author":"D Cash","year":"2012","unstructured":"Cash D, Hofheinz D, Kiltz E, Peikert C (2012) Bonsai trees, or how to delegate a lattice basis. J Cryptol 25(4):601\u2013639","journal-title":"J Cryptol"},{"key":"2896_CR10","doi-asserted-by":"crossref","unstructured":"Clear M, McGoldrick C (2015) Multi-identity and multi-key leveled FHE from learning with errors. In: Advances in cryptology\u2014CRYPTO 2015, Springer, pp 630\u2013656","DOI":"10.1007\/978-3-662-48000-7_31"},{"key":"2896_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1142\/S0219493709002610","volume":"9","author":"C Gentry","year":"2009","unstructured":"Gentry C et al (2009) Fully homomorphic encryption using ideal lattices. STOC 9:169\u2013178","journal-title":"STOC"},{"key":"2896_CR12","doi-asserted-by":"crossref","unstructured":"Gentry C, Peikert C, Vaikuntanathan V (2008) Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the fortieth annual ACM symposium on theory of computing, ACM, pp 197\u2013206","DOI":"10.1145\/1374376.1374407"},{"key":"2896_CR13","doi-asserted-by":"crossref","unstructured":"Gentry C, Sahai A, Waters B (2013) Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Advances in cryptology\u2014CRYPTO 2013, Springer, pp 75\u201392","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"2896_CR14","doi-asserted-by":"publisher","unstructured":"Jiang L, Xu C, Wang X, Lin C (2016) Statistical learning based fully homomorphic encryption on encrypted data. Soft Comput. https:\/\/doi.org\/10.1007\/00500-016-2296-6","DOI":"10.1007\/00500-016-2296-6"},{"key":"2896_CR15","doi-asserted-by":"crossref","unstructured":"Liu Z, Weng J, Li J, Yang J, Fu C, Jia C (2016) Cloud-based electronic health record system supporting fuzzy keyword search. Soft Comput 20(8):3243\u20133255","DOI":"10.1007\/s00500-015-1699-0"},{"key":"2896_CR16","doi-asserted-by":"crossref","unstructured":"Lopez-Alt A, Tromer E, Vaikuntanathan V (2012) On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: Proceedings of the forty-fourth annual ACM symposium on theory of computing, ACM, pp 1219\u20131234","DOI":"10.1145\/2213977.2214086"},{"key":"2896_CR17","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Micciancio D (2009) On bounded distance decoding, unique shortest vectors, and the minimum distance problem. In: Advances in cryptology\u2014CRYPTO 2009, Springer, pp 577\u2013594","DOI":"10.1007\/978-3-642-03356-8_34"},{"key":"2896_CR18","volume-title":"Complexity of lattice problems: a cryptographic perspective","author":"D Micciancio","year":"2012","unstructured":"Micciancio D, Goldwasser S (2012) Complexity of lattice problems: a cryptographic perspective, vol 671. Springer, New York"},{"key":"2896_CR19","doi-asserted-by":"crossref","unstructured":"Micciancio D, Peikert C (2012) Trapdoors for lattices: simpler, tighter, faster, smaller. In: Advances in cryptology\u2014EUROCRYPT 2012, Springer, pp 700\u2013718","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"2896_CR20","doi-asserted-by":"crossref","unstructured":"Mukherjee P, Wichs D (2016) Two round multiparty computation via multi-key FHE. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, Berlin, Heidelberg, pp 735\u2013763","DOI":"10.1007\/978-3-662-49896-5_26"},{"key":"2896_CR21","doi-asserted-by":"crossref","unstructured":"Peikert C (2009) Public-key cryptosystems from the worst-case shortest vector problem. In: Proceedings of the forty-first annual ACM symposium on Theory of computing, ACM, pp 333\u2013342","DOI":"10.1145\/1536414.1536461"},{"key":"2896_CR22","doi-asserted-by":"crossref","unstructured":"Peikert C, Shiehian S (2016) Multi-key FHE from lwe, revisited. In: Theory of cryptography conference. Springer, Berlin, Heidelberg. pp 217\u2013238","DOI":"10.1007\/978-3-662-53644-5_9"},{"issue":"6","key":"2896_CR23","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1137\/080733954","volume":"40","author":"C Peikert","year":"2011","unstructured":"Peikert C, Waters B (2011) Lossy trapdoor functions and their applications. SIAM J Comput 40(6):1803\u20131844","journal-title":"SIAM J Comput"},{"key":"2896_CR24","doi-asserted-by":"crossref","unstructured":"Peikert C, Vaikuntanathan V, Waters B (2008) A framework for efficient and composable oblivious transfer. In: Advances in cryptology\u2014CRYPTO 2008, Springer, pp 554\u2013571","DOI":"10.1007\/978-3-540-85174-5_31"},{"issue":"6","key":"2896_CR25","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. J ACM (JACM) 56(6):34","journal-title":"J ACM (JACM)"},{"key":"2896_CR26","doi-asserted-by":"crossref","unstructured":"Regev O (2010) The learning with errors problem (invited survey). In: IEEE conference on computational complexity, IEEE Computer Society, pp 191\u2013204","DOI":"10.1109\/CCC.2010.26"},{"key":"2896_CR27","unstructured":"Reyzin L, Fuller B, Meng X (2013) Computational fuzzy extractors. In: International conference on the theory and application of cryptology and information security, Springer, Berlin, pp 174\u2013193"},{"key":"2896_CR28","volume-title":"Introduction to probability and statistics for engineers and scientists","author":"SM Ross","year":"2014","unstructured":"Ross SM (2014) Introduction to probability and statistics for engineers and scientists. Academic Press, Oxford"},{"key":"2896_CR29","doi-asserted-by":"crossref","unstructured":"Van Dijk M, Gentry C, Halevi S, Vaikuntanathan V (2010) Fully homomorphic encryption over the integers. In: Advances in cryptology\u2014EUROCRYPT 2010, Springer, pp 24\u201343","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"2896_CR30","doi-asserted-by":"crossref","unstructured":"Xiang C, Tang C, Cai Y, Xu Q (2016) Privacy-preserving face recognition with outsourced computation. Soft Comput 20(9):3735\u20133744","DOI":"10.1007\/s00500-015-1759-5"},{"key":"2896_CR31","doi-asserted-by":"crossref","unstructured":"Yao AC (1982) Protocols for secure computations. In: Foundations of computer science, 1982. SFCS\u201908. 23rd annual symposium on, IEEE, pp 160\u2013164","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-017-2896-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2896-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2896-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T13:43:49Z","timestamp":1570283029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-017-2896-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,6]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["2896"],"URL":"https:\/\/doi.org\/10.1007\/s00500-017-2896-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2017,11,6]]},"assertion":[{"value":"6 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest with any individual or organization.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animals rights"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}