{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:34:02Z","timestamp":1743082442759,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031257339"},{"type":"electronic","value":"9783031257346"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-25734-6_8","type":"book-chapter","created":{"date-parts":[[2023,2,23]],"date-time":"2023-02-23T16:03:22Z","timestamp":1677168202000},"page":"120-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Parallel Privacy-Preserving Shortest Path Protocol from\u00a0a\u00a0Path Algebra Problem"],"prefix":"10.1007","author":[{"given":"Mohammad","family":"Anagreh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peeter","family":"Laud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,24]]},"reference":[{"key":"8_CR1","unstructured":"Aly, A., Cleemput, S.: An improved protocol for securely solving the shortest path problem and its application to combinatorial auctions. Cryptology ePrint Archive, Paper 2017\/971 (2017)"},{"issue":"4","key":"8_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.3390\/cryptography5040027","volume":"5","author":"M Anagreh","year":"2021","unstructured":"Anagreh, M., Laud, P., Vainikko, E.: Parallel privacy-preserving shortest path algorithms. Cryptography 5(4), 27 (2021)","journal-title":"Cryptography"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Anagreh, M., Laud, P., Vainikko, E.: Privacy-preserving parallel computation of shortest path algorithms with low round complexity. In: Mori, P., Lenzini, G., Furnell, S. (eds.) Proceedings of the 8th International Conference on Information Systems Security and Privacy, ICISSP 2022, Online Streaming, 9\u201311 February 2022, pp. 37\u201347. SCITEPRESS (2022)","DOI":"10.5220\/0010775700003120"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Anagreh, M., Vainikko, E., Laud, P.: Parallel privacy-preserving computation of minimum spanning trees. In: Mori, P., Lenzini, G., Furnell, S. (eds.) Proceedings of the 7th International Conference on Information Systems Security and Privacy, ICISSP 2021, Online Streaming, 11\u201313 February 2021, pp. 181\u2013190. SCITEPRESS (2021)","DOI":"10.5220\/0010255701810190"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Anagreh, M., Vainikko, E., Laud, P.: Parallel privacy-preserving shortest paths by radius-stepping. In: 2021 29th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), pp. 276\u2013280. IEEE (2021)","DOI":"10.1109\/PDP52278.2021.00051"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Q. Appl. Math. 16(1), 87\u201390 (1958)","journal-title":"Q. Appl. Math."},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-88313-5_13","volume-title":"Computer Security - ESORICS 2008","author":"D Bogdanov","year":"2008","unstructured":"Bogdanov, D., Laur, S., Willemson, J.: Sharemind: a framework for fast privacy-preserving computations. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol. 5283, pp. 192\u2013206. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88313-5_13"},{"issue":"6","key":"8_CR8","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10207-012-0177-2","volume":"11","author":"D Bogdanov","year":"2012","unstructured":"Bogdanov, D., Niitsoo, M., Toft, T., Willemson, J.: High-performance secure multi-party computation for data mining applications. Int. J. Inf. Secur. 11(6), 403\u2013418 (2012)","journal-title":"Int. J. Inf. Secur."},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory, Graduate Texts in Mathematics, vol. 184. Springer Science & Business Media, Berlin, Heidelberg (1998). https:\/\/doi.org\/10.1007\/978-1-4612-0619-4","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1007\/978-3-662-48000-7_36","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"E Boyle","year":"2015","unstructured":"Boyle, E., Chung, K.-M., Pass, R.: Large-scale secure computation: multi-party computation for (parallel) RAM programs. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 742\u2013762. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_36"},{"key":"8_CR11","unstructured":"Boyle, E., Jain, A., Prabhakaran, M., Yu, C.H.: The bottleneck complexity of secure multiparty computation. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"8_CR12","unstructured":"Burkhart, M., Strasser, M., Many, D., Dimitropoulos, X.: SEPIA: privacy-preserving aggregation of multi-domain network events and statistics. In: 19th USENIX Security Symposium (USENIX Security 10) (2010)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"issue":"2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-021-09377-0","volume":"34","author":"R Cohen","year":"2021","unstructured":"Cohen, R., Coretti, S., Garay, J., Zikas, V.: Round-preserving parallel composition of probabilistic-termination cryptographic protocols. J. Cryptol. 34(2), 1\u201357 (2021)","journal-title":"J. Cryptol."},{"key":"8_CR15","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2022)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-45146-4_15","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"I Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Universally composable efficient multiparty computation from threshold homomorphic encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 247\u2013264. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_15"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"6","key":"8_CR18","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)","journal-title":"Commun. ACM"},{"issue":"12","key":"8_CR19","doi-asserted-by":"publisher","first-page":"1901","DOI":"10.1109\/PROC.1966.5273","volume":"54","author":"MJ Flynn","year":"1966","unstructured":"Flynn, M.J.: Very high-speed computing systems. Proc. IEEE 54(12), 1901\u20131909 (1966)","journal-title":"Proc. IEEE"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, pp. 101\u2013111 (1998)","DOI":"10.1145\/277697.277716"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Henecka, W., K\u00f6gl, S., Sadeghi, A.R., Schneider, T., Wehrenberg, I.: Tasty: tool for automating secure two-party computations. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, pp. 451\u2013462 (2010)","DOI":"10.1145\/1866307.1866358"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Hodges, A.: Alan Turing: The Enigma. Princeton University Press, Princeton (2014)","DOI":"10.2307\/j.ctvc77913"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-72540-4_18","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J Katz","year":"2007","unstructured":"Katz, J., Koo, C.-Y.: Round-efficient secure computation in point-to-point networks. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 311\u2013328. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_18"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/3-540-39200-9_36","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"J Katz","year":"2003","unstructured":"Katz, J., Ostrovsky, R., Smith, A.: Round efficiency of multi-party computation with a dishonest majority. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 578\u2013595. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_36"},{"issue":"2","key":"8_CR25","first-page":"188","volume":"2015","author":"P Laud","year":"2015","unstructured":"Laud, P.: Parallel oblivious array access for secure multiparty computation and privacy-preserving minimum spanning trees. Proc. Priv. Enhanc. Technol. 2015(2), 188\u2013205 (2015)","journal-title":"Proc. Priv. Enhanc. Technol."},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Laud, P.: Stateful abstractions of secure multiparty computation. Appl. Secur. Multiparty Comput. Cryptol. Inf. Secur. 13, 26\u201342 (2015)","DOI":"10.1515\/popets-2015-0011"},{"issue":"2","key":"8_CR27","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"RJ Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36(2), 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"8_CR28","first-page":"321","volume":"7","author":"M Mohri","year":"2002","unstructured":"Mohri, M.: Semiring frameworks and algorithms for shortest-distance problems. J. Autom. Lang. Comb. 7(3), 321\u2013350 (2002)","journal-title":"J. Autom. Lang. Comb."},{"issue":"2","key":"8_CR29","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0020-0190(91)90013-8","volume":"40","author":"V Pan","year":"1991","unstructured":"Pan, V., Reif, J.: The parallel computation of minimum cost paths in graphs by stream contraction. Inf. Process. Lett. 40(2), 79\u201383 (1991)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"8_CR30","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1016\/0022-0000(89)90013-5","volume":"38","author":"V Pan","year":"1989","unstructured":"Pan, V., Reif, J.: Fast and efficient solution of path algebra problems. J. Comput. Syst. Sci. 38(3), 494\u2013510 (1989)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"8_CR31","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1137\/0222073","volume":"22","author":"V Pan","year":"1993","unstructured":"Pan, V., Reif, J.: Fast and efficient parallel solution of sparse linear systems. SIAM J. Comput. 22(6), 1227\u20131250 (1993)","journal-title":"SIAM J. Comput."},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Pinto, A., Carloni, L.P., Sangiovanni-Vincentelli, A.L.: Efficient synthesis of networks on chip. In: Proceedings 21st International Conference on Computer Design, pp. 146\u2013150. IEEE (2003)","DOI":"10.1109\/ICCD.2003.1240887"},{"key":"8_CR33","unstructured":"Randmets, J.: Programming Languages for Secure Multi-party Computation Application Development. Ph.D. thesis, Tartu University (2017)"},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Sealfon, A.: Shortest paths and distances with differential privacy. In: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 29\u201341 (2016)","DOI":"10.1145\/2902251.2902291"},{"issue":"7","key":"8_CR35","doi-asserted-by":"publisher","first-page":"2367","DOI":"10.1016\/j.patcog.2010.01.016","volume":"43","author":"Y Tarabalka","year":"2010","unstructured":"Tarabalka, Y., Chanussot, J., Benediktsson, J.A.: Segmentation and classification of hyperspectral images using watershed transformation. Pattern Recogn. 43(7), 2367\u20132379 (2010)","journal-title":"Pattern Recogn."},{"key":"8_CR36","unstructured":"West, D.B., et al.: Introduction to Graph Theory, vol. 2. Prentice Hall, Upper Saddle River (2001)"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Wu, D.J., Zimmerman, J., Planul, J., Mitchell, J.C.: Privacy-preserving shortest path computation. arXiv preprint arXiv:1601.02281 (2016)","DOI":"10.14722\/ndss.2016.23052"},{"issue":"5","key":"8_CR38","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1080\/00207720802645246","volume":"40","author":"T Yamada","year":"2009","unstructured":"Yamada, T.: A mini-max spanning forest approach to the political districting problem. Int. J. Syst. Sci. 40(5), 471\u2013477 (2009)","journal-title":"Int. J. Syst. Sci."},{"issue":"3","key":"8_CR39","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/0377-2217(94)00335-1","volume":"91","author":"T Yamada","year":"1996","unstructured":"Yamada, T., Takahashi, H., Kataoka, S.: A heuristic algorithm for the mini-max spanning forest problem. Eur. J. Oper. Res. 91(3), 565\u2013572 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR40","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982), pp. 160\u2013164. IEEE (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Data Privacy Management, Cryptocurrencies and Blockchain Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25734-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T01:14:17Z","timestamp":1728954857000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25734-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031257339","9783031257346"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25734-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DPM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Data Privacy Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dpm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/deic.uab.cat\/conferences\/dpm\/dpm2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","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":"21","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":"10","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":"48% - 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":"3","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)"}}]}}