{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,11]],"date-time":"2023-11-11T00:22:04Z","timestamp":1699662124956},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T00:00:00Z","timestamp":1690156800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T00:00:00Z","timestamp":1690156800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Helmholtz-Zentrum f\u00fcr Informationssicherheit \u2013 CISPA gGmbH"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Consider the following problem: You have a device that is supposed to compute a linear combination of its inputs, which are taken from some finite field. However, the device may be faulty and compute arbitrary functions of its inputs. Is it possible to encode the inputs in such a way that only linear functions can be evaluated over the encodings? I.e., learning an arbitrary function of the encodings will not reveal more information about the inputs than a linear combination. In this work, we introduce the notion of <jats:italic>algebraic restriction codes<\/jats:italic> (AR codes), which constrain adversaries who might compute any function to computing a linear function. Our main result is an information-theoretic construction AR codes that restrict any class of function with a bounded number of output bits to linear functions. Our construction relies on a seed which is not provided to the adversary. While interesting and natural on its own, we show an application of this notion in cryptography. In particular, we show that AR codes lead to the first construction of rate-1 oblivious transfer with statistical sender security from the Decisional Diffie\u2013Hellman assumption, and the first-ever construction that makes black-box use of cryptography. Previously, such protocols were known only from the LWE assumption, using non-black-box cryptographic techniques. We expect our new notion of AR codes to find further applications, e.g., in the context of non-malleability, in the future.<\/jats:p>","DOI":"10.1007\/s00453-023-01150-y","type":"journal-article","created":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T12:02:31Z","timestamp":1690200151000},"page":"3602-3648","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algebraic Restriction Codes and Their Applications"],"prefix":"10.1007","volume":"85","author":[{"given":"Divesh","family":"Aggarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nico","family":"D\u00f6ttling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesko","family":"Dujmovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Hajiabadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giulio","family":"Malavolta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Obremski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"issue":"4","key":"1150_CR1","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/3178432","volume":"65","author":"S Dziembowski","year":"2018","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. J. ACM 65(4), 20\u201332 (2018). https:\/\/doi.org\/10.1145\/3178432","journal-title":"J. ACM"},{"key":"1150_CR2","doi-asserted-by":"publisher","unstructured":"Dziembowski, S., Kazana, T., Obremski, M.: Non-malleable codes from two-source extractors. In: Canetti, R., Garay, J.A. (eds.) Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2013. Proceedings, Part II. Lecture Notes in Computer Science, vol. 8043, pp. 239\u2013257. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_14","DOI":"10.1007\/978-3-642-40084-1_14"},{"key":"1150_CR3","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Dodis, Y., Lovett, S.: Non-malleable codes from additive combinatorics. In: Shmoys, D.B. (ed.) Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31\u2013June 03, 2014, pp. 774\u2013783. ACM (2014). https:\/\/doi.org\/10.1145\/2591796.2591804","DOI":"10.1145\/2591796.2591804"},{"key":"1150_CR4","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Wichs, D.: Non-malleable extractors and symmetric key cryptography from weak secrets. In: Mitzenmacher, M. (ed.) Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31\u2013June 2, 2009, pp. 601\u2013610. ACM (2009). https:\/\/doi.org\/10.1145\/1536414.1536496","DOI":"10.1145\/1536414.1536496"},{"key":"1150_CR5","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Li, X., Wooley, T.D., Zuckerman, D.: Privacy amplification and non-malleable extractors via character sums. In: Ostrovsky, R. (ed.) IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22\u201325, 2011, pp. 668\u2013677. IEEE Computer Society (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.67","DOI":"10.1109\/FOCS.2011.67"},{"key":"1150_CR6","doi-asserted-by":"publisher","unstructured":"Li, X.: Non-malleable extractors, two-source extractors and privacy amplification. In: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20\u201323, 2012, pp. 688\u2013697. IEEE Computer Society (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.26","DOI":"10.1109\/FOCS.2012.26"},{"key":"1150_CR7","doi-asserted-by":"publisher","unstructured":"Cheraghchi, M., Guruswami, V.: Non-malleable coding against bit-wise and split-state tampering. In: Lindell, Y. (ed.) Theory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24\u201326, 2014. Proceedings. Lecture Notes in Computer Science, vol. 8349, pp. 440\u2013464. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_19","DOI":"10.1007\/978-3-642-54242-8_19"},{"key":"1150_CR8","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: Theory and applications of trapdoor functions (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3\u20135 November 1982, pp. 80\u201391. IEEE Computer Society (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.45","DOI":"10.1109\/SFCS.1982.45"},{"key":"1150_CR9","doi-asserted-by":"publisher","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) Advances in Cryptology - EUROCRYPT \u201999, International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2\u20136, 1999, Proceeding. Lecture Notes in Computer Science, vol. 1592, pp. 223\u2013238. Springer (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16","DOI":"10.1007\/3-540-48910-X_16"},{"key":"1150_CR10","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31\u2013June 2, 2009, pp. 169\u2013178. ACM (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"1150_CR11","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: Ostrovsky, R. (ed.) IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22\u201325, 2011, pp. 97\u2013106. IEEE Computer Society (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.12","DOI":"10.1109\/FOCS.2011.12"},{"key":"1150_CR12","doi-asserted-by":"publisher","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2013. Proceedings, Part I. Lecture Notes in Computer Science, vol. 8042, pp. 75\u201392. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"1150_CR13","unstructured":"Vazirani, U.: Randomness, adversaries and computation. PhD thesis, EECS, UC Berkeley (1986)"},{"key":"1150_CR14","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. IACR Cryptol. ePrint Arch., 187 (2005)"},{"key":"1150_CR15","doi-asserted-by":"publisher","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) Advances in Cryptology: Proceedings of CRYPTO \u201982, Santa Barbara, California, USA, August 23\u201325, 1982, pp. 205\u2013210. Plenum Press, New York (1982). https:\/\/doi.org\/10.1007\/978-1-4757-0602-4_19","DOI":"10.1007\/978-1-4757-0602-4_19"},{"key":"1150_CR16","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27\u201329 October 1986, pp. 162\u2013167. IEEE Computer Society (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"},{"key":"1150_CR17","doi-asserted-by":"publisher","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2\u20134, 1988, Chicago, Illinois, USA, pp. 20\u201331. ACM (1988). https:\/\/doi.org\/10.1145\/62212.62215","DOI":"10.1145\/62212.62215"},{"key":"1150_CR18","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: Kosaraju, S.R. (ed.) Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7\u20139, 2001, Washington, DC, USA, pp. 448\u2013457. ACM\/SIAM (2001)"},{"key":"1150_CR19","doi-asserted-by":"publisher","unstructured":"Aiello, W., Ishai, Y., Reingold, O.: Priced oblivious transfer: How to sell digital goods. In: Pfitzmann, B. (ed.) Advances in Cryptology - EUROCRYPT 2001, International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6\u201310, 2001, Proceeding. Lecture Notes in Computer Science, vol. 2045, pp. 119\u2013135. Springer (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_8","DOI":"10.1007\/3-540-44987-6_8"},{"key":"1150_CR20","doi-asserted-by":"publisher","unstructured":"Badrinarayanan, S., Fernando, R., Jain, A., Khurana, D., Sahai, A.: Statistical ZAP arguments. In: Canteaut, A., Ishai, Y. (eds.) Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10\u201314, 2020, Proceedings, Part III. Lecture Notes in Computer Science, vol. 12107, pp. 642\u2013667. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_22","DOI":"10.1007\/978-3-030-45727-3_22"},{"key":"1150_CR21","doi-asserted-by":"publisher","unstructured":"Goyal, V., Jain, A., Jin, Z., Malavolta, G.: Statistical zaps and new oblivious transfer protocols. In: Canteaut, A., Ishai, Y. (eds.) Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10\u201314, 2020, Proceedings, Part III. Lecture Notes in Computer Science, vol. 12107, pp. 668\u2013699. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_23","DOI":"10.1007\/978-3-030-45727-3_23"},{"key":"1150_CR22","doi-asserted-by":"publisher","unstructured":"Ostrovsky, R., Paskin-Cherniavsky, A., Paskin-Cherniavsky, B.: Maliciously circuit-private FHE. In: Garay, J.A., Gennaro, R. (eds.) Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17\u201321, 2014, Proceedings, Part I. Lecture Notes in Computer Science, vol. 8616, pp. 536\u2013553. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_30","DOI":"10.1007\/978-3-662-44371-2_30"},{"issue":"1","key":"1150_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O Goldreich","year":"1994","unstructured":"Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems. J. Cryptol. 7(1), 1\u201332 (1994)","journal-title":"J. Cryptol."},{"key":"1150_CR24","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Paskin, A.: Evaluating branching programs on encrypted data. In: Vadhan, S.P. (ed.) Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21\u201324, 2007, Proceedings. Lecture Notes in Computer Science, vol. 4392, pp. 575\u2013594. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_31","DOI":"10.1007\/978-3-540-70936-7_31"},{"key":"1150_CR25","doi-asserted-by":"publisher","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is NOT needed: SINGLE database, computationally-private information retrieval. In: 38th Annual Symposium on Foundations of Computer Science, FOCS \u201997, Miami Beach, Florida, USA, October 19\u201322, 1997, pp. 364\u2013373. IEEE Computer Society (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646125","DOI":"10.1109\/SFCS.1997.646125"},{"key":"1150_CR26","doi-asserted-by":"publisher","unstructured":"Gamal, T.E.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakley, G.R., Chaum, D. (eds.) Advances in Cryptology, Proceedings of CRYPTO \u201984, Santa Barbara, California, USA, August 19\u201322, 1984, Proceedings. Lecture Notes in Computer Science, vol. 196, pp. 10\u201318. Springer (1984). https:\/\/doi.org\/10.1007\/3-540-39568-7_2","DOI":"10.1007\/3-540-39568-7_2"},{"key":"1150_CR27","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Garg, S., Ishai, Y., Malavolta, G., Mour, T., Ostrovsky, R.: Trapdoor hash functions and their applications. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2019, Proceedings, Part III. Lecture Notes in Computer Science, vol. 11694, pp. 3\u201332. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_1","DOI":"10.1007\/978-3-030-26954-8_1"},{"issue":"1","key":"1150_CR28","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s00145-010-9092-8","volume":"25","author":"S Halevi","year":"2012","unstructured":"Halevi, S., Kalai, Y.T.: Smooth projective hashing and two-message oblivious transfer. J. Cryptol. 25(1), 158\u2013193 (2012). https:\/\/doi.org\/10.1007\/s00145-010-9092-8","journal-title":"J. Cryptol."},{"key":"1150_CR29","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., D\u00f6ttling, N.: Two-message statistically sender-private OT from LWE. In: Beimel, A., Dziembowski, S. (eds.) Theory of Cryptography - 16th International Conference, TCC 2018, Panaji, India, November 11\u201314, 2018, Proceedings, Part II. Lecture Notes in Computer Science, vol. 11240, pp. 370\u2013390. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_14","DOI":"10.1007\/978-3-030-03810-6_14"},{"key":"1150_CR30","doi-asserted-by":"publisher","unstructured":"Badrinarayanan, S., Garg, S., Ishai, Y., Sahai, A., Wadia, A.: Two-message witness indistinguishability and secure computation in the plain model from new assumptions. In: Takagi, T., Peyrin, T. (eds.) Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3\u20137, 2017, Proceedings, Part III. Lecture Notes in Computer Science, vol. 10626, pp. 275\u2013303. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_10","DOI":"10.1007\/978-3-319-70700-6_10"},{"key":"1150_CR31","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., D\u00f6ttling, N., Garg, S., Malavolta, G.: Leveraging linear decryption: Rate-1 fully-homomorphic encryption and time-lock puzzles. In: Hofheinz, D., Rosen, A. (eds.) Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1\u20135, 2019, Proceedings, Part II. Lecture Notes in Computer Science, vol. 11892, pp. 407\u2013437. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_16","DOI":"10.1007\/978-3-030-36033-7_16"},{"key":"1150_CR32","doi-asserted-by":"publisher","unstructured":"Gentry, C., Halevi, S.: Compressible FHE with applications to PIR. In: Hofheinz, D., Rosen, A. (eds.) Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1\u20135, 2019, Proceedings, Part II. Lecture Notes in Computer Science, vol. 11892, pp. 438\u2013464. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_17","DOI":"10.1007\/978-3-030-36033-7_17"},{"key":"1150_CR33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511987045","volume-title":"A Course in Combinatorics","author":"JH van Lint","year":"2001","unstructured":"van Lint, J.H., Wilson, R.M.: A Course in Combinatorics. Cambridge University Press, Cambridge (2001)"},{"key":"1150_CR34","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Obremski, M.: A constant rate non-malleable code in the split-state model. In: Irani, S. (ed.) 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16\u201319, 2020, pp. 1285\u20131294. IEEE (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00122","DOI":"10.1109\/FOCS46700.2020.00122"},{"key":"1150_CR35","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Chung, K., Lin, H., Vidick, T.: A quantum-proof non-malleable extractor - with application to privacy amplification against active quantum adversaries. In: Ishai, Y., Rijmen, V. (eds.) Advances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19\u201323, 2019, Proceedings, Part II. Lecture Notes in Computer Science, vol. 11477, pp. 442\u2013469. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_16","DOI":"10.1007\/978-3-030-17656-3_16"},{"issue":"6","key":"1150_CR36","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). https:\/\/doi.org\/10.1109\/TIT.1976.1055638","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1150_CR37","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Branco, P., D\u00f6ttling, N., Garg, S., Malavolta, G.: Constant ciphertext-rate non-committing encryption from standard assumptions. In: Pass, R., Pietrzak, K. (eds.) Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16\u201319, 2020, Proceedings, Part I. Lecture Notes in Computer Science, vol. 12550, pp. 58\u201387. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_3","DOI":"10.1007\/978-3-030-64375-1_3"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01150-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-023-01150-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01150-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T13:03:52Z","timestamp":1699621432000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-023-01150-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,24]]},"references-count":37,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1150"],"URL":"https:\/\/doi.org\/10.1007\/s00453-023-01150-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,24]]},"assertion":[{"value":"4 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Divesh Aggarwal, Nico D\u00f6ttling, Jesko Dujmovic, Giulio Malavolta, and Maciej Obremski have no conflict of interest to declare. Mohammad Hajiabadi recently coauthored papers with Rafail Ostrovsky and is in the same institute as Joseph Cheriyan and Lap Chi Lau.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}