{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T13:40:12Z","timestamp":1762868412640,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,2,4]],"date-time":"2021-02-04T00:00:00Z","timestamp":1612396800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,4]],"date-time":"2021-02-04T00:00:00Z","timestamp":1612396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["ERC-2015-AdG-IMPaCT"],"award-info":[{"award-number":["ERC-2015-AdG-IMPaCT"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-19-C-0502"],"award-info":[{"award-number":["FA8750-19-C-0502"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011039","name":"Intelligence Advanced Research Projects Activity","doi-asserted-by":"publisher","award":["2019-1902070006"],"award-info":[{"award-number":["2019-1902070006"]}],"id":[{"id":"10.13039\/100011039","id-type":"DOI","asserted-by":"publisher"}]},{"name":"FWO","award":["GOH9718N"],"award-info":[{"award-number":["GOH9718N"]}]},{"name":"Cybersecurity Research Flanders","award":["VR20192203"],"award-info":[{"award-number":["VR20192203"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10207-021-00539-6","type":"journal-article","created":{"date-parts":[[2021,2,4]],"date-time":"2021-02-04T07:03:05Z","timestamp":1612422185000},"page":"879-894","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Thresholdizing HashEdDSA: MPC to the Rescue"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4365-1845","authenticated-orcid":false,"given":"Charlotte","family":"Bonte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3567-3304","authenticated-orcid":false,"given":"Nigel P.","family":"Smart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7965-620X","authenticated-orcid":false,"given":"Titouan","family":"Tanguy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,4]]},"reference":[{"key":"539_CR1","unstructured":"Aly, A., Ashur, T., Ben-Sasson, E., Dhooghe, S., Szepieniec, A.: Design of symmetric-key primitives for advanced cryptographic protocols. Cryptology ePrint Archive, Report 2019\/426 (2019). https:\/\/eprint.iacr.org\/2019\/426"},{"key":"539_CR2","doi-asserted-by":"crossref","unstructured":"Araki, T., Barak, A., Furukawa, J., Lichter, T., Lindell, Y., Nof, A., Ohara, K., Watzman, A., Weinstein, O.: Optimized honest-majority MPC for malicious adversaries\u2014breaking the 1 billion-gate per second barrier. In: 2017 IEEE Symposium on Security and Privacy, San Jose, May\u00a022\u201326, pp. 843\u2013862. IEEE Computer Society Press (2017)","DOI":"10.1109\/SP.2017.15"},{"key":"539_CR3","unstructured":"Aly, A., Cong, K., Cozzo, D., Keller, M., Orsini, E., Rotaru, D., Scherer, O., Scholl, P., Smart, N.P., Tanguyu, T., Wood, T.: SCALE and MAMBA documentation, v1.10 (2020)"},{"key":"539_CR4","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Grassi, L., Rechberger, C., Roy, A., Tiessen, T.: MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity. In: Cheon, J.H., Takagi, T. (eds.) Advances in Cryptology\u2014ASIACRYPT\u00a02016, Part\u00a0I, Volume 10031 of Lecture Notes in Computer Science, Hanoi, Vietnam, December\u00a04\u20138, pp. 191\u2013219. Springer, Heidelberg (2016)","DOI":"10.1007\/978-3-662-53887-6_7"},{"key":"539_CR5","unstructured":"Abdelrahaman, A., Orsini, E., Rotaru, D., Smart, N.P., Wood, T.: Zaphod: efficiently combining LSSS and garbled circuits in SCALE. In: Brenner, M., Lepoint, T., Rohloff, K. (eds.) Proceedings of the 7th ACM Workshop on Encrypted Computing and Applied Homomorphic Cryptography, WAHC@CCS 2019, London, Nov 11\u201315, 2019, pp. 33\u201344. ACM (2019)"},{"key":"539_CR6","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: Oswald, E., Fischlin, M. (eds.) Advances in Cryptology\u2014EUROCRYPT\u00a02015, Part\u00a0I, Volume 9056 of Lecture Notes in Computer Science, Sofia, April\u00a026\u201330, pp. 430\u2013454. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"539_CR7","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.-Y.: High-speed high-security signatures. In: Preneel, B., Takagi, T. (eds.) Cryptographic Hardware and Embedded Systems\u2014CHES\u00a02011, Volume 6917 of Lecture Notes in Computer Science, Nara, Sept 28\u2013Oct 1, pp. 124\u2013142. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-23951-9_9"},{"key":"539_CR8","doi-asserted-by":"crossref","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: Paterson, K.G. (ed.) Advances in Cryptology\u2014EUROCRYPT\u00a02011, Volume 6632 of Lecture Notes in Computer Science, Tallinn, May\u00a015\u201319, pp. 169\u2013188. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-20465-4_11"},{"key":"539_CR9","doi-asserted-by":"crossref","unstructured":"Brandao, L.T.A.N., Davidson, M., Vassilev, A.: NIST 8214A (draft): Towards NIST standards for threshold schemes for cryptographic primitives: a preliminary roadmap (2019). https:\/\/csrc.nist.gov\/publications\/detail\/nistir\/8214a\/draft","DOI":"10.6028\/NIST.IR.8214A-draft"},{"key":"539_CR10","unstructured":"Bernstein, D.J., Josefsson, S., Lange, T., Schwabe, P., Yang, B.-Y.: EdDSA for more curves. Cryptology ePrint Archive, Report 2015\/677 (2015). http:\/\/eprint.iacr.org\/2015\/677"},{"key":"539_CR11","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: 20th Annual ACM Symposium on Theory of Computing, Chicago, May\u00a02\u20134, pp. 11\u201319. ACM Press (1988)","DOI":"10.1145\/62212.62214"},{"key":"539_CR12","doi-asserted-by":"crossref","unstructured":"Castagnos, G., Catalano, D., Laguillaumie, F., Savasta, F., Tucker, I.: Bandwidth-efficient threshold EC-DSA. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC\u00a02020: 23rd International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0II, Volume 12111 of Lecture Notes in Computer Science, Edinburgh, May\u00a04\u20137, pp. 266\u2013296. Springer, Heidelberg (2020)","DOI":"10.1007\/978-3-030-45388-6_10"},{"key":"539_CR13","doi-asserted-by":"crossref","unstructured":"Cogliati, B., Dodis, Y., Katz, J., Lee, J., Steinberger, J.P., Thiruvengadam, A., Zhang, Z.: Provable security of (tweakable) block ciphers based on substitution-permutation networks. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology\u2014CRYPTO\u00a02018, Part\u00a0I, Volume 10991 of Lecture Notes in Computer Science, Santa Barbara, Aug\u00a019\u201323, pp. 722\u2013753. Springer, Heidelberg (2018)","DOI":"10.1007\/978-3-319-96884-1_24"},{"key":"539_CR14","doi-asserted-by":"crossref","unstructured":"Chida, K., Genkin, D., Hamada, K., Ikarashi, D., Kikuchi, R., Lindell, Y., Nof A.: Fast large-scale honest-majority MPC for malicious adversaries. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology\u2014CRYPTO\u00a02018, Part\u00a0III, Volume 10993 of Lecture Notes in Computer Science, Santa Barbara, Aug\u00a019\u201323, pp. 34\u201364. Springer, Heidelberg (2018)","DOI":"10.1007\/978-3-319-96878-0_2"},{"key":"539_CR15","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Jakobsen, T.P., Nielsen, J.B., Pagter, J.I., \u00d8stergaard, M.B.: Fast threshold ECDSA with honest majority. In: Galdi, C., Kolesnikov, V. (eds.) SCN 20: 12th International Conference on Security in Communication Networks, Volume 12238 of Lecture Notes in Computer Science, Amalfi, Sept\u00a014\u201316, pp. 382\u2013400. Springer, Heidelberg (2020)","DOI":"10.1007\/978-3-030-57990-6_19"},{"key":"539_CR16","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Koprowski, M.: Practical threshold RSA signatures without a trusted dealer. In: Pfitzmann, B. (ed.) Advances in Cryptology\u2014EUROCRYPT\u00a02001, Volume 2045 of Lecture Notes in Computer Science, Innsbruck, May\u00a06\u201310, pp. 152\u2013165. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-44987-6_10"},{"key":"539_CR17","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A.: Secure two-party threshold ECDSA from ECDSA assumptions. In: 2018 IEEE Symposium on Security and Privacy, San Francisco, May\u00a021\u201323, pp. 980\u2013997. IEEE Computer Society Press (2018)","DOI":"10.1109\/SP.2018.00036"},{"key":"539_CR18","doi-asserted-by":"crossref","unstructured":"Dalskov, A.P.K., Orlandi, C., Keller, M., Shrishak, K., Shulman, H.: Securing DNSSEC keys via threshold ECDSA from generic MPC. In: Chen, L., Li, N., Liang, K., Schneider, S.A. (eds.) ESORICS\u00a02020: 25th European Symposium on Research in Computer Security, Part\u00a0II, Volume 12309 of Lecture Notes in Computer Science, Guildford, Sept\u00a014\u201318, pp. 654\u2013673. Springer, Heidelberg (2020)","DOI":"10.1007\/978-3-030-59013-0_32"},{"key":"539_CR19","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology\u2014CRYPTO\u00a02012, Volume 7417 of Lecture Notes in Computer Science, Santa Barbara, Aug\u00a019\u201323, pp. 643\u2013662. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"539_CR20","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Goldfeder, S.: Fast multiparty threshold ECDSA with fast trustless setup. In: Lie, D., Mannan, M., Backes, M., Wang, X.F. (eds.) ACM CCS 2018: 25th Conference on Computer and Communications Security, Toronto, Oct\u00a015\u201319, pp. 1179\u20131194. ACM Press (2018)","DOI":"10.1145\/3243734.3243859"},{"key":"539_CR21","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Goldfeder, S., Narayanan, A.: Threshold-optimal DSA\/ECDSA signatures and an application to bitcoin wallet security. In: Manulis, M., Sadeghi, A.-R., Schneider, S. (eds.) ACNS 16: 14th International Conference on Applied Cryptography and Network Security, Volume 9696 of Lecture Notes in Computer Science, Guildford, June\u00a019\u201322, pp. 156\u2013174. Springer, Heidelberg (2016)","DOI":"10.1007\/978-3-319-39555-5_9"},{"key":"539_CR22","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust threshold DSS signatures. In: Maurer, U.M. (ed.) Advances in Cryptology\u2014EUROCRYPT\u201996, Volume 1070 of Lecture Notes in Computer Science, Saragossa, May\u00a012\u201316, pp. 354\u2013371. Springer, Heidelberg (1996)","DOI":"10.1007\/3-540-68339-9_31"},{"key":"539_CR23","unstructured":"Grassi, L., Kales, D., Khovratovich, D., Roy, A., Rechberger, C., Schofnegger, M.: Starkad and poseidon: new hash functions for zero knowledge proof systems. Cryptology ePrint Archive, Report 2019\/458 (2019). https:\/\/eprint.iacr.org\/2019\/458"},{"key":"539_CR24","doi-asserted-by":"crossref","unstructured":"Grassi, L., Rechberger, C., Rotaru, D., Scholl, P., Smart, N.P.: MPC-friendly symmetric key primitives. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016: 23rd Conference on Computer and Communications Security, Vienna, Oct\u00a024\u201328, pp. 430\u2013443. ACM Press (2016)","DOI":"10.1145\/2976749.2978332"},{"issue":"1","key":"539_CR25","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.M.: Player simulation and general adversary structures in perfect multiparty computation. J. Cryptol. 13(1), 31\u201360 (2000)","journal-title":"J. Cryptol."},{"key":"539_CR26","doi-asserted-by":"crossref","unstructured":"Hazay, C., Scholl, P., Soria-Vazquez, E.: Low cost constant round MPC combining BMR and oblivious transfer. In: Takagi, T., Peyrin, T. (eds.) Advances in Cryptology\u2014ASIACRYPT\u00a02017, Part\u00a0I, Volume 10624 of Lecture Notes in Computer Science, Hong Kong, Dec 3\u20137, pp. 598\u2013628. Springer, Heidelberg (2017)","DOI":"10.1007\/978-3-319-70694-8_21"},{"key":"539_CR27","doi-asserted-by":"crossref","unstructured":"Keller, M.: MP-SPDZ: a versatile framework for multi-party computation. IACR Cryptology ePrint Archives, vol. 2020, p. 521 (2020)","DOI":"10.1145\/3372297.3417872"},{"key":"539_CR28","doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., Scholl, P.: MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016: 23rd Conference on Computer and Communications Security, Vienna, Oct\u00a024\u201328, pp. 830\u2013842. ACM Press (2016)","DOI":"10.1145\/2976749.2978357"},{"key":"539_CR29","doi-asserted-by":"crossref","unstructured":"Keller, M., Rotaru, D., Smart, N.P., Wood, T.: Reducing communication channels in MPC. In: Catalano, D., De Prisco, R. (eds.) SCN 18: 11th International Conference on Security in Communication Networks, Volume 11035 of Lecture Notes in Computer Science, Amalfi, Sept\u00a05\u20137, pp. 181\u2013199. Springer, Heidelberg (2018)","DOI":"10.1007\/978-3-319-98113-0_10"},{"key":"539_CR30","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Proceedings of Structures in Complexity Theory, pp. 102\u2013111 (1993)"},{"key":"539_CR31","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: Fast secure two-party ECDSA signing. In: Katz, J., Shacham, H. (eds.) Advances in Cryptology\u2014CRYPTO\u00a02017, Part\u00a0II, Volume 10402 of Lecture Notes in Computer Science, Santa Barbara, Aug\u00a020\u201324, pp. 613\u2013644. Springer, Heidelberg (2017)","DOI":"10.1007\/978-3-319-63715-0_21"},{"key":"539_CR32","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Nof, A.: A framework for constructing fast MPC over arithmetic circuits with malicious adversaries and an honest-majority. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017: 24th Conference on Computer and Communications Security, Dallas, Oct 31\u2013Nov\u00a02, pp. 259\u2013276. ACM Press (2017)","DOI":"10.1145\/3133956.3133999"},{"key":"539_CR33","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Nof, A.: Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody. In: Lie, D., Mannan, M., Backes, M., Wang, X.F. (eds.) ACM CCS 2018: 25th Conference on Computer and Communications Security, Toronto, Oct\u00a015\u201319, pp. 1837\u20131854. ACM Press (2018)","DOI":"10.1145\/3243734.3243788"},{"key":"539_CR34","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Nof, A., Ranellucci, S.: Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody. Cryptology ePrint Archive, Report 2018\/987 (2018). https:\/\/eprint.iacr.org\/2018\/987","DOI":"10.1145\/3243734.3243788"},{"issue":"2","key":"539_CR35","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.dam.2005.03.020","volume":"154","author":"UM Maurer","year":"2006","unstructured":"Maurer, U.M.: Secure multi-party computation made simple. Discrete Appl. Math. 154(2), 370\u2013381 (2006)","journal-title":"Discrete Appl. Math."},{"key":"539_CR36","doi-asserted-by":"crossref","unstructured":"MacKenzie, P.D., Reiter, M.K.: Two-party generation of DSA signatures. In: Kilian, J. (ed.) Advances in Cryptology\u2014CRYPTO\u00a02001, Volume 2139 of Lecture Notes in Computer Science, Santa Barbara, Aug\u00a019\u201323, pp. 137\u2013154. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-44647-8_8"},{"key":"539_CR37","unstructured":"National Institute of Standards and Technology. FIPS PUB 186-5 (Draft): Digital Signature Standard (DSS) (2019)"},{"issue":"3","key":"539_CR38","doi-asserted-by":"publisher","first-page":"294","DOI":"10.46586\/tosc.v2017.i3.294-324","volume":"2017","author":"D Rotaru","year":"2017","unstructured":"Rotaru, D., Smart, N.P., Stam, M.: Modes of operation suitable for computing on encrypted data. IACR Trans. Symmetric Cryptol. 2017(3), 294\u2013324 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"539_CR39","unstructured":"Rotaru, D., Smart, N.P., Tanguy, T., Vercauteren, F., Wood, T.: Actively secure setup for SPDZ. Cryptology ePrint Archive, Report 2019\/1300 (2019). https:\/\/eprint.iacr.org\/2019\/1300"},{"key":"539_CR40","doi-asserted-by":"crossref","unstructured":"Rotaru, D., Wood, T.: MArBled circuits: mixing arithmetic and Boolean circuits with active security. In: Hao, F., Ruj, S., Gupta, S.S. (eds.) Progress in Cryptology\u2014INDOCRYPT\u00a02019: 20th International Conference in Cryptology in India, Volume 11898 of Lecture Notes in Computer Science, Hyderabad, Dec\u00a015\u201318, pp. 227\u2013249. Springer, Heidelberg (2019)","DOI":"10.1007\/978-3-030-35423-7_12"},{"key":"539_CR41","doi-asserted-by":"crossref","unstructured":"Shoup, V.: Practical threshold signatures. In: Preneel, B. (ed.) Advances in Cryptology\u2014EUROCRYPT\u00a02000, Volume 1807 of Lecture Notes in Computer Science, Bruges, May\u00a014\u201318, pp. 207\u2013220. Springer, Heidelberg (2000)","DOI":"10.1007\/3-540-45539-6_15"},{"key":"539_CR42","doi-asserted-by":"crossref","unstructured":"Smart, N.P., Alaoui, Y.T.: Distributing any elliptic curve based protocol. In: Albrecht, M. (ed.) 17th IMA International Conference on Cryptography and Coding, Volume 11929 of Lecture Notes in Computer Science, Oxford, Dec\u00a016\u201318, pp. 342\u2013366. Springer, Heidelberg (2019)","DOI":"10.1007\/978-3-030-35199-1_17"},{"key":"539_CR43","doi-asserted-by":"crossref","unstructured":"Smart, N.P., Wood, T.: Error detection in monotone span programs with application to communication-efficient multi-party computation. In: Matsui, M. (ed.) Topics in Cryptology\u2014CT-RSA\u00a02019, Volume 11405 of Lecture Notes in Computer Science, San Francisco, March\u00a04\u20138, pp. 210\u2013229. Springer, Heidelberg (2019)","DOI":"10.1007\/978-3-030-12612-4_11"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-021-00539-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-021-00539-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-021-00539-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T03:18:45Z","timestamp":1634613525000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-021-00539-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,4]]},"references-count":43,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["539"],"URL":"https:\/\/doi.org\/10.1007\/s10207-021-00539-6","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2021,2,4]]},"assertion":[{"value":"4 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"Author Bonte declares no conflict of interest. Author Smart owns stock in UnboundTech a company working in this space. Author Tanguy did a summer internship at SRI within the last 2\u00a0years","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"}}]}}