{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T22:47:52Z","timestamp":1769640472824,"version":"3.49.0"},"reference-count":48,"publisher":"Privacy Enhancing Technologies Symposium Advisory Board","issue":"3","license":[{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,7,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The Border Gateway Protocol (BGP) computes routes between the organizational networks that make up today\u2019s Internet. Unfortunately, BGP suffers from deficiencies, including slow convergence, security problems, a lack of innovation, and the leakage of sensitive information about domains\u2019 routing preferences. To overcome some of these problems, we revisit the idea of centralizing and using secure multi-party computation (MPC) for interdomain routing which was proposed by Gupta et al. (ACM HotNets\u201912). We implement two algorithms for interdomain routing with state-of-the-art MPC protocols. On an empirically derived dataset that approximates the topology of today\u2019s Internet (55 809 nodes), our protocols take as little as 6 s of topology-independent precomputation and only 3 s of online time. We show, moreover, that when our MPC approach is applied at country\/region-level scale, runtimes can be as low as 0.17 s online time and 0.20 s pre-computation time. Our results motivate the MPC approach for interdomain routing and furthermore demonstrate that current MPC techniques are capable of efficiently tackling real-world problems at a large scale.<\/jats:p>","DOI":"10.1515\/popets-2017-0033","type":"journal-article","created":{"date-parts":[[2017,7,8]],"date-time":"2017-07-08T10:01:47Z","timestamp":1499508107000},"page":"147-167","source":"Crossref","is-referenced-by-count":30,"title":["Privacy-Preserving Interdomain Routing at Internet Scale"],"prefix":"10.56553","volume":"2017","author":[{"given":"Gilad","family":"Asharov","sequence":"first","affiliation":[{"name":"Cornell Tech"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Demmler","sequence":"additional","affiliation":[{"name":"TU Darmstadt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Schneider","sequence":"additional","affiliation":[{"name":"TU Darmstadt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gil","family":"Segev","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Shenker","sequence":"additional","affiliation":[{"name":"University of California , Berkley"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Zohner","sequence":"additional","affiliation":[{"name":"TU Darmstadt"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"35752","published-online":{"date-parts":[[2017,7,6]]},"reference":[{"key":"2021040814264414804_j_popets-2017-0033_ref_001_w2aab2b8c23b1b7b1ab1ab1Aa","unstructured":"[1] S. Machiraju and R. H. Katz. Leveraging BGP dynamics to reverse-engineer routing policies. Technical Report UCB\/EECS-2006-61, EECS Department, University of California, Berkeley, May 2006."},{"key":"2021040814264414804_j_popets-2017-0033_ref_002_w2aab2b8c23b1b7b1ab1ab2Aa","unstructured":"[2] V. Giotsas and S. Zhou. Inferring AS relationships from BGP attributes. CoRR, abs\/1106.2417, 2011."},{"key":"2021040814264414804_j_popets-2017-0033_ref_003_w2aab2b8c23b1b7b1ab1ab3Aa","doi-asserted-by":"crossref","unstructured":"[3] D. Gupta, A. Segal, A. Panda, G. Segev, M. Schapira, J. Feigenbaum, J. Rexford, and S. Shenker. A new approach to interdomain routing based on secure multi-party computation. In Workshop on Hot Topics in Networks (HotNets\u201912), pages 37\u201342. ACM, 2012.","DOI":"10.1145\/2390231.2390238"},{"key":"2021040814264414804_j_popets-2017-0033_ref_004_w2aab2b8c23b1b7b1ab1ab4Aa","doi-asserted-by":"crossref","unstructured":"[4] P. Gill, M. Schapira, and S. Goldberg. Let the market drive deployment: a strategy for transitioning to BGP security. In SIGCOMM\u201911, pages 14\u201325. ACM, 2011.","DOI":"10.1145\/2043164.2018439"},{"key":"2021040814264414804_j_popets-2017-0033_ref_005_w2aab2b8c23b1b7b1ab1ab5Aa","doi-asserted-by":"crossref","unstructured":"[5] O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In STOC\u201987, pages 218\u2013229. ACM, 1987.","DOI":"10.1145\/28395.28420"},{"key":"2021040814264414804_j_popets-2017-0033_ref_006_w2aab2b8c23b1b7b1ab1ab6Aa","doi-asserted-by":"crossref","unstructured":"[6] D. Demmler, T. Schneider, and M. Zohner. ABY \u2013 a framework for efficient mixed-protocol secure two-party computation. In NDSS\u201915. The Internet Society, 2015. Code: https:\/\/github.com\/encryptogroup\/ABY.","DOI":"10.14722\/ndss.2015.23113"},{"key":"2021040814264414804_j_popets-2017-0033_ref_007_w2aab2b8c23b1b7b1ab1ab7Aa","doi-asserted-by":"crossref","unstructured":"[7] C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian. Delayed internet routing convergence. SIGCOMM\u201900, 30(4):175\u2013187, 2000.","DOI":"10.1145\/347057.347428"},{"key":"2021040814264414804_j_popets-2017-0033_ref_008_w2aab2b8c23b1b7b1ab1ab8Aa","doi-asserted-by":"crossref","unstructured":"[8] B. Zhang, D. Massey, and L. Zhang. Destination reachability and BGP convergence time [border gateway routing protocol]. In GLOBECOM\u201904, volume 3, pages 1383\u20131389. IEEE, 2004.","DOI":"10.1109\/GLOCOM.2004.1378211"},{"key":"2021040814264414804_j_popets-2017-0033_ref_009_w2aab2b8c23b1b7b1ab1ab9Aa","doi-asserted-by":"crossref","unstructured":"[9] R. Oliveira, B. Zhang, D. Pei, and L. Zhang. Quantifying path exploration in the internet. IEEE\/ACM Transactions on Networking, 17(2):445\u2013458, 2009.","DOI":"10.1109\/TNET.2009.2016390"},{"key":"2021040814264414804_j_popets-2017-0033_ref_010_w2aab2b8c23b1b7b1ab1ac10Aa","unstructured":"[10] N. Kushman, S. Kandula, and D. Katabi. Can you hear me now?!: It must be BGP. SIGCOMM\u201907, 37(2):75\u201384, 2007."},{"key":"2021040814264414804_j_popets-2017-0033_ref_011_w2aab2b8c23b1b7b1ab1ac11Aa","doi-asserted-by":"crossref","unstructured":"[11] L. Gao and J. Rexford. Stable Internet routing without global coordination. IEEE\/ACM Transactions on Networking, 9(6):681\u2013692, 2001.","DOI":"10.1109\/90.974523"},{"key":"2021040814264414804_j_popets-2017-0033_ref_012_w2aab2b8c23b1b7b1ab1ac12Aa","doi-asserted-by":"crossref","unstructured":"[12] A. Fabrikant, U. Syed, and J. Rexford. There\u2019s something about MRAI: timing diversity can exponentially worsen BGP convergence. In INFOCOM\u201911, pages 2975\u20132983. IEEE, 2011.","DOI":"10.1109\/INFCOM.2011.5935139"},{"key":"2021040814264414804_j_popets-2017-0033_ref_013_w2aab2b8c23b1b7b1ab1ac13Aa","doi-asserted-by":"crossref","unstructured":"[13] K. R. B. Butler, T. R. Farley, P. McDaniel, and J. Rexford. A survey of BGP security issues and solutions. Proceedings of the IEEE, 98(1):100\u2013122, 2010.","DOI":"10.1109\/JPROC.2009.2034031"},{"key":"2021040814264414804_j_popets-2017-0033_ref_014_w2aab2b8c23b1b7b1ab1ac14Aa","doi-asserted-by":"crossref","unstructured":"[14] M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In STOC\u201988, pages 1\u201310. ACM, 1988.","DOI":"10.1145\/62212.62213"},{"key":"2021040814264414804_j_popets-2017-0033_ref_015_w2aab2b8c23b1b7b1ab1ac15Aa","doi-asserted-by":"crossref","unstructured":"[15] A. Ben-Efraim, Y. Lindell, and E. Omri. Optimizing semihonest secure multiparty computation for the internet. In CCS\u201916, pages 578\u2013590. ACM, 2016.","DOI":"10.1145\/2976749.2978347"},{"key":"2021040814264414804_j_popets-2017-0033_ref_016_w2aab2b8c23b1b7b1ab1ac16Aa","doi-asserted-by":"crossref","unstructured":"[16] W. Henecka and M. Roughan. STRIP: privacy-preserving vector-based routing. In International Conference on Network Protocols (ICNP\u201913), pages 1\u201310. IEEE, 2013.","DOI":"10.1109\/ICNP.2013.6733586"},{"key":"2021040814264414804_j_popets-2017-0033_ref_017_w2aab2b8c23b1b7b1ab1ac17Aa","doi-asserted-by":"crossref","unstructured":"[17] J. Brickell and V. Shmatikov. Privacy-preserving graph algorithms in the semi-honest model. In ASIACRYPT\u201905, volume 3788 of LNCS, pages 236\u2013252. Springer, 2005.","DOI":"10.1007\/11593447_13"},{"key":"2021040814264414804_j_popets-2017-0033_ref_018_w2aab2b8c23b1b7b1ab1ac18Aa","doi-asserted-by":"crossref","unstructured":"[18] M. Blanton, A. Steele, and M. Alisagari. Data-oblivious graph algorithms for secure computation and outsourcing. In ASIACCS\u201913, pages 207\u2013218. ACM, 2013.","DOI":"10.1145\/2484313.2484341"},{"key":"2021040814264414804_j_popets-2017-0033_ref_019_w2aab2b8c23b1b7b1ab1ac19Aa","unstructured":"[19] H. Carter, B. Mood, P. Traynor, and K. Butler. Secure outsourced garbled circuit evaluation for mobile phones. In USENIX Security\u201913, pages 289\u2013304. USENIX, 2013."},{"key":"2021040814264414804_j_popets-2017-0033_ref_020_w2aab2b8c23b1b7b1ab1ac20Aa","doi-asserted-by":"crossref","unstructured":"[20] C. Liu, X. Shaun Wang, K. Nayak, Y. Huang, and E. Shi. ObliVM: A programming framework for secure computation. In S&P\u201915, pages 359\u2013376. IEEE, 2015.","DOI":"10.1109\/SP.2015.29"},{"key":"2021040814264414804_j_popets-2017-0033_ref_021_w2aab2b8c23b1b7b1ab1ac21Aa","doi-asserted-by":"crossref","unstructured":"[21] A. C. Yao. How to generate and exchange secrets. In FOCS\u201986, pages 162\u2013167. IEEE, 1986.","DOI":"10.1109\/SFCS.1986.25"},{"key":"2021040814264414804_j_popets-2017-0033_ref_022_w2aab2b8c23b1b7b1ab1ac22Aa","unstructured":"[22] D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay -secure two-party computation system. In USENIX Security\u201904, pages 287\u2013302. USENIX, 2004."},{"key":"2021040814264414804_j_popets-2017-0033_ref_023_w2aab2b8c23b1b7b1ab1ac23Aa","doi-asserted-by":"crossref","unstructured":"[23] D. Bogdanov, S. Laur, and J. Willemson. Sharemind: A framework for fast privacy-preserving computations. In ESORICS\u2019 08, volume 5283 of LNCS, pages 192\u2013206. Springer, 2008.","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"2021040814264414804_j_popets-2017-0033_ref_024_w2aab2b8c23b1b7b1ab1ac24Aa","unstructured":"[24] Y. Huang, D. Evans, J. Katz, and L. Malka. Faster secure two-party computation using garbled circuits. In USENIX Security\u201911, pages 539\u2013554. USENIX, 2011."},{"key":"2021040814264414804_j_popets-2017-0033_ref_025_w2aab2b8c23b1b7b1ab1ac25Aa","doi-asserted-by":"crossref","unstructured":"[25] S. G. Choi, K.-W. Hwang, J. Katz, T. Malkin, and D. Rubenstein. Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces. In CT-RSA\u201912, volume 7178 of LNCS, pages 416\u2013432. Springer, 2012.","DOI":"10.1007\/978-3-642-27954-6_26"},{"key":"2021040814264414804_j_popets-2017-0033_ref_026_w2aab2b8c23b1b7b1ab1ac26Aa","doi-asserted-by":"crossref","unstructured":"[26] P. Bogetoft, D. L. Christensen, I. Damg\u00e5rd, M. Geisler, T. Jakobsen, M. Kr\u00f8igaard, J. D. Nielsen, J. B. Nielsen, K. Nielsen, J. Pagter, M. Schwartzbach, and T. Toft. Secure multiparty computation goes live. In FC\u201909, volume 5628 of LNCS, pages 325\u2013343. Springer, 2009.","DOI":"10.1007\/978-3-642-03549-4_20"},{"key":"2021040814264414804_j_popets-2017-0033_ref_027_w2aab2b8c23b1b7b1ab1ac27Aa","doi-asserted-by":"crossref","unstructured":"[27] D. Bogdanov, M. J\u00f5emets, S. Siim, and M. Vaht. How the Estonian tax and customs board evaluated a tax fraud detection system based on secure multi-party computation. In FC\u201915, volume 8975 of LNCS, pages 227\u2013234. Springer, 2015.","DOI":"10.1007\/978-3-662-47854-7_14"},{"key":"2021040814264414804_j_popets-2017-0033_ref_028_w2aab2b8c23b1b7b1ab1ac28Aa","doi-asserted-by":"crossref","unstructured":"[28] Y. Ishai, J. Kilian, K. Nissim, and E. Petrank. Extending oblivious transfers efficiently. In CRYPTO\u201903, volume 2729 of LNCS, pages 145\u2013161. Springer, 2003.","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"2021040814264414804_j_popets-2017-0033_ref_029_w2aab2b8c23b1b7b1ab1ac29Aa","doi-asserted-by":"crossref","unstructured":"[29] G. Asharov, Y. Lindell, T. Schneider, and M. Zohner. More efficient oblivious transfer and extensions for faster secure computation. In CCS\u201913, pages 535\u2013548. ACM, 2013.","DOI":"10.1145\/2508859.2516738"},{"key":"2021040814264414804_j_popets-2017-0033_ref_030_w2aab2b8c23b1b7b1ab1ac30Aa","doi-asserted-by":"crossref","unstructured":"[30] T. Griffin, F. Shepherd, and G. Wilfong. The stable paths problem and interdomain routing. IEEE\/ACM Transactions on Networking, 10(2):232\u2013243, 2002.","DOI":"10.1109\/90.993304"},{"key":"2021040814264414804_j_popets-2017-0033_ref_031_w2aab2b8c23b1b7b1ab1ac31Aa","unstructured":"[31] P. Gill, M. Schapira, and S. Goldberg. Modeling on quicksand: dealing with the scarcity of ground truth in interdomain routing data. Computer Communication Review, 42(1):40\u201346, 2012."},{"key":"2021040814264414804_j_popets-2017-0033_ref_032_w2aab2b8c23b1b7b1ab1ac32Aa","doi-asserted-by":"crossref","unstructured":"[32] S. Goldberg, M. Schapira, P. Hummon, and J. Rexford. How secure are secure interdomain routing protocols. In SIGCOMM\u201910, pages 87\u201398. ACM, 2010.","DOI":"10.1145\/1851275.1851195"},{"key":"2021040814264414804_j_popets-2017-0033_ref_033_w2aab2b8c23b1b7b1ab1ac33Aa","unstructured":"[33] The CAIDA AS relationships datasets. http:\/\/www.caida.org\/data\/as-relationships\/."},{"key":"2021040814264414804_j_popets-2017-0033_ref_034_w2aab2b8c23b1b7b1ab1ac34Aa","unstructured":"[34] GeoLite data created by MaxMind. http:\/\/dev.maxmind.com\/geoip\/."},{"key":"2021040814264414804_j_popets-2017-0033_ref_035_w2aab2b8c23b1b7b1ab1ac35Aa","doi-asserted-by":"crossref","unstructured":"[35] J. Boyar, R. Peralta, and D. Pochuev. On the multiplicative complexity of boolean functions over the basis (\u2227, \u2295, 1). Theoretical Computer Science, 235(1):43\u201357, 2000.","DOI":"10.1016\/S0304-3975(99)00182-6"},{"key":"2021040814264414804_j_popets-2017-0033_ref_036_w2aab2b8c23b1b7b1ab1ac36Aa","doi-asserted-by":"crossref","unstructured":"[36] V. Kolesnikov, A.-R. Sadeghi, and T. Schneider. Improved garbled circuit building blocks and applications to auctions and computing minima. In CANS\u201909, volume 5888 of LNCS, pages 1\u201320. Springer, 2009.","DOI":"10.1007\/978-3-642-10433-6_1"},{"key":"2021040814264414804_j_popets-2017-0033_ref_037_w2aab2b8c23b1b7b1ab1ac37Aa","doi-asserted-by":"crossref","unstructured":"[37] V. Kolesnikov and T. Schneider. Improved garbled circuit: Free XOR gates and applications. In ICALP\u201908, volume 5126 of LNCS, pages 486\u2013498. Springer, 2008.","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"2021040814264414804_j_popets-2017-0033_ref_038_w2aab2b8c23b1b7b1ab1ac38Aa","doi-asserted-by":"crossref","unstructured":"[38] T. Schneider and M. Zohner. GMW vs. Yao? Efficient secure two-party computation with low depth circuits. In FC\u201913, volume 7859 of LNCS, pages 275\u2013292. Springer, 2013.","DOI":"10.1007\/978-3-642-39884-1_23"},{"key":"2021040814264414804_j_popets-2017-0033_ref_039_w2aab2b8c23b1b7b1ab1ac39Aa","unstructured":"[39] O. Goldreich. The Foundations of Cryptography - volume 2, Basic Applications. Cambridge University Press, 2004."},{"key":"2021040814264414804_j_popets-2017-0033_ref_040_w2aab2b8c23b1b7b1ab1ac40Aa","doi-asserted-by":"crossref","unstructured":"[40] J. B. Nielsen, P. S. Nordholt, C. Orlandi, and S. S. Burra. A new approach to practical active-secure two-party computation. In CRYPTO\u201912, volume 7417 of LNCS, pages 681\u2013700. Springer, 2012.","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"2021040814264414804_j_popets-2017-0033_ref_041_w2aab2b8c23b1b7b1ab1ac41Aa","doi-asserted-by":"crossref","unstructured":"[41] J. B. Nielsen, T. Schneider, and R. Trifiletti. Constant round maliciously secure 2PC with function-independent preprocessing using LEGO. In NDSS\u201917. The Internet Society, 2017.","DOI":"10.14722\/ndss.2017.23075"},{"key":"2021040814264414804_j_popets-2017-0033_ref_042_w2aab2b8c23b1b7b1ab1ac42Aa","doi-asserted-by":"crossref","unstructured":"[42] Y. Aumann and Y. Lindell. Security against covert adversaries: Efficient protocols for realistic adversaries. In TCC\u201907, volume 4392 of LNCS, pages 137\u2013156. Springer, 2007.","DOI":"10.1007\/978-3-540-70936-7_8"},{"key":"2021040814264414804_j_popets-2017-0033_ref_043_w2aab2b8c23b1b7b1ab1ac43Aa","doi-asserted-by":"crossref","unstructured":"[43] I. Damg\u00e5rd, M. Geisler, and J. B. Nielsen. From passive to covert security at low cost. In TCC\u201910, volume 5978 of LNCS, pages 128\u2013145. Springer, 2010.","DOI":"10.1007\/978-3-642-11799-2_9"},{"key":"2021040814264414804_j_popets-2017-0033_ref_044_w2aab2b8c23b1b7b1ab1ac44Aa","doi-asserted-by":"crossref","unstructured":"[44] G. Asharov and C. Orlandi. Calling out cheaters: Covert security with public verifiability. In ASIACRYPT\u201912, volume 7658 of LNCS, pages 681\u2013698. Springer, 2012.","DOI":"10.1007\/978-3-642-34961-4_41"},{"key":"2021040814264414804_j_popets-2017-0033_ref_045_w2aab2b8c23b1b7b1ab1ac45Aa","doi-asserted-by":"crossref","unstructured":"[45] Vladimir Kolesnikov and Alex J Malozemoff. Public verifiability in the covert model (almost) for free. In ASIACRYPT\u201914, volume 9453 of LNCS, pages 210\u2013235. Springer, 2014.","DOI":"10.1007\/978-3-662-48800-3_9"},{"key":"2021040814264414804_j_popets-2017-0033_ref_046_w2aab2b8c23b1b7b1ab1ac46Aa","doi-asserted-by":"crossref","unstructured":"[46] A. Aly, E. Cuvelier, S. Mawet, O. Pereira, and M. Van Vyve. Securely solving simple combinatorial graph problems. In FC\u201913, volume 7859 of LNCS, pages 239\u2013257. Springer, 2013.","DOI":"10.1007\/978-3-642-39884-1_21"},{"key":"2021040814264414804_j_popets-2017-0033_ref_047_w2aab2b8c23b1b7b1ab1ac47Aa","doi-asserted-by":"crossref","unstructured":"[47] S. Zahur, M. Rosulek, and D. Evans. Two halves make a whole: Reducing data transfer in garbled circuits using half gates. In EUROCRYPT\u201915, volume 9057 of LNCS, pages 220\u2013250. Springer, 2015.","DOI":"10.1007\/978-3-662-46803-6_8"},{"key":"2021040814264414804_j_popets-2017-0033_ref_048_w2aab2b8c23b1b7b1ab1ac48Aa","doi-asserted-by":"crossref","unstructured":"[48] M. Bellare, V. Hoang, S. Keelveedhi, and P. Rogaway. Efficient garbling from a fixed-key blockcipher. In S&P\u201913, pages 478\u2013492. IEEE, 2013.","DOI":"10.1109\/SP.2013.39"}],"container-title":["Proceedings on Privacy Enhancing Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/content.sciendo.com\/view\/journals\/popets\/2017\/3\/article-p147.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.sciendo.com\/article\/10.1515\/popets-2017-0033","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T16:55:22Z","timestamp":1750524922000},"score":1,"resource":{"primary":{"URL":"https:\/\/petsymposium.org\/popets\/2017\/popets-2017-0033.php"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,1]]},"references-count":48,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2017,7,6]]},"published-print":{"date-parts":[[2017,7,1]]}},"alternative-id":["10.1515\/popets-2017-0033"],"URL":"https:\/\/doi.org\/10.1515\/popets-2017-0033","relation":{},"ISSN":["2299-0984"],"issn-type":[{"value":"2299-0984","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,1]]}}}