{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:38:00Z","timestamp":1742913480273,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031604324"},{"type":"electronic","value":"9783031604331"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-60433-1_11","type":"book-chapter","created":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T05:03:34Z","timestamp":1717045414000},"page":"169-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Oblivious Graph Algorithms for\u00a0Solving TSP and\u00a0VRP Using FHE and\u00a0MPC"],"prefix":"10.1007","author":[{"given":"Sam","family":"Leder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thijs","family":"Laarhoven","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,31]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Angel, S., Chen, H., Laine, K., Setty, S.: PIR with compressed queries and amortized query processing. In: 2018 IEEE Symposium on Security and Privacy (S &P), San Francisco, CA, USA, pp. 962\u2013979. IEEE (2018). https:\/\/doi.org\/10.1109\/SP.2018.00062","DOI":"10.1109\/SP.2018.00062"},{"issue":"4","key":"11_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S0305004100034095","volume":"55","author":"J Beardwood","year":"1959","unstructured":"Beardwood, J., Halton, J.H., Hammersley, J.M.: The shortest path through many points. Math. Proc. Cambridge Philos. Soc. 55(4), 299\u2013327 (1959). https:\/\/doi.org\/10.1017\/S0305004100034095","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Blatt, M., Gusev, A., Polyakov, Y., Goldwasser, S.: Secure large-scale genome-wide association studies using homomorphic encryption. Proc. Natl. Acad. Sci. 117(21), 11608\u201311613 (2020). https:\/\/doi.org\/10.1073\/pnas.1918257117. https:\/\/www.pnas.org\/doi\/abs\/10.1073\/pnas.1918257117","DOI":"10.1073\/pnas.1918257117"},{"key":"11_CR4","unstructured":"Blyss: Private access to 6gb (\u00a030%) of English Wikipedia (2022). https:\/\/spiralwiki.com\/"},{"key":"11_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in Cryptology - CRYPTO 2012","author":"Z Brakerski","year":"2012","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS 2012, pp. 309\u2013325. Association for Computing Machinery, New York (2012). https:\/\/doi.org\/10.1145\/2090236.2090262","DOI":"10.1145\/2090236.2090262"},{"key":"11_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-70694-8_15","volume-title":"Advances in Cryptology - ASIACRYPT 2017","author":"JH Cheon","year":"2017","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 409\u2013437. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15"},{"key":"11_CR8","unstructured":"Chillotti, I.: The three musketeers of secure computation: MPC, FHE and FE. COSIC Cryptography Blog (2019). https:\/\/www.esat.kuleuven.be\/cosic\/blog\/the-three-musketeers-of-secure-computation-mpc-fhe-and-fe\/"},{"key":"11_CR9","unstructured":"Chillotti, I.: TFHE deep dive (part 1). Zama Blog (2022). https:\/\/www.zama.ai\/post\/tfhe-deep-dive-part-1"},{"key":"11_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-53887-6_1","volume-title":"Advances in Cryptology - ASIACRYPT 2016","author":"I Chillotti","year":"2016","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 3\u201333. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_1"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791\u2013812 (1958). http:\/\/www.jstor.org\/stable\/167074","DOI":"10.1287\/opre.6.6.791"},{"key":"11_CR12","unstructured":"OpenFHE: Lattigo \u2013 open-source fully homomorphic encryption library (2023). https:\/\/www.openfhe.org\/"},{"key":"11_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-662-46800-5_24","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"L Ducas","year":"2015","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 617\u2013640. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24"},{"key":"11_CR14","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption (2012). https:\/\/eprint.iacr.org\/2012\/144"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 169\u2013178. Association for Computing Machinery, New York (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"11_CR16","unstructured":"Halevi, S., Shoup, V.: Helib \u2013 an open source software library that implements homomorphic encryption (2023). https:\/\/homenc.github.io\/HElib\/"},{"key":"11_CR17","unstructured":"HEaaN \u2013 fully homomorphic encryption with CKKS scheme [SIC] (2023). https:\/\/heaan.it\/"},{"key":"11_CR18","unstructured":"Insight: Lattigo polls demo \u2013 scheduling meetings with FHE (2020). https:\/\/github.com\/ldsec\/lattigo-polls-demo"},{"key":"11_CR19","unstructured":"Insight: Lattigo \u2013 a library for lattice-based multiparty homomorphic encryption in go (2023). https:\/\/github.com\/tuneinsight\/lattigo"},{"key":"11_CR20","unstructured":"Johnson, D.S., McGeoch, L.A., Rothberg, E.E.: Asymptotic experimental analysis for the held-karp traveling salesman bound. In: Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996, pp. 341\u2013350. Society for Industrial and Applied Mathematics, USA (1996)"},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Menon, S.J., Wu, D.J.: Spiral: fast, high-rate single-server PIR via FHE composition. In: 2022 IEEE Symposium on Security and Privacy (S &P), San Francisco, CA, USA, pp. 930\u2013947. IEEE (2022). https:\/\/doi.org\/10.1109\/SP46214.2022.9833700","DOI":"10.1109\/SP46214.2022.9833700"},{"key":"11_CR22","unstructured":"Microsoft: Microsoft seal \u2013 an easy-to-use and powerful homomorphic encryption library (2023). https:\/\/github.com\/microsoft\/SEAL"},{"key":"11_CR23","unstructured":"The HEBench Organization: Hebench \u2013 homomorphic encryption benchmarking framework (2023). https:\/\/hebench.org\/"},{"key":"11_CR24","unstructured":"Privacy-Preserving Computation Techniques: Un handbook on privacy-preserving computation techniques (2023). https:\/\/unstats.un.org\/bigdata\/task-teams\/training\/catalog\/Details?id=285"},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"Scheibner, J., Ienca, M., Vayena, E.: Health data privacy through homomorphic encryption and distributed ledger computing: an ethical-legal qualitative expert assessment study. BMC Med. Ethics 23(1), 1\u201313 (2022). https:\/\/doi.org\/10.1186\/s12910-022-00852-2","DOI":"10.1186\/s12910-022-00852-2"},{"key":"11_CR26","unstructured":"Schoenmakers, B.: MPyC \u2013 multiparty computation in python (2023). https:\/\/github.com\/lschoe\/mpyc"},{"issue":"11","key":"11_CR27","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"11_CR28","unstructured":"Society, T.R.: From privacy to partnership: the role of privacy enhancing technologies in data governance and collaborative analysis (2023). https:\/\/royalsociety.org\/topics-policy\/projects\/privacy-enhancing-technologies\/"},{"issue":"1","key":"11_CR29","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1239\/aap\/1427814579","volume":"47","author":"S Steinerberger","year":"2015","unstructured":"Steinerberger, S.: New bounds for the traveling salesman constant. Adv. Appl. Probab. 47(1), 27\u201336 (2015). https:\/\/doi.org\/10.1239\/aap\/1427814579","journal-title":"Adv. Appl. Probab."},{"key":"11_CR30","doi-asserted-by":"publisher","unstructured":"Vigo, D., Toth, P. (eds.): Vehicle Routing. Society for Industrial and Applied Mathematics, Philadelphia (2014). https:\/\/doi.org\/10.1137\/1.9781611973594. https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611973594","DOI":"10.1137\/1.9781611973594"},{"key":"11_CR31","doi-asserted-by":"publisher","unstructured":"Weng, H., Hettiarachchi, C., Nolan, C., Suominen, H., Lenskiy, A.: Ensuring security of artificial pancreas device system using homomorphic encryption. Biomed. Signal Process. Control 79, 104044 (2023). https:\/\/doi.org\/10.1016\/j.bspc.2022.104044. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S174680942200516X","DOI":"10.1016\/j.bspc.2022.104044"},{"key":"11_CR32","unstructured":"Zama: Sentiment analysis on encrypted data using homomorphic encryption (2022). https:\/\/huggingface.co\/spaces\/zama-fhe\/encrypted_sentiment_analysis"},{"key":"11_CR33","unstructured":"Zama: Concrete \u2013 an open-source FHE framework based on TFHE (2023). https:\/\/docs.zama.ai\/concrete"}],"container-title":["Communications in Computer and Information Science","Innovations for Community Services"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60433-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T05:13:47Z","timestamp":1717046027000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60433-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031604324","9783031604331"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60433-1_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"31 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"I4CS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Innovations for Community Services","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mastricht","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"i4cs2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.eah-jena.de\/i4cs-conference\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}