{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:29:14Z","timestamp":1725902954906},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319615417"},{"type":"electronic","value":"9783319615424"}],"license":[{"start":{"date-parts":[[2017,7,5]],"date-time":"2017-07-05T00:00:00Z","timestamp":1499212800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-61542-4_66","type":"book-chapter","created":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T08:02:27Z","timestamp":1499155347000},"page":"666-675","source":"Crossref","is-referenced-by-count":0,"title":["Reliable Homomorphic Matrix Disguising Scheme"],"prefix":"10.1007","author":[{"given":"Yonghui","family":"Chen","sequence":"first","affiliation":[]},{"given":"Mingwu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Chao","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,5]]},"reference":[{"key":"66_CR1","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, vol. 9, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"66_CR2","unstructured":"Atallah, M.J., Pantazopoulos, K.N., Spafford, E.H.: Secure outsourcing of some computations. Department of Computer Sciences. CSD-TR-96-074, Pudue University (1996)"},{"key":"66_CR3","unstructured":"Zhou, K., Ren, J.: ASO: cost-aware secure outsourcing of general computational problems (2015). arXiv preprint \narXiv:1511.02375"},{"key":"66_CR4","unstructured":"Rivest, R., Adleman, L., Dertouzos, M.: On data banks and privacy homomorphisms. In: Foundations of Secure Computation, pp. 169\u2013180 (1978)"},{"issue":"2","key":"66_CR5","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"66_CR6","unstructured":"Armknecht, F., Sadeghi, A.R.: A new approach for algebraically homomorphic encryption. IACR Cryptology ePrint Archive (2008)"},{"key":"66_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-71677-8_21","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"A Kawachi","year":"2007","unstructured":"Kawachi, A., Tanaka, K., Xagawa, K.: Multi-bit cryptosystems based on lattice problems. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 315\u2013329. Springer, Heidelberg (2007). doi:\n10.1007\/978-3-540-71677-8_21"},{"key":"66_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M Dijk","year":"2010","unstructured":"Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24\u201343. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-13190-5_2"},{"key":"66_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505\u2013524. Springer, Heidelberg (2011). doi:\n10.1007\/978-3-642-22792-9_29"},{"issue":"2","key":"66_CR10","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from standard LWE. SIAM J. Comput. 43(2), 831\u2013871 (2014)","journal-title":"SIAM J. Comput."},{"key":"66_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-70936-7_16","volume-title":"Theory of Cryptography","author":"E Kiltz","year":"2007","unstructured":"Kiltz, E., Mohassel, P., Weinreb, E., Franklin, M.: Secure linear algebra using linearly recurrent sequences. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 291\u2013310. Springer, Heidelberg (2007). doi:\n10.1007\/978-3-540-70936-7_16"},{"key":"66_CR12","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). doi:\n10.1007\/978-3-642-14623-7_25"},{"key":"66_CR13","doi-asserted-by":"crossref","unstructured":"Fiore, D., Gennaro, R.: Publicly verifiable delegation of large polynomials and matrix computations, with applications. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 501\u2013512. ACM (2012)","DOI":"10.1145\/2382196.2382250"},{"key":"66_CR14","first-page":"216","volume":"54","author":"MJ Atallah","year":"2002","unstructured":"Atallah, M.J., Pantazopoulos, K.N., Rice, J.R., et al.: Secure outsourcing of scientific computations. Adv. Comput. 54, 216\u2013272 (2002)","journal-title":"Adv. Comput."},{"key":"66_CR15","doi-asserted-by":"crossref","unstructured":"Benjamin, D., Atallah, M.: Private and cheating-free outsourcing of algebraic computations. In: 6th Conference on Privacy, Security, and Trust (PST), New Brunswick (2008)","DOI":"10.1109\/PST.2008.12"},{"key":"66_CR16","doi-asserted-by":"crossref","unstructured":"Atallah, M., Frikken, K.: Securely outsourcing linear algebra computations. In: 5th ACM Symposium on Information, Computer and Communications Security, pp. 48\u201359 (2010)","DOI":"10.1145\/1755688.1755695"},{"key":"66_CR17","doi-asserted-by":"crossref","unstructured":"Wang, C., Ren, K., Wang, J.: Secure and practical outsourcing of linear programming in cloud computing. In: INFOCOM (2011)","DOI":"10.1109\/INFCOM.2011.5935305"},{"key":"66_CR18","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1007\/s12652-015-0280-0","volume":"6","author":"J Yu","year":"2015","unstructured":"Yu, J., Wang, X., Gao, W.: Improvement and applications of secure outsourcing of scientific computations. J Ambient Intell. Hum. Comput. 6, 763\u2013772 (2015)","journal-title":"J Ambient Intell. Hum. Comput."},{"key":"66_CR19","doi-asserted-by":"crossref","unstructured":"Hu, X., Tang, C.: Secure outsourced computation of the characteristic polynomial and eigen values of matrix. J. Cloud Comput. 4, 7 (2015)","DOI":"10.1186\/s13677-015-0033-9"},{"issue":"7","key":"66_CR20","first-page":"842","volume":"43","author":"X Hu","year":"2013","unstructured":"Hu, X., et al.: Verifiable and secure outsourcing of matrix calculation and its application. Scientia sinica: Inf. 43(7), 842\u2013852 (2013)","journal-title":"Scientia sinica: Inf."},{"key":"66_CR21","unstructured":"L\u00fctkepohl, H.: Handbook of Matrices. Wiley, New York (1996)"},{"key":"66_CR22","volume-title":"Matrix Analysis and Applications","author":"X Zhang","year":"2004","unstructured":"Zhang, X.: Matrix Analysis and Applications. Tsinghua and Springer Publishing house, Beijing (2004)"}],"container-title":["Advances in Intelligent Systems and Computing","Innovative Mobile and Internet Services in Ubiquitous Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61542-4_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T08:28:57Z","timestamp":1499156937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-61542-4_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,5]]},"ISBN":["9783319615417","9783319615424"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61542-4_66","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017,7,5]]}}}