{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:24:23Z","timestamp":1742912663999,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319957289"},{"type":"electronic","value":"9783319957296"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-95729-6_9","type":"book-chapter","created":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T13:19:16Z","timestamp":1531142356000},"page":"131-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Privacy-Preserving Planarity Testing of Distributed Graphs"],"prefix":"10.1007","author":[{"given":"Guy","family":"Barshap","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamir","family":"Tassa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,10]]},"reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00014","volume":"3","author":"D Eppstein","year":"1999","unstructured":"Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms Appl. 3(3), 1\u201327 (1999)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4\/5","key":"9_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(81)90041-7","volume":"13","author":"CH Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The clique problem for planar graphs. Inf. Process. Lett. 13(4\/5), 131\u2013133 (1981)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0204019","volume":"4","author":"F Hadlock","year":"1975","unstructured":"Hadlock, F.: Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 4(3), 221\u2013225 (1975)","journal-title":"SIAM J. Comput."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/TKDE.2004.45","volume":"16","author":"M Kantarcioglu","year":"2004","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowl. Data Eng. 16, 1026\u20131037 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1109\/TKDE.2013.41","volume":"26","author":"T Tassa","year":"2014","unstructured":"Tassa, T.: Secure mining of association rules in horizontally distributed databases. Trans. Knowl. Data Eng. 26, 970\u2013983 (2014)","journal-title":"Trans. Knowl. Data Eng."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/s00778-006-0008-z","volume":"15","author":"W Jiang","year":"2006","unstructured":"Jiang, W., Clifton, C.: A secure distributed framework for achieving $$k$$-anonymity. VLDB J. 15, 316\u2013333 (2006)","journal-title":"VLDB J."},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2188349.2188353","volume":"37","author":"Tamir Tassa","year":"2012","unstructured":"Tassa, T., Gudes, E.: Secure distributed computation of anonymized views of shared databases. Trans. Database Syst. 37 (2012). Article 11","journal-title":"ACM Transactions on Database Systems"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1109\/TKDE.2011.232","volume":"25","author":"T Tassa","year":"2013","unstructured":"Tassa, T., Cohen, D.: Anonymization of centralized and distributed social networks by sequential clustering. Trans. Knowl. Data Eng. 25, 311\u2013324 (2013)","journal-title":"Trans. Knowl. Data Eng."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Jeckmans, A., Tang, Q., Hartel, P.: Privacy-preserving collaborative filtering based on horizontally partitioned dataset. In: CTS, pp. 439\u2013446 (2012)","DOI":"10.1109\/CTS.2012.6261088"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Shmueli, E., Tassa, T.: Secure multi-party protocols for item-based collaborative filtering. In: RecSys, pp. 89\u201397 (2017)","DOI":"10.1145\/3109859.3109881"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Asharov, G., Bonchi, F., Garc\u00eda-Soriano, D., Tassa, T.: Secure centrality computation over multiple networks. In: WWW, pp. 957\u2013966 (2017)","DOI":"10.1145\/3038912.3052602"},{"key":"9_CR12","unstructured":"Grinshpoun, T., Tassa, T.: A privacy-preserving algorithm for distributed constraint optimization. In: AAMAS, pp. 909\u2013916 (2014)"},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1613\/jair.3983","volume":"47","author":"T L\u00e9aut\u00e9","year":"2013","unstructured":"L\u00e9aut\u00e9, T., Faltings, B.: Protecting privacy through distributed computation in multi-agent decision making. J. Artif. Intell. Res. 47, 649\u2013695 (2013)","journal-title":"J. Artif. Intell. Res."},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1613\/jair.5504","volume":"59","author":"T Tassa","year":"2017","unstructured":"Tassa, T., Grinshpoun, T., Zivan, R.: Privacy preserving implementation of the max-sum algorithm and its variants. J. Artif. Intell. Res. 59, 311\u2013349 (2017)","journal-title":"J. Artif. Intell. Res."},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/BF01594196","volume":"114","author":"K Wagner","year":"1937","unstructured":"Wagner, K.: \u00dcber eine eigenschaft der ebenen komplexe. Math. Ann. 114, 570\u2013590 (1937)","journal-title":"Math. Ann."},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"K Kuratowski","year":"1930","unstructured":"Kuratowski, K.: Sur le probl\u00e8me des courbes gauches en topologie. Fundamenta Mathematicae 15, 271\u2013283 (1930)","journal-title":"Fundamenta Mathematicae"},{"key":"9_CR17","first-page":"1","volume-title":"Handbook on Graph Drawing and Visualization","author":"M Patrignani","year":"2013","unstructured":"Patrignani, M.: Handbook on Graph Drawing and Visualization, pp. 1\u201342. CRC Press, Boca Raton (2013)"},{"issue":"4","key":"9_CR18","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"JE Hopcroft","year":"1974","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Efficient planarity testing. J. ACM 21(4), 549\u2013568 (1974)","journal-title":"J. ACM"},{"issue":"2","key":"9_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.7155\/jgaa.00091","volume":"8","author":"JM Boyer","year":"2004","unstructured":"Boyer, J.M., Myrvold, W.J.: On the cutting edge: simplified o(n) planarity by edge addition. J. Graph Algorithms Appl. 8(2), 241\u2013273 (2004)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"9_CR20","doi-asserted-by":"publisher","first-page":"367","DOI":"10.7155\/jgaa.00298","volume":"17","author":"M Schaefer","year":"2013","unstructured":"Schaefer, M.: Toward a theory of planarity: Hanani-Tutte and planarity variants. J. Graph Algorithms Appl. 17(4), 367\u2013440 (2013)","journal-title":"J. Graph Algorithms Appl."},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-540-85174-5_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J Alwen","year":"2008","unstructured":"Alwen, J., Shelat, A., Visconti, I.: Collusion-free protocols in the mediated model. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 497\u2013514. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_28"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption and how to play mental poker keeping secret all partial information. In: STOC, pp. 365\u2013377 (1982)","DOI":"10.1145\/800070.802212"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/11681878_27","volume-title":"Theory of Cryptography","author":"K Nissim","year":"2006","unstructured":"Nissim, K., Weinreb, E.: Communication efficient secure linear algebra. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 522\u2013541. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_27"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Meadows, C.A.: A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In: IEEE Symposium on Security and Privacy, pp. 134\u2013137 (1986)","DOI":"10.1109\/SP.1986.10022"},{"issue":"6","key":"9_CR25","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations (extended abstract). In: FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/11496137_31","volume-title":"Applied Cryptography and Network Security","author":"H-Y Lin","year":"2005","unstructured":"Lin, H.-Y., Tzeng, W.-G.: An efficient solution to the millionaires\u2019 problem based on homomorphic encryption. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 456\u2013466. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496137_31"},{"key":"9_CR28","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1613\/jair.5322","volume":"57","author":"T Grinshpoun","year":"2016","unstructured":"Grinshpoun, T., Tassa, T.: P-syncbb: a privacy preserving branch and bound DCOP algorithm. J. Artif. Intell. Res. 57, 621\u2013660 (2016)","journal-title":"J. Artif. Intell. Res."},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Barshap, G.: Privacy-preserving planarity testing of distributed graphs. Master thesis, Department of Mathematics and Computer Science, The Open University of Israel (2018)","DOI":"10.1007\/978-3-319-95729-6_9"}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security and Privacy XXXII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95729-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T00:03:37Z","timestamp":1657325017000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-95729-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319957289","9783319957296"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95729-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"10 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DBSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP Annual Conference on Data and Applications Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bergamo","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dbsec2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dbsec18.unibg.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}