{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T22:40:09Z","timestamp":1760740809884,"version":"build-2065373602"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T00:00:00Z","timestamp":1753833600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T00:00:00Z","timestamp":1753833600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100008398","name":"Villum Fonden","doi-asserted-by":"publisher","award":["VIL53029"],"award-info":[{"award-number":["VIL53029"]}],"id":[{"id":"10.13039\/100008398","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Protocol Labs","award":["CryptoSat SpaceVDF"],"award-info":[{"award-number":["CryptoSat SpaceVDF"]}]},{"name":"Independent Research Fund Denmark","award":["0165-00079B"],"award-info":[{"award-number":["0165-00079B"]}]},{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"publisher","award":["2022-04684"],"award-info":[{"award-number":["2022-04684"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2025,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Time-based cryptographic primitives unlock efficient realizations of several functionalities including Randomness Beacons, Proof of Replicated Storage, Encryption to the Future, and MultiParty Computation with partial fairness. Existing constructions derive time-delays from the average hardness of sequential computational problems, a measure that is susceptible to algorithmic and hardware improvements. Therefore time-based systems secure at deployment date are at constant risk to turn insecure. A way to combat this intrinsic drawback is to ground time-delays on assumptions that are not affected by scientific advancement such as trust (in a subset of parties) and physical communication delays. This paper builds on Baum et al.\u2019s (SCN 2024) work on \u201cCaSCaDE: (Time-Based) Cryptography from Space Communications DElay\u201d, and provides concrete realizations and detailed security proofs of: a Time Lock Puzzle, a stateless Verifiable Random Function, a Delay Encryption scheme, and a Randomness Beacon from proofs of Sequential Communication Delays (SCD) and trust assumptions on subsets of parties. Notably, our SCD-based Delay Encryption construction constitutes the first alternative to existing supersingular isogenies Delay Encryption schemes.<\/jats:p>","DOI":"10.1007\/s12095-025-00828-0","type":"journal-article","created":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T10:58:13Z","timestamp":1753873093000},"page":"1287-1321","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Proofs of sequential communication delays from physical assumptions and their applications"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7905-0198","authenticated-orcid":false,"given":"Carsten","family":"Baum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1872-7799","authenticated-orcid":false,"given":"Bernardo\u00a0Machado","family":"David","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7804-6696","authenticated-orcid":false,"given":"Elena","family":"Pagnin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8556-3053","authenticated-orcid":false,"given":"Akira","family":"Takahashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,30]]},"reference":[{"key":"828_CR1","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. (1996)"},{"key":"828_CR2","doi-asserted-by":"publisher","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: Shacham, H., Boldyreva, A. (eds.) Advances in cryptology \u2013 CRYPTO\u00a02018, Part\u00a0I. Lecture notes in computer science, vol. 10991, pp. 757\u2013788. Springer, Santa Barbara, CA, USA (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"828_CR3","doi-asserted-by":"publisher","unstructured":"Cascudo, I., David, B., Shlomovits, O., Varlakov, D.: Mt. random: Multi-tiered randomness beacons. In: Tibouchi, M., Wang, X. (eds.) ACNS 23: 21st International conference on applied cryptography and network security, Part\u00a0II. Lecture notes in computer science, vol. 13906, pp. 645\u2013674. Springer, Kyoto, Japan (2023). https:\/\/doi.org\/10.1007\/978-3-031-33491-7_24","DOI":"10.1007\/978-3-031-33491-7_24"},{"key":"828_CR4","doi-asserted-by":"publisher","unstructured":"Baum, C., David, B.M., Pagnin, E., Takahashi, A.: Cascade: (time-based) cryptography from space communications delay. In: Galdi, C., Phan, D.H. (eds.) Security and cryptography for networks, pp. 252\u2013274. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-71070-4_12","DOI":"10.1007\/978-3-031-71070-4_12"},{"key":"828_CR5","doi-asserted-by":"publisher","unstructured":"Baum, C., David, B., Dowsley, R., Kishore, R., Nielsen, J.B., Oechsner, S.: CRAFT: Composable randomness beacons and output-independent abort MPC from time. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023: 26th international conference on theory and practice of public key cryptography, Part\u00a0I. Lecture notes in computer science, vol. 13940, pp. 439\u2013470. Springer, Atlanta, GA, USA (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_16","DOI":"10.1007\/978-3-031-31368-4_16"},{"key":"828_CR6","doi-asserted-by":"publisher","unstructured":"Burdges, J., De Feo, L.: Delay encryption. In: Canteaut, A., Standaert, F.-X. (eds.) Advances in cryptology \u2013 EUROCRYPT\u00a02021, Part\u00a0I. Lecture notes in computer science, vol. 12696, pp. 302\u2013326. Springer, Zagreb, Croatia (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_11","DOI":"10.1007\/978-3-030-77870-5_11"},{"key":"828_CR7","doi-asserted-by":"publisher","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (ed.) Advances in cryptology \u2013 CRYPTO\u00a02000. Lecture notes in computer science, vol. 1880, pp. 236\u2013254. Springer, Santa Barbara, CA, USA (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_15","DOI":"10.1007\/3-540-44598-6_15"},{"key":"828_CR8","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Goldwasser, S., Jain, A., Paneth, O., Vaikuntanathan, V., Waters, B.: Time-lock puzzles from randomized encodings. In: Sudan, M. (ed.) ITCS 2016: 7th conference on innovations in theoretical computer science, pp. 345\u2013356. Association for computing machinery, Cambridge, MA, USA (2016). https:\/\/doi.org\/10.1145\/2840728.2840745","DOI":"10.1145\/2840728.2840745"},{"key":"828_CR9","doi-asserted-by":"publisher","unstructured":"Katz, J., Loss, J., Xu, J.: On the security of time-lock puzzles and timed commitments. In: Pass, R., Pietrzak, K. (eds.) TCC\u00a02020: 18th Theory of cryptography conference, Part\u00a0III. Lecture notes in computer science, vol. 12552, pp. 390\u2013413. Springer, Durham, NC, USA (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_14","DOI":"10.1007\/978-3-030-64381-2_14"},{"key":"828_CR10","doi-asserted-by":"publisher","unstructured":"Freitag, C., Komargodski, I., Pass, R., Sirkin, N.: Non-malleable time-lock puzzles and applications. In: Nissim, K., Waters, B. (eds.) TCC\u00a02021: 19th theory of cryptography conference, Part\u00a0III. Lecture notes in computer science, vol. 13044, pp. 447\u2013479. Springer, Raleigh, NC, USA (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_15","DOI":"10.1007\/978-3-030-90456-2_15"},{"key":"828_CR11","doi-asserted-by":"publisher","unstructured":"Baum, C., David, B., Dowsley, R., Nielsen, J.B., Oechsner, S.: TARDIS: A foundation of time-lock puzzles in UC. In: Canteaut, A., Standaert, F.-X. (eds.) Advances in cryptology \u2013 EUROCRYPT\u00a02021, Part\u00a0III. Lecture notes in computer science, vol. 12698, pp. 429\u2013459. Springer, Zagreb, Croatia (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_15","DOI":"10.1007\/978-3-030-77883-5_15"},{"key":"828_CR12","doi-asserted-by":"publisher","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: Blum, A. (ed.) ITCS 2019: 10th Innovations in theoretical computer science conference, vol. 124, pp. 60\u201316015. LIPIcs, San Diego, CA, USA (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2019.60","DOI":"10.4230\/LIPIcs.ITCS.2019.60"},{"key":"828_CR13","doi-asserted-by":"publisher","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: Ishai, Y., Rijmen, V. (eds.) Advances in cryptology \u2013 EUROCRYPT\u00a02019, Part\u00a0III. Lecture notes in computer science, vol. 11478, pp. 379\u2013407. Springer, Darmstadt, Germany (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_13","DOI":"10.1007\/978-3-030-17659-4_13"},{"key":"828_CR14","doi-asserted-by":"publisher","unstructured":"De Feo, L., Masson, S., Petit, C., Sanso, A.: Verifiable delay functions from supersingular isogenies and pairings. In: Galbraith, S.D., Moriai, S. (eds.) Advances in cryptology \u2013 ASIACRYPT\u00a02019, Part\u00a0I. Lecture notes in computer science, vol. 11921, pp. 248\u2013277. Springer, Kobe, Japan (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_10","DOI":"10.1007\/978-3-030-34578-5_10"},{"key":"828_CR15","doi-asserted-by":"publisher","unstructured":"Ephraim, N., Freitag, C., Komargodski, I., Pass, R.: Continuous verifiable delay functions. In: Canteaut, A., Ishai, Y. (eds.) Advances in cryptology \u2013 EUROCRYPT\u00a02020, Part\u00a0III. Lecture notes in computer science, vol. 12107, pp. 125\u2013154. Springer, Zagreb, Croatia (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_5","DOI":"10.1007\/978-3-030-45727-3_5"},{"key":"828_CR16","doi-asserted-by":"publisher","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions (extended abstract). In: 29th annual symposium on foundations of computer science, pp. 42\u201352. IEEE Computer Society Press, White Plains, NY, USA (1988). https:\/\/doi.org\/10.1109\/SFCS.1988.21920","DOI":"10.1109\/SFCS.1988.21920"},{"key":"828_CR17","doi-asserted-by":"publisher","unstructured":"Maurer, U.M.: Protocols for secret key agreement by public discussion based on common information. In: Brickell, E.F. (ed.) Advances in cryptology \u2013 CRYPTO\u201992. Lecture notes in computer science, vol. 740, pp. 461\u2013470. Springer, Santa Barbara, CA, USA (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_32","DOI":"10.1007\/3-540-48071-4_32"},{"issue":"5589","key":"828_CR18","doi-asserted-by":"publisher","first-page":"2026","DOI":"10.1126\/science.1074376","volume":"297","author":"R Pappu","year":"2002","unstructured":"Pappu, R., Recht, B., Taylor, J., Gershenfeld, N.: Physical one-way functions. Sci. 297(5589), 2026\u20132030 (2002). https:\/\/doi.org\/10.1126\/science.1074376","journal-title":"Sci."},{"key":"828_CR19","doi-asserted-by":"publisher","unstructured":"Brzuska, C., Fischlin, M., Schr\u00f6der, H., Katzenbeisser, S.: Physically uncloneable functions in the universal composition framework. In: Rogaway, P. (ed.) Advances in cryptology \u2013 CRYPTO\u00a02011. Lecture notes in computer science, vol. 6841, pp. 51\u201370. Springer, Santa Barbara, CA, USA (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_4","DOI":"10.1007\/978-3-642-22792-9_4"},{"issue":"1","key":"828_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s13389-013-0052-8","volume":"3","author":"U R\u00fchrmair","year":"2013","unstructured":"R\u00fchrmair, U., van Dijk, M.: On the practical use of physical unclonable functions in oblivious transfer and bit commitment protocols. J. Cryptogr. Eng. 3(1), 17\u201328 (2013). https:\/\/doi.org\/10.1007\/s13389-013-0052-8","journal-title":"J. Cryptogr. Eng."},{"key":"828_CR21","doi-asserted-by":"publisher","unstructured":"Katz, J.: Universally composable multi-party computation using tamper-proof hardware. In: Naor, M. (ed.) Advances in cryptology \u2013 EUROCRYPT\u00a02007. Lecture notes in computer science, vol. 4515, pp. 115\u2013128. Springer, Barcelona, Spain (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_7","DOI":"10.1007\/978-3-540-72540-4_7"},{"key":"828_CR22","doi-asserted-by":"publisher","unstructured":"Goyal, V., Ishai, Y., Sahai, A., Venkatesan, R., Wadia, A.: Founding cryptography on tamper-proof hardware tokens. In: Micciancio, D. (ed.) TCC\u00a02010: 7th theory of cryptography conference. Lecture notes in computer science, vol. 5978, pp. 308\u2013326. Springer, Zurich, Switzerland (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_19","DOI":"10.1007\/978-3-642-11799-2_19"},{"key":"828_CR23","doi-asserted-by":"publisher","unstructured":"Almashaqbeh, G., Canetti, R., Erlich, Y., Gershoni, J., Malkin, T., Pe\u2019er, I., Roitburd-Berman, A., Tromer, E.: Unclonable polymers and their cryptographic applications. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in cryptology \u2013 EUROCRYPT\u00a02022, Part\u00a0I. Lecture notes in computer science, vol. 13275, pp. 759\u2013789. Springer, Trondheim, Norway (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_26","DOI":"10.1007\/978-3-031-06944-4_26"},{"key":"828_CR24","doi-asserted-by":"publisher","unstructured":"Kent, A.: Unconditionally secure bit commitment. Phys. Rev. Lett. 83, 1447\u20131450 (1999). https:\/\/doi.org\/10.1103\/PhysRevLett.83.1447","DOI":"10.1103\/PhysRevLett.83.1447"},{"key":"828_CR25","doi-asserted-by":"publisher","unstructured":"Lunghi, T., Kaniewski, J., Bussi\u00e8res, F., Houlmann, R., Tomamichel, M., Wehner, S., Zbinden, H.: Practical relativistic bit commitment. Phys. Rev. Lett. 115, 030502 (2015). https:\/\/doi.org\/10.1103\/PhysRevLett.115.030502","DOI":"10.1103\/PhysRevLett.115.030502"},{"key":"828_CR26","doi-asserted-by":"publisher","unstructured":"Cr\u00e9peau, C., Massenet, A., Salvail, L., Stinchcombe, L.S., Yang, N.: Practical relativistic zero-knowledge for NP. In: Kalai, Y.T., Smith, A.D., Wichs, D. (eds.) ITC 2020: 1st conference on information-theoretic cryptography, pp. 4\u20131418. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Boston, MA, USA (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ITC.2020.4","DOI":"10.4230\/LIPIcs.ITC.2020.4"},{"key":"828_CR27","doi-asserted-by":"publisher","unstructured":"Verbanis, E., Martin, A., Houlmann, R., Boso, G., Bussi\u00e8res, F., Zbinden, H.: 24-hour relativistic bit commitment. Phys. Rev. Lett. 117, 140506 (2016). https:\/\/doi.org\/10.1103\/PhysRevLett.117.140506","DOI":"10.1103\/PhysRevLett.117.140506"},{"issue":"7883","key":"828_CR28","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1038\/s41586-021-03998-y","volume":"599","author":"P Alikhani","year":"2021","unstructured":"Alikhani, P., Brunner, N., Cr\u00e9peau, C., Designolle, S., Houlmann, R., Shi, W., Yang, N., Zbinden, H.: Experimental relativistic zero-knowledge proofs. Nat. 599(7883), 47\u201350 (2021). https:\/\/doi.org\/10.1038\/s41586-021-03998-y","journal-title":"Nat."},{"key":"828_CR29","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd annual symposium on foundations of computer science, pp. 136\u2013145. IEEE Computer Society Press, Las Vegas, NV, USA (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"828_CR30","doi-asserted-by":"publisher","unstructured":"Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: Vadhan, S.P. (ed.) TCC\u00a02007: 4th theory of cryptography conference. Lecture notes in computer science, vol. 4392, pp. 61\u201385. Springer, Amsterdam, The Netherlands (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_4","DOI":"10.1007\/978-3-540-70936-7_4"},{"key":"828_CR31","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Drijvers, M., Gagliardoni, T., Lehmann, A., Neven, G.: The wonderful world of global random oracles. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in cryptology \u2013 EUROCRYPT\u00a02018, Part\u00a0I. Lecture notes in computer science, vol. 10820, pp. 280\u2013312. Springer, Tel Aviv, Israel (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_11","DOI":"10.1007\/978-3-319-78381-9_11"},{"issue":"2","key":"828_CR32","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/S00145-024-09493-7","volume":"37","author":"C Badertscher","year":"2024","unstructured":"Badertscher, C., Maurer, U., Tschudi, D., Zikas, V.: Bitcoin as a transaction ledger: A composable treatment. J. Cryptol. 37(2), 18 (2024). https:\/\/doi.org\/10.1007\/S00145-024-09493-7","journal-title":"J. Cryptol."},{"key":"828_CR33","doi-asserted-by":"publisher","unstructured":"Kiayias, A., Zhou, H., Zikas, V.: Fair and robust multi-party computation using a global transaction ledger. In: Fischlin, M., Coron, J. (eds.) Advances in cryptology - EUROCRYPT 2016 - 35th annual international conference on the theory and applications of cryptographic techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II. Lecture Notes in Computer Science, vol. 9666, pp. 705\u2013734. Springer, Vienna, Austria (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_25","DOI":"10.1007\/978-3-662-49896-5_25"},{"key":"828_CR34","doi-asserted-by":"publisher","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally composable synchronous computation. In: Sahai, A. (ed.) Theory of cryptography - 10th theory of cryptography conference, TCC 2013, Tokyo, Japan, March 3-6, 2013. Proceedings. Lecture notes in computer science, vol. 7785, pp. 477\u2013498. Springer, Tokyo, Japan (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_27","DOI":"10.1007\/978-3-642-36594-2_27"},{"key":"828_CR35","doi-asserted-by":"publisher","unstructured":"Canetti, R., Herzog, J.: Universally composable symbolic analysis of mutual authentication and key-exchange protocols. In: Halevi, S., Rabin, T. (eds.) TCC\u00a02006: 3rd theory of cryptography Conference. Lecture notes in computer science, vol. 3876, pp. 380\u2013403. Springer, New York, NY, USA (2006). https:\/\/doi.org\/10.1007\/11681878_20","DOI":"10.1007\/11681878_20"},{"key":"828_CR36","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable signature, certification, and authentication. In: Proceedings. 17th IEEE computer security foundations workshop, 2004., pp. 219\u2013233 (2004). https:\/\/doi.org\/10.1109\/CSFW.2004.1310743","DOI":"10.1109\/CSFW.2004.1310743"},{"key":"828_CR37","doi-asserted-by":"publisher","unstructured":"Baum, C., David, B., Dowsley, R.: (Public) verifiability for composable protocols without adaptivity or zero-knowledge. In: Ge, C., Guo, F. (eds.) ProvSec 2022: 16th international conference on provable security. Lecture notes in computer science, vol. 13600, pp. 249\u2013272. Springer, Nanjing, China (2022). https:\/\/doi.org\/10.1007\/978-3-031-20917-8_17","DOI":"10.1007\/978-3-031-20917-8_17"},{"key":"828_CR38","doi-asserted-by":"publisher","unstructured":"Pointcheval, D.: Chosen-ciphertext security for any one-way cryptosystem. In: Imai, H., Zheng, Y. (eds.) PKC\u00a02000: 3rd international workshop on theory and practice in public key cryptography. Lecture notes in computer science, vol. 1751, pp. 129\u2013146. Springer, Melbourne, Victoria, Australia (2000). https:\/\/doi.org\/10.1007\/978-3-540-46588-1_10","DOI":"10.1007\/978-3-540-46588-1_10"},{"key":"828_CR39","doi-asserted-by":"publisher","unstructured":"Fujisaki, E., Okamoto, T.: How to enhance the security of public-key encryption at minimum cost. In: Imai, H., Zheng, Y. (eds.) PKC\u201999: 2nd international workshop on theory and practice in public key cryptography. Lecture notes in computer science, vol. 1560, pp. 53\u201368. Springer, Kamakura, Japan (1999). https:\/\/doi.org\/10.1007\/3-540-49162-7_5","DOI":"10.1007\/3-540-49162-7_5"},{"key":"828_CR40","doi-asserted-by":"publisher","unstructured":"Lysyanskaya, A., Micali, S., Reyzin, L., Shacham, H.: Sequential aggregate signatures from trapdoor permutations. In: Cachin, C., Camenisch, J. (eds.) Advances in cryptology \u2013 EUROCRYPT\u00a02004. Lecture notes in computer science, vol. 3027, pp. 74\u201390. Springer, Interlaken, Switzerland (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_5","DOI":"10.1007\/978-3-540-24676-3_5"},{"key":"828_CR41","doi-asserted-by":"publisher","unstructured":"Boldyreva, A., Gentry, C., O\u2019Neill, A., Yum, D.H.: Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing. In: Ning, P., De Capitani di Vimercati, S., Syverson, P.F. (eds.) ACM CCS 2007: 14th conference on computer and communications security, pp. 276\u2013285. ACM Press, Alexandria, Virginia, USA (2007). https:\/\/doi.org\/10.1145\/1315245.1315280","DOI":"10.1145\/1315245.1315280"},{"key":"828_CR42","doi-asserted-by":"publisher","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) Advances in cryptology \u2013 CRYPTO\u00a02001. Lecture notes in computer science, vol. 2139, pp. 213\u2013229. Springer, Santa Barbara, CA, USA (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13","DOI":"10.1007\/3-540-44647-8_13"},{"key":"828_CR43","doi-asserted-by":"publisher","unstructured":"Nishimaki, R., Manabe, Y., Okamoto, T.: Universally composable identity-based encryption. In: Nguyen, P.Q. (ed.) Progress in cryptology - VIETCRYPT 06: 1st international conference on cryptology in Vietnam. Lecture notes in computer science, vol. 4341, pp. 337\u2013353. Springer, Hanoi, Vietnam (2006). https:\/\/doi.org\/10.1007\/11958239_23","DOI":"10.1007\/11958239_23"},{"key":"828_CR44","doi-asserted-by":"publisher","unstructured":"Cui, Y., Fujisaki, E., Hanaoka, G., Imai, H., Zhang, R.: Formal security treatments for signatures from identity-based encryption. In: Susilo, W., Liu, J.K., Mu, Y. (eds.) Provable security, 1st international conference, ProvSec 2007, Wollongong, Australia, November 1-2, 2007, Proceedings. Lecture notes in computer science, vol. 4784, pp. 218\u2013227. Springer, \u2013 (2007). https:\/\/doi.org\/10.1007\/978-3-540-75670-5_16","DOI":"10.1007\/978-3-540-75670-5_16"},{"key":"828_CR45","unstructured":"Bate, R.R., Mueller, D.D., White, J.E., Saylor, W.W.: Fundamentals of Astrodynamics. Courier Dover Publications, \u2013 (2020)"},{"key":"828_CR46","unstructured":"Vallado, D.A.: Fundamentals of Astrodynamics and Applications vol. 12. Springer, - (2001)"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-025-00828-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-025-00828-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-025-00828-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T22:02:40Z","timestamp":1760738560000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-025-00828-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,30]]},"references-count":46,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["828"],"URL":"https:\/\/doi.org\/10.1007\/s12095-025-00828-0","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2025,7,30]]},"assertion":[{"value":"10 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2025","order":3,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}