{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:51:48Z","timestamp":1725889908831},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319596075"},{"type":"electronic","value":"9783319596082"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-59608-2_45","type":"book-chapter","created":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T15:29:56Z","timestamp":1497367796000},"page":"758-761","source":"Crossref","is-referenced-by-count":4,"title":["POSTER: Location Privacy Using Homomorphic Encryption"],"prefix":"10.1007","author":[{"given":"Peizhao","family":"Hu","sequence":"first","affiliation":[]},{"given":"Siyu","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,14]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.pmcj.2014.09.010","volume":"17","author":"C Bettini","year":"2015","unstructured":"Bettini, C., Riboni, D.: Privacy protection in pervasive systems: state of the art and technical challenges. Pervasive Mob. Comput. Part B 17, 159\u2013174 (2015)","journal-title":"Pervasive Mob. Comput. Part B"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (Standard) LWE. In: Proceedings of FOCS 2011, pp. 97\u2013106. IEEE Computer Society, Washington, DC, USA (2011)","DOI":"10.1109\/FOCS.2011.12"},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, M., Lauter, K.: Homomorphic computation of edit distance. In: Workshop on Encrypted Computing and Applied Homomorphic Cryptography, Isla Verde, Puerto Rico, ACM, January 2015","DOI":"10.1007\/978-3-662-48051-9_15"},{"issue":"2","key":"45_CR4","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede, V., G\u00fcnther, O.: Multidimensional access methods. ACM Comput. Surv. 30(2), 170\u2013231 (1998)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"45_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/1666420.1666444","volume":"53","author":"C Gentry","year":"2010","unstructured":"Gentry, C.: Computing arbitrary functions of encrypted data. Commun. ACM 53(3), 97\u2013105 (2010)","journal-title":"Commun. ACM"},{"issue":"1","key":"45_CR6","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.pmcj.2010.04.006","volume":"7","author":"T Hashem","year":"2011","unstructured":"Hashem, T., Kulik, L.: \u201cDon\u2019t trust anyone\u201d: privacy protection for location-based services. Pervasive Mob. Comput. 7(1), 44\u201359 (2011)","journal-title":"Pervasive Mob. Comput."},{"key":"45_CR7","unstructured":"Hu, P., Mukherjee, T., Valliappan, A., Radziszowski, S.: Homomorphic proximity computation in geosocial networks. In: Proceeding of BigSecurity 2016, An INFOCOM 2016 Workshop, San Francisco, CA, USA, April 2016"},{"key":"45_CR8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-3-540-88702-7_5","volume-title":"Post-Quantum Cryptography","author":"D Micciancio","year":"2009","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 147\u2013191. Springer, Heidelberg (2009)"},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: Proceedings of CCSW 2011, pp. 113\u2013124, Chicago, IL, USA (2011)","DOI":"10.1145\/2046660.2046682"},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"Peikert, C.: A decade of lattice cryptography. IACR Cryptology ePrint Archive (2015\/939), p. 939 (2015)","DOI":"10.1561\/9781680831139"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Popa, R.A., Zeldovich, N.: How to compute with data you can\u2019t see. In: IEEE Spectrum, July 2015","DOI":"10.1109\/MSPEC.2015.7164401"},{"key":"45_CR12","doi-asserted-by":"crossref","unstructured":"Regev, O.: The learning with errors problem (invited survey). In: Proceedings of CCC 2010, pp. 191\u2013204, Cambridge, MA, June 2010","DOI":"10.1109\/CCC.2010.26"},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"Saldamli, G., Chow, R., Jin, H., Knijnenburg, B.: Private proximity testing with an untrusted server. In: Proceedings of WiSec 2013, Budapest, Hungary, ACM, April 2013","DOI":"10.1145\/2462096.2462115"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Security and Privacy in Communication Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59608-2_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,10]],"date-time":"2020-10-10T03:50:08Z","timestamp":1602301808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59608-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596075","9783319596082"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59608-2_45","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2017]]}}}