{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:29:13Z","timestamp":1740137353212,"version":"3.37.3"},"reference-count":79,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T00:00:00Z","timestamp":1646611200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T00:00:00Z","timestamp":1646611200000},"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":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10207-022-00583-w","type":"journal-article","created":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T07:02:39Z","timestamp":1646636559000},"page":"777-797","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Developing non-interactive MPC with trusted hardware for enhanced security"],"prefix":"10.1007","volume":"21","author":[{"given":"Ryan","family":"Karl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hannah","family":"Burchfield","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Takeshita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5873-0629","authenticated-orcid":false,"given":"Taeho","family":"Jung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,7]]},"reference":[{"key":"583_CR1","doi-asserted-by":"crossref","unstructured":"Ananth, P., Choudhuri, A.R., Jain, A.: A new approach to round-optimal secure multiparty computation. In: CRYPTO, pp. 468\u2013499. Springer (2017)","DOI":"10.1007\/978-3-319-63688-7_16"},{"key":"583_CR2","unstructured":"Apuzzo, M.: How Strongmen Turned Interpol into Their Personal Weapon. The New York Times (2019)"},{"key":"583_CR3","doi-asserted-by":"crossref","unstructured":"Arthur, W., Challener, D.: A practical guide to TPM 2.0: using the Trusted Platform Module in the new age of security. Apress (2015)","DOI":"10.1007\/978-1-4302-6584-9"},{"key":"583_CR4","doi-asserted-by":"crossref","unstructured":"Aumann, Y., Lindell, Y.: Security against covert adversaries: efficient protocols for realistic adversaries. In: TCC, pp. 137\u2013156. Springer (2007)","DOI":"10.1007\/978-3-540-70936-7_8"},{"key":"583_CR5","doi-asserted-by":"crossref","unstructured":"Badrinarayanan, S., Jain, A., Ostrovsky, R., Visconti, I.: Non-interactive secure computation from one-way functions (2018)","DOI":"10.1007\/978-3-030-03332-3_5"},{"key":"583_CR6","doi-asserted-by":"crossref","unstructured":"Bahmani, R., Barbosa, M., Brasser, F., Portela, B., Sadeghi, AR., Scerri, G., Warinschi, B.: Secure multiparty computation from sgx. In: International Conference on Financial Cryptography and Data Security, pp. 477\u2013497. Springer (2017)","DOI":"10.1007\/978-3-319-70972-7_27"},{"key":"583_CR7","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: STOC, pp. 503\u2013513. ACM (1990)","DOI":"10.1145\/100216.100287"},{"key":"583_CR8","doi-asserted-by":"crossref","unstructured":"Beimel, A., Gabizon, A., Ishai, Y., Kushilevitz, E., Meldgaard, S., Paskin-Cherniavsky, A.: Non-interactive secure multiparty computation. In: CRYPTO, pp. 387\u2013404. Springer (2014)","DOI":"10.1007\/978-3-662-44381-1_22"},{"key":"583_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Efraim, A., Lindell, Y., Omri, E.: Optimizing semi-honest secure multiparty computation for the internet. In: CCS, pp. 578\u2013590. ACM (2016)","DOI":"10.1145\/2976749.2978347"},{"key":"583_CR10","doi-asserted-by":"crossref","unstructured":"Benhamouda, F., Krawczyk, H., Rabin, T.: Robust non-interactive multiparty computation against constant-size collusion. In: CRYPTO, pp. 391\u2013419. Springer (2017)","DOI":"10.1007\/978-3-319-63688-7_13"},{"key":"583_CR11","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Group-based secure computation: Optimizing rounds, communication, and computation. In: Eurocrypt, pp. 163\u2013193. Springer (2017)","DOI":"10.1007\/978-3-319-56614-6_6"},{"key":"583_CR12","doi-asserted-by":"crossref","unstructured":"Brassard, G., Cr\u00e9peau, C., Robert, J.M.: All-or-nothing disclosure of secrets. In: Eurocrypt, pp. 234\u2013238. Springer (1986)","DOI":"10.1007\/3-540-47721-7_17"},{"key":"583_CR13","unstructured":"Brodkin, J.: Satellite internet faster than advertised, but latency still awful. Ars Technica (2013)"},{"key":"583_CR14","doi-asserted-by":"crossref","unstructured":"Cachin, C., Camenisch, J., Kilian, J., M\u00fcller, J.: One-round secure computation and secure autonomous mobile agents. In: ICALP, pp. 512\u2013523. Springer (2000)","DOI":"10.1007\/3-540-45022-X_43"},{"key":"583_CR15","doi-asserted-by":"crossref","unstructured":"Choi, S.G., Hwang, K.W., Katz, J., Malkin, T., Rubenstein, D.: Secure multi-party computation of boolean circuits with applications to privacy in on-line marketplaces. In: CT-RSA, pp. 416\u2013432. Springer (2012)","DOI":"10.1007\/978-3-642-27954-6_26"},{"key":"583_CR16","doi-asserted-by":"crossref","unstructured":"Choudhuri, A.R., Green, M., Jain, A., Kaptchuk, G., Miers, I.: Fairness in an unfair world: Fair multiparty computation from public bulletin boards. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 719\u2013728 (2017)","DOI":"10.1145\/3133956.3134092"},{"key":"583_CR17","doi-asserted-by":"crossref","unstructured":"Coaffee, J.: Terrorism, Risk and the Global City: Towards Urban Resilience. Routledge (2016)","DOI":"10.4324\/9781315612126"},{"issue":"4","key":"583_CR18","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1007\/s00145-016-9245-5","volume":"30","author":"R Cohen","year":"2017","unstructured":"Cohen, R., Lindell, Y.: Fairness versus guaranteed output delivery in secure multiparty computation. J. Cryptol. 30(4), 1157\u20131186 (2017)","journal-title":"J. Cryptol."},{"key":"583_CR19","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: CRYPTO, pp. 643\u2013662. Springer (2012)","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"583_CR20","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., Smart, N.P.: Practical covertly secure mpc for dishonest majority\u2013or: breaking the spdz limits. In: Esorics, pp. 1\u201318. Springer (2013)","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"583_CR21","doi-asserted-by":"crossref","unstructured":"Garg, S., Srinivasan, A.: Garbled protocols and two-round mpc from bilinear maps. In: FOCS, pp. 588\u2013599. IEEE (2017)","DOI":"10.1109\/FOCS.2017.60"},{"key":"583_CR22","doi-asserted-by":"crossref","unstructured":"Garg, S., Srinivasan, A.: Two-round multiparty secure computation from minimal assumptions. In: Eurocrypt, pp. 468\u2013499. Springer (2018)","DOI":"10.1007\/978-3-319-78375-8_16"},{"key":"583_CR23","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M.: Two-round secure mpc from indistinguishability obfuscation. In: TCC, , pp. 74\u201394. Springer (2014)","DOI":"10.1007\/978-3-642-54242-8_4"},{"key":"583_CR24","doi-asserted-by":"crossref","unstructured":"Garg, S., Mukherjee, P., Pandey, O., Polychroniadou, A.: The exact round complexity of secure computation. In: Eurocrypt, pp. 448\u2013476. Springer (2016)","DOI":"10.1007\/978-3-662-49896-5_16"},{"key":"583_CR25","doi-asserted-by":"crossref","unstructured":"Garg, S., Miao, P., Srinivasan, A.: Two-round multiparty secure computation minimizing public key operations. In: CRYPTO, pp. 273\u2013301, Springer (2018)","DOI":"10.1007\/978-3-319-96878-0_10"},{"key":"583_CR26","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: On 2-round secure multiparty computation. In: CRYPTO, pp. 178\u2013193, Springer (2002)","DOI":"10.1007\/3-540-45708-9_12"},{"key":"583_CR27","unstructured":"Gilsinan, K.: Interpol at 100: Does the World\u2019s Police Force Work? The Atlantic (2014)"},{"key":"583_CR28","unstructured":"Gladman, W.H.B., Moxham ea, J.: MPIR: Multiple Precision Integers and Rationals (2015)"},{"key":"583_CR29","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: One-time programs. In: Annual International Cryptology Conference, pp. 39\u201356. Springer (2008)","DOI":"10.1007\/978-3-540-85174-5_3"},{"key":"583_CR30","unstructured":"Goodin, D.: Ex-army man cracks popular security chip. The Register (2010)"},{"key":"583_CR31","unstructured":"Goodin, D.: Millions of high-security crypto keys crippled by newly discovered flaw. Ars Technica (2017)"},{"key":"583_CR32","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Liu, F.H., Shi, E.: Constant-round mpc with fairness and guarantee of output delivery. In: CRYPTO, pp. 63\u201382. Springer (2015)","DOI":"10.1007\/978-3-662-48000-7_4"},{"key":"583_CR33","doi-asserted-by":"crossref","unstructured":"Goyal, V., Mohassel, P., Smith, A.: Efficient two party and multi party computation against covert adversaries. In: Eurocrypt, pp. 289\u2013306. Springer (2008)","DOI":"10.1007\/978-3-540-78967-3_17"},{"key":"583_CR34","doi-asserted-by":"crossref","unstructured":"Goyal, V., Ishai, Y., Sahai, A., Venkatesan, R., Wadia, A.: Founding cryptography on tamper-proof hardware tokens. In: TCC, pp. 308\u2013326. Springer (2010)","DOI":"10.1007\/978-3-642-11799-2_19"},{"key":"583_CR35","doi-asserted-by":"crossref","unstructured":"Gunupudi, V., Tate, S.R.: Generalized non-interactive oblivious transfer using count-limited objects with applications to secure mobile agents. In: FC, pp. 98\u2013112. Springer (2008)","DOI":"10.1007\/978-3-540-85230-8_8"},{"key":"583_CR36","doi-asserted-by":"crossref","unstructured":"Halevi, S., Lindell, Y., Pinkas, B.: Secure computation on the web: computing without simultaneous interaction. In: CRYPTO, pp. 132\u2013150. Springer (2011)","DOI":"10.1007\/978-3-642-22792-9_8"},{"key":"583_CR37","doi-asserted-by":"crossref","unstructured":"Halevi, S., Ishai, Y., Jain, A., Kushilevitz, E., Rabin, T.: Secure multiparty computation with general interaction patterns. In: ITCS, pp. 157\u2013168. ACM (2016)","DOI":"10.1145\/2840728.2840760"},{"key":"583_CR38","doi-asserted-by":"crossref","unstructured":"Halevi, S., Ishai, Y., Jain, A., Komargodski, I., Sahai, A., Yogev, E.: Non-interactive multiparty computation without correlated randomness. In: ASIACRYPT, pp. 181\u2013211. Springer (2017)","DOI":"10.1007\/978-3-319-70700-6_7"},{"key":"583_CR39","doi-asserted-by":"crossref","unstructured":"Halevi, S., Hazay, C., Polychroniadou, A., Venkitasubramaniam, M.: Round-optimal secure multi-party computation. In: CRYPTO, pp. 488\u2013520. Springer (2018)","DOI":"10.1007\/978-3-319-96881-0_17"},{"key":"583_CR40","doi-asserted-by":"crossref","unstructured":"Halevi, S., Ishai, Y., Kushilevitz, E., Rabin, T.: Best possible information-theoretic mpc. In: Theory of Cryptography Conference, pp. 255\u2013281. Springer (2018)","DOI":"10.1007\/978-3-030-03810-6_10"},{"key":"583_CR41","doi-asserted-by":"crossref","unstructured":"Hastings, M., Hemenway, B., Noble, D., Zdancewic, S.: Sok: General purpose compilers for secure multi-party computation. In: SoK: General Purpose Compilers for Secure Multi-Party Computation. IEEE (2019)","DOI":"10.1109\/SP.2019.00028"},{"key":"583_CR42","doi-asserted-by":"crossref","unstructured":"Hazay, C., Polychroniadou, A., Venkitasubramaniam, M.: Composable security in the tamper-proof hardware model under minimal complexity. In: TCC, pp. 367\u2013399. Springer (2016)","DOI":"10.1007\/978-3-662-53641-4_15"},{"key":"583_CR43","volume-title":"Achieving higher-fidelity conjunction analyses using cryptography to improve information sharing","author":"B Hemenway","year":"2014","unstructured":"Hemenway, B., Welser, W., IV., Baiocchi, D.: Achieving higher-fidelity conjunction analyses using cryptography to improve information sharing. RAND PROJECT AIR FORCE SANTA MONICA CA, Tech rep (2014)"},{"key":"583_CR44","doi-asserted-by":"crossref","unstructured":"Hemenway, B., Lu, S., Ostrovsky, R., Welser\u00a0Iv, W.: High-precision secure computation of satellite collision probabilities. In: International Conference on Security and Cryptography for Networks, pp. 169\u2013187. Springer (2016)","DOI":"10.1007\/978-3-319-44618-9_9"},{"key":"583_CR45","doi-asserted-by":"publisher","first-page":"52","DOI":"10.2307\/3183356","volume":"128","author":"T Homer-Dixon","year":"2002","unstructured":"Homer-Dixon, T.: The rise of complex terrorism. Foreign Policy 128, 52 (2002)","journal-title":"Foreign Policy"},{"key":"583_CR46","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.isatra.2018.09.020","volume":"84","author":"Q Hu","year":"2019","unstructured":"Hu, Q., Xie, J., Wang, C.: Dynamic path planning and trajectory tracking using mpc for satellite with collision avoidance. ISA Trans. 84, 128\u2013141 (2019)","journal-title":"ISA Trans."},{"key":"583_CR47","doi-asserted-by":"crossref","unstructured":"Irvine, C.E., Levitt, K.: Trusted hardware: can it be trustworthy? In: 2007 44th ACM\/IEEE Design Automation Conference, pp. 1\u20134. IEEE (2007)","DOI":"10.1109\/DAC.2007.375041"},{"key":"583_CR48","doi-asserted-by":"crossref","unstructured":"Ishai, Y,. Kushilevitz, E., Ostrovsky, R., Prabhakaran, M., Sahai, A.: Efficient non-interactive secure computation. In: Eurocrypt, pp. 406\u2013425. Springer (2011)","DOI":"10.1007\/978-3-642-20465-4_23"},{"issue":"6","key":"583_CR49","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10207-014-0271-8","volume":"14","author":"L Kamm","year":"2015","unstructured":"Kamm, L., Willemson, J.: Secure floating point arithmetic and private satellite collision analysis. Int. J. Inf. Sec. 14(6), 531\u2013548 (2015)","journal-title":"Int. J. Inf. Sec."},{"key":"583_CR50","doi-asserted-by":"crossref","unstructured":"Kaptchuk, G.: Giving state to the stateless: augmenting trustworthy computation with ledgers. In: NDSS (2019)","DOI":"10.14722\/ndss.2019.23060"},{"key":"583_CR51","doi-asserted-by":"crossref","unstructured":"Karl, R., Burchfield, T., Takeshi, J., Jung, T.: Non-interactive mpc with trusted hardware secure against residual function attacks. In: SecureComm (2019)","DOI":"10.1007\/978-3-030-37231-6_25"},{"key":"583_CR52","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/55483.55484","volume":"17","author":"P Karn","year":"1987","unstructured":"Karn, P., Partridge, C.: Improving round-trip time estimates in reliable transport protocols. SIGCOMM, ACM 17, 2\u20137 (1987)","journal-title":"SIGCOMM, ACM"},{"key":"583_CR53","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: Free xor gates and applications. In: ICALP, pp. 486\u2013498. Springer (2008)","DOI":"10.1007\/978-3-540-70583-3_40"},{"issue":"4","key":"583_CR54","first-page":"34","volume":"41","author":"SH Leader","year":"1997","unstructured":"Leader, S.H.: The rise of terrorism. Secur. Manag. 41(4), 34\u20139 (1997)","journal-title":"Secur. Manag."},{"issue":"2","key":"583_CR55","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/s00145-015-9198-0","volume":"29","author":"Y Lindell","year":"2016","unstructured":"Lindell, Y.: Fast cut-and-choose-based protocols for malicious and covert adversaries. J. Cryptol. 29(2), 456\u2013490 (2016)","journal-title":"J. Cryptol."},{"key":"583_CR56","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Pinkas, B., Smart, N.P., Yanai, A.: Efficient constant round multi-party computation combining bmr and spdz. In: CRYPTO, pp. 319\u2013338. Springer (2015)","DOI":"10.1007\/978-3-662-48000-7_16"},{"key":"583_CR57","doi-asserted-by":"crossref","unstructured":"Makkes, M.X., Uta, A., Das, R.B., Bozdog, V.N., Bal, H. P$$\\wedge $$ 2-swan: Real-time privacy preserving computation for iot ecosystems. In: 2017 IEEE 1st International Conference on Fog and Edge Computing (ICFEC), pp. 1\u201310. IEEE (2017)","DOI":"10.1109\/ICFEC.2017.11"},{"key":"583_CR58","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.comnet.2016.03.011","volume":"102","author":"L Malina","year":"2016","unstructured":"Malina, L., Hajny, J., Fujdiak, R., Hosek, J.: On perspective of security and privacy-preserving solutions in the internet of things. Comput. Netw. 102, 83\u201395 (2016)","journal-title":"Comput. Netw."},{"key":"583_CR59","unstructured":"Marochko, A.: Tss.msr project description (2019) https:\/\/github.com\/Microsoft\/TSS.MSR"},{"key":"583_CR60","doi-asserted-by":"crossref","unstructured":"Mathis, M., Semke, J., Mahdavi, J., Ott, T.: The macroscopic behavior of the tcp congestion avoidance algorithm, pp. 67\u201382. SIGCOMM (1997)","DOI":"10.1145\/263932.264023"},{"key":"583_CR61","doi-asserted-by":"crossref","unstructured":"Mood, B., Gupta, D., Carter, H., Butler, K., Traynor, P.: Frigate: a validated, extensible, and efficient compiler and interpreter for secure computation. In: EuroS&P, pp. 112\u2013127. IEEE (2016)","DOI":"10.1109\/EuroSP.2016.20"},{"key":"583_CR62","first-page":"735","volume":"9666","author":"P Mukherjee","year":"2016","unstructured":"Mukherjee, P., Wichs, D.: Two round multiparty computation via multi-key fhe. Eurocrypt 9666, 735\u2013763 (2016)","journal-title":"Eurocrypt"},{"key":"583_CR63","doi-asserted-by":"crossref","unstructured":"Obana, S., Yoshida, M.: An efficient construction of non-interactive secure multiparty computation. In: CANS, pp. 604\u2013614. Springer (2016)","DOI":"10.1007\/978-3-319-48965-0_39"},{"key":"583_CR64","unstructured":"Oberhaus, D.: Spacex is banking on satellite internet. maybe it shouldn\u2019t. Wired (2019)"},{"issue":"4","key":"583_CR65","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1145\/285243.285291","volume":"28","author":"J Padhye","year":"1998","unstructured":"Padhye, J., Firoiu, V., Towsley, D., Kurose, J.: Modeling tcp throughput: a simple model and its empirical validation. SIGCOMM 28(4), 303\u2013314 (1998)","journal-title":"SIGCOMM"},{"key":"583_CR66","doi-asserted-by":"crossref","unstructured":"Parikh, N., Sundaresan, N.: Scalable and near real-time burst detection from ecommerce queries. In: ACM SIGKDD, ACM, KDD \u201908, pp. 972\u2013980 (2008)","DOI":"10.1145\/1401890.1402006"},{"key":"583_CR67","doi-asserted-by":"crossref","unstructured":"Pass, R., Shi, E., Tramer, F.: Formal abstractions for attested execution secure processors. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 260\u2013289. Springer (2017)","DOI":"10.1007\/978-3-319-56620-7_10"},{"key":"583_CR68","unstructured":"Rabin, M.: How to Exchange Secrets with Oblivious Transfer. Harvard University Technical Report (1981)"},{"key":"583_CR69","unstructured":"Reese, H.: 1 in 10 Vehicles will be Autonomous by 2030. Tech Republic (2020)"},{"key":"583_CR70","unstructured":"Russell, M.A.: Mining the social web. \u201cO\u2019Reilly Media, Inc.\u201d (2011)"},{"key":"583_CR71","doi-asserted-by":"crossref","unstructured":"Salyers, D.C., Striegel, A.D., Poellabauer, C.: Wireless reliability: rethinking 802.11 packet loss. In: WoWMoM, pp 1\u20134. IEEE (2008)","DOI":"10.1109\/WOWMOM.2008.4594875"},{"issue":"11","key":"583_CR72","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"583_CR73","unstructured":"Tao, C.: Clumsy (2016). https:\/\/github.com\/jagt\/clumsy"},{"key":"583_CR74","unstructured":"The OpenSSL Project.: OpenSSL: The open source toolkit for SSL\/TLS (2003). www.openssl.org"},{"key":"583_CR75","unstructured":"Wang, X.: A new paradigm for practical maliciously secure multi-party computation (2018)"},{"key":"583_CR76","doi-asserted-by":"crossref","unstructured":"Wang, X., Ranellucci, S., Katz, J.: Authenticated garbling and efficient maliciously secure two-party computation. In: CCS, pp. 21\u201337. ACM (2017)","DOI":"10.1145\/3133956.3134053"},{"key":"583_CR77","doi-asserted-by":"crossref","unstructured":"Wang, X., Ranellucci, S., Katz, J.: Global-scale secure multiparty computation. In: CCS, pp. 39\u201356. ACM (2017)","DOI":"10.1145\/3133956.3133979"},{"key":"583_CR78","unstructured":"Wonder Network Staff.: Global ping statistics (2019). https:\/\/wondernetwork.com\/pings\/Shanghai"},{"issue":"2","key":"583_CR79","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1111\/j.1468-2486.2010.00933.x","volume":"12","author":"D Zartner","year":"2010","unstructured":"Zartner, D.: The rise of transnational crime: International cooperation, state contributions, and the role of the global political economy. Int. Stud. Rev. 12(2), 316\u2013319 (2010)","journal-title":"Int. Stud. Rev."}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-022-00583-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-022-00583-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-022-00583-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T11:56:38Z","timestamp":1659095798000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-022-00583-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,7]]},"references-count":79,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["583"],"URL":"https:\/\/doi.org\/10.1007\/s10207-022-00583-w","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2022,3,7]]},"assertion":[{"value":"7 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}