{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T14:00:25Z","timestamp":1770818425407,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031178337","type":"print"},{"value":"9783031178344","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17834-4_10","type":"book-chapter","created":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T17:02:53Z","timestamp":1664038973000},"page":"168-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Distributed Architecture for Privacy-Preserving Optimization Using Genetic Algorithms and Multi-party Computation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0955-8647","authenticated-orcid":false,"given":"Christoph G.","family":"Schuetz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1829-4882","authenticated-orcid":false,"given":"Thomas","family":"Lor\u00fcnser","sequence":"additional","affiliation":[]},{"given":"Samuel","family":"Jaburek","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Schuetz","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Wohner","sequence":"additional","affiliation":[]},{"given":"Roman","family":"Karl","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3897-3003","authenticated-orcid":false,"given":"Eduard","family":"Gringinger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,25]]},"reference":[{"issue":"5","key":"10_CR1","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1016\/j.trc.2010.06.003","volume":"19","author":"L Castelli","year":"2011","unstructured":"Castelli, L., Pesenti, R., Ranieri, A.: The design of a market mechanism to allocate air traffic flow management slots. Transp. Res. Part C Emerg. Technol. 19(5), 931\u2013943 (2011). https:\/\/doi.org\/10.1016\/j.trc.2010.06.003","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Nielsen, J.B.: Secure Multiparty Computation. Cambridge University Press, Cambridge (2015)","DOI":"10.1017\/CBO9781107337756"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Doerner, J., Evans, D., Shelat, A.: Secure stable matching at scale. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM Conference on Computer and Communications Security, pp. 1602\u20131613 (2016)","DOI":"10.1145\/2976749.2978373"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11967668_11","volume-title":"Topics in Cryptology \u2013 CT-RSA 2007","author":"M Franklin","year":"2006","unstructured":"Franklin, M., Gondree, M., Mohassel, P.: Improved efficiency for private stable matching. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol. 4377, pp. 163\u2013177. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11967668_11"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-15871-1_5","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"D Funke","year":"2010","unstructured":"Funke, D., Kerschbaum, F.: Privacy-preserving multi-objective evolutionary algorithms. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6239, pp. 41\u201350. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15871-1_5"},{"issue":"5","key":"10_CR6","doi-asserted-by":"publisher","first-page":"386","DOI":"10.4169\/amer.math.monthly.120.05.386","volume":"120","author":"D Gale","year":"2013","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 120(5), 386\u2013391 (2013)","journal-title":"Am. Math. Mon."},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/11889663_5","volume-title":"Financial Cryptography and Data Security","author":"P Golle","year":"2006","unstructured":"Golle, P.: A private stable matching algorithm. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol. 4107, pp. 65\u201380. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889663_5"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Keller, M.: MP-SPDZ: a versatile framework for multi-party computation. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (2020). https:\/\/doi.org\/10.1145\/3372297.3417872","DOI":"10.1145\/3372297.3417872"},{"issue":"1\u20132","key":"10_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logistics Q. 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res. Logistics Q."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Lewi, K., Wu, D.J.: Order-revealing encryption: new constructions, applications, and lower bounds. Cryptology ePrint Archive, Report 2016\/612 (2016)","DOI":"10.1145\/2976749.2978376"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Lor\u00fcnser, T., Wohner, F., Krenn, S.: A verifiable multiparty computation solver for the assignment problem and applications to air traffic management (2022). https:\/\/doi.org\/10.48550\/ARXIV.2205.03048","DOI":"10.48550\/ARXIV.2205.03048"},{"key":"10_CR12","doi-asserted-by":"publisher","DOI":"10.1201\/9780429466335","volume-title":"Handbook of Applied Cryptography","author":"A Menezes","year":"1997","unstructured":"Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, New York (1997). https:\/\/doi.org\/10.1201\/9780429466335"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"102124","DOI":"10.1016\/j.jairtraman.2021.102124","volume":"97","author":"N Pilon","year":"2021","unstructured":"Pilon, N., Guichard, L., Bazso, Z., Murgese, G., Carr\u00e9, M.: User-driven prioritisation process (UDPP) from advanced experimental to pre-operational validation environment. J. Air Transp. Manag. 97, 102124 (2021). https:\/\/doi.org\/10.1016\/j.jairtraman.2021.102124","journal-title":"J. Air Transp. Manag."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Sadegh Riazi, M., Songhori, E.M., Sadeghi, A.R., Schneider, T., Koushanfar, F.: Toward practical secure stable matching. In: Proceedings on Privacy Enhancing Technologies Symposium (PoPETs), pp. 62\u201378 (2017)","DOI":"10.1515\/popets-2017-0005"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Schuetz, C.G., Gringinger, E., Pilon, N., Lor\u00fcnser, T.: A privacy-preserving marketplace for air traffic flow management slot configuration. In: 2021 IEEE\/AIAA 40th Digital Avionics Systems Conference (DASC), pp. 1\u20139 (2021). https:\/\/doi.org\/10.1109\/DASC52595.2021.9594401","DOI":"10.1109\/DASC52595.2021.9594401"},{"key":"10_CR16","unstructured":"Schuetz, C.G., et al.: A distributed architecture for secrecy-preserving optimization using genetic algorithms and multi-party computation - Appendix. http:\/\/files.dke.uni-linz.ac.at\/publications\/schu22c\/appendix.pdf"},{"key":"10_CR17","unstructured":"Simon, D.: Evolutionary Optimization Algorithms. Wiley, New York (2013)"},{"key":"10_CR18","unstructured":"Wilhelmst\u00f6tter, F.: Jenetics library user\u2019s manual 7.1 (2022). https:\/\/jenetics.io\/manual\/manual-7.1.0.pdf"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"W\u00fcller, S., Vu, M., Meyer, U., Wetzel, S.: Using secure graph algorithms for the privacy-preserving identification of optimal bartering opportunities. In: Proceedings of the 2017 Workshop on Privacy in the Electronic Society, pp. 123\u2013132 (2017)","DOI":"10.1145\/3139550.3139557"}],"container-title":["Lecture Notes in Computer Science","Cooperative Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17834-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,25]],"date-time":"2022-09-25T23:09:17Z","timestamp":1664147357000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17834-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031178337","9783031178344"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17834-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CoopIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cooperative Information Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bozen-Bolzano","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"4 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"coopis2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/coopisconference.org\/","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":"68","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":"15","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":"5","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":"22% - 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":"2","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)"}}]}}