{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:37:54Z","timestamp":1760060274794,"version":"build-2065373602"},"reference-count":48,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T00:00:00Z","timestamp":1754611200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004955","name":"the Austrian Research Promotion Agency (FFG)","doi-asserted-by":"publisher","award":["4790430"],"award-info":[{"award-number":["4790430"]}],"id":[{"id":"10.13039\/501100004955","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>The road transport sector is currently facing significant challenges, due in part to CO2 emissions, high fuel prices, and a shortage of staff. These issues are partially caused by more than 40% of truck journeys being \u201cempty runs\u201d in some member states of the European Union and heavy under-utilization of deck space for non-empty runs. In order to overcome said inefficiency, this paper proposes a decentralized platform to facilitate collaborative transport networks (CTNs), i.e., to enable horizontal collaboration to increase load factors and reduce costs and CO2 emissions. Our solution leverages secure multi-party computation (MPC) to guarantee that no sensitive business information is leaked to competing hauliers. The system optimizes truck assignments by modeling logistics as a weighted graph that considers orders and truck capacities while maintaining strict confidentiality. Our approach addresses key barriers to CTN adoption, such as lack of trust and data privacy. Implemented using MPyC without extensive optimizations, we demonstrate the efficiency and effectiveness in increasing the average load factor, while achieving acceptable running times (in the order of hours) for arguably meaningful instance sizes (up to 1000 orders). After leveraging a rather simplistic modeling inspired by previous work, we finally give an outlook of possible extensions toward more realistic models and estimate their impact on efficiency.<\/jats:p>","DOI":"10.3390\/fi17080364","type":"journal-article","created":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T15:30:52Z","timestamp":1754667052000},"page":"364","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enabling Horizontal Collaboration in Logistics Through Secure Multi-Party Computation"],"prefix":"10.3390","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8578-3707","authenticated-orcid":false,"given":"Gabriele","family":"Spini","sequence":"first","affiliation":[{"name":"AIT Austrian Institute of Technology, 1210 Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2835-9093","authenticated-orcid":false,"given":"Stephan","family":"Krenn","sequence":"additional","affiliation":[{"name":"AIT Austrian Institute of Technology, 1210 Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8397-9303","authenticated-orcid":false,"given":"Erich","family":"Teppan","sequence":"additional","affiliation":[{"name":"Fraunhofer Austria, 9020 Klagenfurt, Austria"},{"name":"Department of Artificial Intelligence and Cybersecurity, University of Klagenfurt, 9020 Klagenfurt, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7613-3596","authenticated-orcid":false,"given":"Christina","family":"Petschnigg","sequence":"additional","affiliation":[{"name":"Fraunhofer Austria, 9020 Klagenfurt, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Wiegelmann","sequence":"additional","affiliation":[{"name":"Fraunhofer Austria, 9020 Klagenfurt, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,8,8]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1108\/09600030710752514","article-title":"Joint route planning under varying market conditions","volume":"37","author":"Cruijssen","year":"2007","journal-title":"Int. J. Phys. Distrib. Logist. Manag."},{"key":"ref_2","unstructured":"Zhang, J., Dresner, M., Zhang, R., Hua, G., and Shang, X. (2020). An Improved Two-Level Approach for the Collaborative Freight Delivery in Urban Areas. LISS2019, Proceedings of the 9th International Conference on Logistics, Informatics and Service Sciences, College Park, MD, USA, 26\u201329 July 2019, Springer."},{"key":"ref_3","unstructured":"Teppan, E., Petschnigg, C., Wiegelmann, E., Spini, G., and Krenn, S. (2024, January 11\u201313). A Heuristic Search Algorithm for the Collaborative Freighter Delivery Problem. Proceedings of the International Conference on Computational Science and Computational Intelligence\u2014CSCI, Las Vegas, NV, USA."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1186\/s12544-021-00512-3","article-title":"Horizontal collaboration in the freight transport sector: Barrier and decision-making frameworks","volume":"13","author":"Karam","year":"2021","journal-title":"Eur. Transp. Res. Rev."},{"key":"ref_5","unstructured":"Krenn, S., Petschnigg, C., Spini, G., Teppan, E., and Wiegelmann, E. (2025, August 06). Collaborative Freight Delivery Planning: Problem Description and Benchmark Specification. Available online: https:\/\/doi.org\/10.13140\/RG.2.2.22766.63040\/1."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1080\/01441647.2015.1038666","article-title":"Planning for Urban Freight Transport: An Overview","volume":"35","author":"Cui","year":"2015","journal-title":"Transp. Rev."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/j.ejor.2004.03.001","article-title":"Supply chain management and advanced planning\u2013basics, overview and challenges","volume":"163","author":"Stadtler","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"169496","DOI":"10.1109\/ACCESS.2020.3018305","article-title":"Drop-Shipping and Backup-Sourcing Strategies Under the Risk of Supply Disruption","volume":"8","author":"Zeng","year":"2020","journal-title":"IEEE Access"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1109\/TIV.2018.2843163","article-title":"Mixed-Integer Linear Programming for Optimal Scheduling of Autonomous Vehicle Intersection Crossing","volume":"3","author":"Fayazi","year":"2018","journal-title":"IEEE Trans. Intell. Veh."},{"key":"ref_10","first-page":"100249","article-title":"Industrial-size job shop scheduling with constraint programming","volume":"9","author":"Teppan","year":"2022","journal-title":"Oper. Res. Perspect."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/s10601-018-9281-x","article-title":"IBM ILOG CP optimizer for scheduling\u201420+ years of scheduling with constraints at IBM\/ILOG","volume":"23","author":"Laborie","year":"2018","journal-title":"Constraints Int. J."},{"key":"ref_12","unstructured":"Col, G.D., and Teppan, E. (2019, January 20\u201325). Google vs IBM: A Constraint Solving Challenge on the Job-Shop Scheduling Problem. Proceedings of the ICLP 2019, Las Cruces, NM, USA."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0377-2217(89)90185-9","article-title":"New approaches for heuristic search: A bilateral linkage with artificial intelligence","volume":"39","author":"Glover","year":"1989","journal-title":"Eur. J. Oper. Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.tre.2013.06.001","article-title":"An heuristic search for the routing of heterogeneous trucks with single and double container loads","volume":"56","author":"Lai","year":"2013","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Gojkovi\u0107, M., and Schranz, M. (2024, January 29\u201331). Preserving Privacy in Logistics by Using Swarm Intelligence from the Bottom-Up. Proceedings of the International Conference on Intelligent Systems\u2014IS, Varna, Bulgaria.","DOI":"10.1109\/IS61756.2024.10705232"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Yao, A.C. (1982, January 3\u20135). Protocols for secure computations. Proceedings of the International Workshop on Security and Forensics in Communication Systems\u2014SFCS, Chicago, IL, USA.","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., and Wigderson, A. (1987, January 25\u201327). How to play ANY mental game. Proceedings of the STOC \u201987: Symposium on the Theory of Computing\u2014STOC, New York, NY, USA.","DOI":"10.1145\/28395.28420"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., and Wigderson, A. (1988, January 2\u20134). Completeness theorems for non-cryptographic fault-tolerant distributed computation. Proceedings of the STOC \u201988: Symposium on the Theory of Computing\u2014STOC, Chicago, IL, USA.","DOI":"10.1145\/62212.62213"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., and Damgard, I. (1988, January 2\u20134). Multiparty unconditionally secure protocols. Proceedings of the STOC \u201988: Symposium on the Theory of Computing\u2014STOC, Chicago, IL, USA.","DOI":"10.1145\/62212.62214"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Goldreich, O. (2004). Foundations of Cryptography: Volume 2, Basic Applications, Cambridge University Press.","DOI":"10.1017\/CBO9780511721656"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., and Rogaway, P. (1990, January 13\u201317). The round complexity of secure protocols. Proceedings of the STOC \u201990: Symposium on the Theory of Computing\u2014STOC, Baltimore, MD, USA.","DOI":"10.1145\/100216.100287"},{"key":"ref_22","first-page":"420","article-title":"Efficient Multiparty Protocols Using Circuit Randomization","volume":"Volume 576","author":"Feigenbaum","year":"1992","journal-title":"Advances in Cryptology\u2014CRYPTO \u201991, Proceedings of the International Cryptology Conference\u2014CRYPTO, Santa Barbara, CA, USA, 11\u201315 August 1991"},{"key":"ref_23","unstructured":"Gennaro, R., Rabin, M.O., and Rabin, T. (July, January 28). Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. Proceedings of the PODC \u201998: ACM Symposium on Principles of Distributed Computing\u2014PODC, Puerto Vallarta, Mexico."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Commun. ACM"},{"key":"ref_25","first-page":"145","article-title":"Extending Oblivious Transfers Efficiently","volume":"Volume 2729","author":"Boneh","year":"2003","journal-title":"Advances in Cryptology\u2014CRYPTO 2003, Proceedings of the 23rd Annual International Cryptology Conference, Santa Barbara, CA, USA, 17\u201321 August 2003"},{"key":"ref_26","first-page":"213","article-title":"Perfectly-Secure MPC with Linear Communication Complexity","volume":"Volume 4948","author":"Canetti","year":"2008","journal-title":"Theory of Cryptography, Proceedings of the Fifth Theory of Cryptography Conference, TCC 2008, New York, NY, USA, 19\u201321 March 2008"},{"key":"ref_27","first-page":"325","article-title":"Secure Multiparty Computation Goes Live","volume":"Volume 5628","author":"Dingledine","year":"2009","journal-title":"Financial Cryptography and Data Security, Proceedings of the 13th International Conference, FC 2009, Accra Beach, Barbados, 23\u201326 February 2009"},{"key":"ref_28","first-page":"169","article-title":"Semi-homomorphic Encryption and Multiparty Computation","volume":"Volume 6632","author":"Paterson","year":"2011","journal-title":"Advances in Cryptology\u2014EUROCRYPT 2011, Proceedings of the 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, 15\u201319 May 2011"},{"key":"ref_29","first-page":"643","article-title":"Multiparty Computation from Somewhat Homomorphic Encryption","volume":"Volume 7417","author":"Canetti","year":"2012","journal-title":"Advances in Cryptology\u2014CRYPTO 2012, Proceedings of the 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, 19\u201323 August 2012"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Loruenser, T., Wohner, F., and Krenn, S. (2022, January 7). A Verifiable Multiparty Computation Solver for the Linear Assignment Problem: And Applications to Air Traffic Management. Proceedings of the CCSW\u201922: Cloud Computing Security Workshop\u2014CCSW, Los Angeles, CA, USA.","DOI":"10.1145\/3560810.3564263"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1561\/3300000019","article-title":"A Pragmatic Introduction to Secure Multi-Party Computation","volume":"2","author":"Evans","year":"2018","journal-title":"Found. Trends Priv. Secur."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I.B., and Nielsen, J.B. (2015). Secure Multiparty Computation and Secret Sharing, Cambridge University Press.","DOI":"10.1017\/CBO9781107337756"},{"key":"ref_33","unstructured":"Rivest, R.L., Adleman, L., and Dertouzos, M.L. (1978). On Data Banks and Privacy Homomorphisms. Foundations of Secure Computation, Academia Press."},{"key":"ref_34","unstructured":"Mitzenmacher, M. (June, January 31). Fully homomorphic encryption using ideal lattices. Proceedings of the STOC \u201909, Bethesda, MD, USA."},{"key":"ref_35","first-page":"1","article-title":"Differential Privacy: A Survey of Results","volume":"Volume 4978","author":"Agrawal","year":"2008","journal-title":"Theory and Applications of Models of Computation, Proceedings of the 5th International Conference, TAMC 2008, Xi\u2019an, China, 25\u201329 April 2008"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Sabt, M., Achemlal, M., and Bouabdallah, A. (2015, January 20\u201322). Trusted Execution Environment: What It is, and What It is Not. Proceedings of the IEEE TrustCom\/BigDataSE\/ISPA 2015, Helsinki, Finland.","DOI":"10.1109\/Trustcom.2015.357"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.3934\/amc.2021049","article-title":"A survey on functional encryption","volume":"17","author":"Mascia","year":"2023","journal-title":"Adv. Math. Commun."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"387","DOI":"10.7307\/ptt.v27i5.1687","article-title":"Cost Structure in Relation to the Size of Road Transport Enterprises","volume":"27","author":"Kot","year":"2015","journal-title":"Promet-Traffic Transp."},{"key":"ref_39","unstructured":"Garey, M.R., and Johnson, D.S. (1979). Computers and Intractability, Freeman."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/230514.571645","article-title":"Introduction to the Theory of Computation","volume":"27","author":"Sipser","year":"1996","journal-title":"ACM Sigact News"},{"key":"ref_41","unstructured":"Ligatti, J., Ou, X., Katz, J., and Vigna, G. (2020, January 9\u201313). MP-SPDZ: A Versatile Framework for Multi-Party Computation. Proceedings of the ACM Conference on Computer and Communications Security\u2014CCS, Virtual Event."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Canetti, R. (2001, January 8\u201311). Universally composable security: A new paradigm for cryptographic protocols. Proceedings of the Proceedings 42nd IEEE Symposium on Foundations of Computer Science, Newport Beach, CA, USA.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/s00145-015-9214-4","article-title":"A full proof of the BGW protocol for perfectly secure multiparty computation","volume":"30","author":"Asharov","year":"2017","journal-title":"J. Cryptol."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"ref_45","first-page":"506","article-title":"Efficient, Oblivious Data Structures for MPC","volume":"Volume 8874","author":"Sarkar","year":"2014","journal-title":"Advances in Cryptology\u2014ASIACRYPT 2014, Proceedings of the 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, China, 7\u201311 December 2014"},{"key":"ref_46","unstructured":"De Hoogh, S. (2012). Design of Large Scale Applications of Secure Multiparty Computation: Secure Linear Programming. [Ph.D. Thesis, Eindhoven University of Technology]."},{"key":"ref_47","first-page":"3","article-title":"Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems","volume":"Volume 9092","author":"Malkin","year":"2015","journal-title":"Applied Cryptography and Network Security, Proceedings of the 13th International Conference, ACNS 2015, New York, NY, USA, 2\u20135 June 2015"},{"key":"ref_48","unstructured":"Aykurt, F. (2023). Analysis of Two Versatile MPC Frameworks MP-SPDZ and MPyC. [Master\u2019s Thesis, Middle East Technical University]."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/17\/8\/364\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:26:52Z","timestamp":1760034412000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/17\/8\/364"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,8]]},"references-count":48,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2025,8]]}},"alternative-id":["fi17080364"],"URL":"https:\/\/doi.org\/10.3390\/fi17080364","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2025,8,8]]}}}