{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T22:15:01Z","timestamp":1769033701383,"version":"3.49.0"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T00:00:00Z","timestamp":1768953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T00:00:00Z","timestamp":1768953600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2023YFB4503203"],"award-info":[{"award-number":["2023YFB4503203"]}]},{"name":"Strategic Priority Research Program of Chinese Academy of Sciences","award":["XDB0690200"],"award-info":[{"award-number":["XDB0690200"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372447"],"award-info":[{"award-number":["62372447"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Time-release cryptography is a flourishing research area with a long history and has been extensively studied. In this work, we enrich it by introducing a novel concept: a time-release zero-knowledge proof (TRZKP). A TRZKP is a non-interactive zero-knowledge proof that allows one to publish a proof for a given relation\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$R_\\mathcal {L}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msub>\n                            <mml:mi>R<\/mml:mi>\n                            <mml:mi>L<\/mml:mi>\n                          <\/mml:msub>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , such that anyone can only finish the verification after time\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\textbf{T}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>T<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    by performing a sequential computation. This work formalizes the concept of TRZKP and presents light constructions for the time-release version of any NIZK obtained from a public-coin protocol via Fiat-Shamir transformation. TRZKPs can be applied to provide time-release authentication, for example, they can be employed to construct verifiable timed signatures (VTS), introduced by Thyagarajan et al. (CCS\u201920). Through both theoretical and practical analysis, our construction has advantages over existing VTS for Fiat-Shamir signatures. Specifically, when instantiated with Shnorr signature,\u00a0our VTS signing time remains basically unchanged as the delay time grows, and is preferable for longer delay times; our VTS verification time is significantly small (on the level of milliseconds, while existing works on the level of seconds), and our VTS size is 67 times smaller than the state-of-the-art. It also has the time-verifiability property, which ensures the signature is recoverable after the specified time.\n                  <\/jats:p>","DOI":"10.1186\/s42400-025-00453-7","type":"journal-article","created":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T07:25:08Z","timestamp":1768980308000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sending zero-knowledge proofs to the future"],"prefix":"10.1186","volume":"9","author":[{"given":"Zhichao","family":"Wang","sequence":"first","affiliation":[]},{"given":"Xudong","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Xinxuan","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5948-0780","authenticated-orcid":false,"given":"Yi","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Xuyang","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,21]]},"reference":[{"key":"453_CR1","doi-asserted-by":"publisher","unstructured":"Abadi A, Ciampi M, Kiayias A, Zikas V (2020) Timed signatures and zero-knowledge proofs\u2014timestamping in the blockchain era\u2014. In: Conti M, Zhou J, Casalicchio E, Spognardi A (eds) Applied cryptography and network security\u201418th international conference, ACNS 2020, Rome, Italy, October 19\u201322, 2020, proceedings, part I. Lecture notes in computer science, vol 12146. Springer, Cham, pp 335\u2013354. https:\/\/doi.org\/10.1007\/978-3-030-57808-4_17","DOI":"10.1007\/978-3-030-57808-4_17"},{"key":"453_CR2","doi-asserted-by":"publisher","unstructured":"Ames S, Hazay C, Ishai Y, Venkitasubramaniam M (2017) Ligero: lightweight sublinear arguments without a trusted setup. In: Thuraisingham B, Evans D, Malkin T, Xu D (eds) Proceedings of the 2017 ACM SIGSAC conference on computer and communications security, CCS 2017, Dallas, TX, USA, October 30\u2013November 03, 2017. ACM, New York, NY, USA, pp 2087\u20132104. https:\/\/doi.org\/10.1145\/3133956.3134104","DOI":"10.1145\/3133956.3134104"},{"key":"453_CR3","doi-asserted-by":"publisher","unstructured":"Arun A, Bonneau J, Clark J (2022) Short-lived zero-knowledge proofs and signatures. In: Agrawal S, Lin D (eds) Advances in cryptology\u2014ASIACRYPT 2022\u201428th international conference on the theory and application of cryptology and information security, Taipei, Taiwan, December 5\u20139, 2022, proceedings, part III. Lecture notes in computer science, vol 13793. Springer, Cham, pp 487\u2013516. https:\/\/doi.org\/10.1007\/978-3-031-22969-5_17","DOI":"10.1007\/978-3-031-22969-5_17"},{"key":"453_CR4","doi-asserted-by":"publisher","unstructured":"Attema T, Cramer R, Kohl L (2021) A compressed \u03a3-protocol theory for lattices. In: Malkin T, Peikert C (eds) Advances in cryptology\u2014CRYPTO 2021\u201441st annual international cryptology conference, CRYPTO 2021, virtual event, August 16\u201320, 2021, proceedings, part II. Lecture notes in computer science, vol 12826. Springer, Cham, pp 549\u2013579. https:\/\/doi.org\/10.1007\/978-3-030-84245-1_19","DOI":"10.1007\/978-3-030-84245-1_19"},{"key":"453_CR5","doi-asserted-by":"publisher","unstructured":"Aumayr L, Thyagarajan SAK, Malavolta G, Moreno-Sanchez P, Maffei M (2022) Sleepy channels: bi-directional payment channels without watchtowers. In: Yin H, Stavrou A, Cremers C, Shi E (eds) Proceedings of the 2022 ACM SIGSAC conference on computer and communications security, CCS 2022, Los Angeles, CA, USA, November 7\u201311, 2022. ACM, New York, NY, USA, pp 179\u2013192. https:\/\/doi.org\/10.1145\/3548606.3559370","DOI":"10.1145\/3548606.3559370"},{"key":"453_CR6","doi-asserted-by":"publisher","unstructured":"Babai L (1985) Trading group theory for randomness. In: Sedgewick R (ed) Proceedings of the 17th annual ACM symposium on theory of computing, May 6\u20138, 1985, Providence, Rhode Island, USA. ACM, New York, NY, USA, pp 421\u2013429. https:\/\/doi.org\/10.1145\/22145.22192","DOI":"10.1145\/22145.22192"},{"issue":"4","key":"453_CR7","doi-asserted-by":"publisher","first-page":"1414","DOI":"10.1109\/TSC.2023.3347526","volume":"17","author":"Z Bao","year":"2024","unstructured":"Bao Z, He D, Feng Q, Luo M, Zeng X (2024) Constant-size verifiable timed signatures from RSA group for bitcoin-based voting protocols. IEEE Trans Serv Comput 17(4):1414\u20131425. https:\/\/doi.org\/10.1109\/TSC.2023.3347526","journal-title":"IEEE Trans Serv Comput"},{"key":"453_CR8","doi-asserted-by":"publisher","unstructured":"Baum C, Braun L, Saint\u00a0Guilhem CD, Kloo\u00df M, Orsini E, Roy L, Scholl P (2023) Publicly verifiable zero-knowledge and post-quantum signatures from vole-in-the-head. In: Handschuh H, Lysyanskaya A (eds) Advances in cryptology\u2014CRYPTO 2023\u201443rd annual international cryptology conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20\u201324, 2023, proceedings, part V. Lecture notes in computer science, vol 14085. Springer, Cham, pp 581\u2013615. https:\/\/doi.org\/10.1007\/978-3-031-38554-4_19","DOI":"10.1007\/978-3-031-38554-4_19"},{"key":"453_CR9","doi-asserted-by":"publisher","unstructured":"Bellare M, Goldwasser S (1997) Verifiable partial key escrow. In: Graveman R, Janson PA, Neuman C, Gong L (eds) CCS \u201997, Proceedings of the 4th ACM conference on computer and communications security, Zurich, Switzerland, April 1\u20134, 1997. ACM, New York, NY, USA, pp 78\u201391. https:\/\/doi.org\/10.1145\/266420.266439","DOI":"10.1145\/266420.266439"},{"key":"453_CR10","doi-asserted-by":"publisher","unstructured":"Boneh D, Naor M (2000) Timed commitments. In: Bellare M (ed) Advances in cryptology\u2014CRYPTO 2000, 20th annual international cryptology conference, Santa Barbara, California, USA, August 20\u201324, 2000, proceedings. Lecture notes in computer science, vol 1880. Springer, Berlin, pp 236\u2013254. https:\/\/doi.org\/10.1007\/3-540-44598-6_15","DOI":"10.1007\/3-540-44598-6_15"},{"key":"453_CR11","unstructured":"Boneh D, Shoup V (2023) A graduate course in applied cryptography. https:\/\/toc.cryptobook.us\/, US"},{"key":"453_CR12","doi-asserted-by":"publisher","unstructured":"Boneh D, Bonneau J, B\u00fcnz B, Fisch B (2018a) Verifiable delay functions. In: Shacham H, Boldyreva A (eds) Advances in cryptology\u2014CRYPTO 2018\u201438th annual international cryptology conference, Santa Barbara, CA, USA, August 19\u201323, 2018, proceedings, part I. Lecture notes in computer science, vol 10991. Springer, Cham, pp 757\u2013788. https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"453_CR13","doi-asserted-by":"crossref","unstructured":"Boneh D, B\u00fcnz B, Fisch B (2018b) A survey of two verifiable delay functions. IACR Cryptol ePrint Arch, 712","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"453_CR14","unstructured":"Bonneau J, Clark J, Goldfeder S (2015) On bitcoin as a public randomness source. IACR Cryptol ePrint Arch, 1015"},{"key":"453_CR15","doi-asserted-by":"publisher","unstructured":"B\u00fcnz B, Bootle J, Boneh D, Poelstra A, Wuille P, Maxwell G (2018) Bulletproofs: short proofs for confidential transactions and more. In: 2018 IEEE symposium on security and privacy, SP 2018, proceedings, 21\u201323 May 2018, San Francisco, California, USA. IEEE Computer Society, New York, NY, USA, pp 315\u2013334. https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"453_CR16","doi-asserted-by":"publisher","unstructured":"Camenisch J, Lysyanskaya A (2001) An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann B.(ed) Advances in cryptology\u2014EUROCRYPT 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. Springer, Berlin, pp 93\u2013118. https:\/\/doi.org\/10.1007\/3-540-44987-6_7","DOI":"10.1007\/3-540-44987-6_7"},{"key":"453_CR17","doi-asserted-by":"publisher","unstructured":"Canetti R, Dwork C, Naor M, Ostrovsky R (1997) Deniable encryption. In: Jr BSK (ed) Advances in cryptology\u2014CRYPTO \u201997, 17th annual international cryptology conference, Santa Barbara, California, USA, August 17\u201321, 1997, proceedings. Lecture notes in computer science, vol 1294. Springer, Berlin, pp 90\u2013104. https:\/\/doi.org\/10.1007\/BFb0052229","DOI":"10.1007\/BFb0052229"},{"key":"453_CR18","doi-asserted-by":"publisher","unstructured":"Cathalo J, Libert B, Quisquater J (2005) Efficient and non-interactive timed-release encryption. In: Qing S, Mao W, L\u00f3pez J, Wang G (eds) Information and communications security, 7th international conference, ICICS 2005, Beijing, China, December 10\u201313, 2005, proceedings. Lecture notes in computer science, vol 3783. Springer, Berlin, pp 291\u2013303. https:\/\/doi.org\/10.1007\/11602897_25","DOI":"10.1007\/11602897_25"},{"key":"453_CR19","doi-asserted-by":"publisher","unstructured":"Chase M, Derler D, Goldfeder S, Orlandi C, Ramacher S, Rechberger C, Slamanig D, Zaverucha G (2017) Post-quantum zero-knowledge and signatures from symmetric-key primitives. In: Thuraisingham B, Evans D, Malkin T, Xu D (eds) Proceedings of the 2017 ACM SIGSAC conference on computer and communications security, CCS 2017, Dallas, TX, USA, October 30\u2013November 03, 2017. ACM, New York, NY, USA, pp 1825\u20131842. https:\/\/doi.org\/10.1145\/3133956.3133997","DOI":"10.1145\/3133956.3133997"},{"key":"453_CR20","unstructured":"Chavez-Saab J, Santos MC-R, DeFeo L, Eriksen JK, Hess B, Kohel D, Leroux A, Longa P, Meyer M, Panny L, Patranabis S, Petit C, Henr\u00edquez FR, Schaeffler S, Wesolowski B (2023) SQIsign: algorithm specifications and supporting documentation"},{"key":"453_CR21","doi-asserted-by":"publisher","unstructured":"Chvojka P, Jager T (2023) Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments. In: Boldyreva A, Kolesnikov V (eds) Public-key cryptography\u2014PKC 2023. Springer, Cham, pp 500\u2013529. https:\/\/doi.org\/10.1007\/978-3-031-31368-4_18","DOI":"10.1007\/978-3-031-31368-4_18"},{"key":"453_CR22","doi-asserted-by":"publisher","unstructured":"Chvojka P, Jager T, Slamanig D, Striecks C (2021) Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract). In: Bertino E, Shulman H, Waidner M (eds) Computer security\u2014ESORICS 2021. Springer, Cham, pp 64\u201385. https:\/\/doi.org\/10.1007\/978-3-030-88428-4_4","DOI":"10.1007\/978-3-030-88428-4_4"},{"key":"453_CR23","doi-asserted-by":"publisher","unstructured":"Cohen JD, Fischer MJ (1985) A robust and verifiable cryptographically secure election scheme (extended abstract). In: 26th Annual symposium on foundations of computer science, Portland, Oregon, USA, 21\u201323 October 1985. IEEE Computer Society, New York, NY, USA, pp 372\u2013382. https:\/\/doi.org\/10.1109\/SFCS.1985.2","DOI":"10.1109\/SFCS.1985.2"},{"key":"453_CR24","doi-asserted-by":"publisher","unstructured":"Dodis Y, Yum DH (2005) Time capsule signature. In: Patrick AS, Yung M (eds) Financial cryptography and data security, 9th international conference, FC 2005, Roseau, The Commonwealth of Dominica, February 28\u2013March 3, 2005, revised papers. Lecture notes in computer science, vol 3570. Springer, Berlin, pp 57\u201371. https:\/\/doi.org\/10.1007\/11507840_6","DOI":"10.1007\/11507840_6"},{"key":"453_CR25","doi-asserted-by":"publisher","unstructured":"Dwork C, Naor M (1992) Pricing via processing or combatting junk mail. In: Brickell EF (ed) Advances in cryptology\u2014CRYPTO \u201992, 12th annual international cryptology conference, Santa Barbara, California, USA, August 16\u201320, 1992, proceedings. Lecture notes in computer science, vol 740. Springer, Berlin, pp 139\u2013147. https:\/\/doi.org\/10.1007\/3-540-48071-4_10","DOI":"10.1007\/3-540-48071-4_10"},{"issue":"6","key":"453_CR26","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1145\/1039488.1039489","volume":"51","author":"C Dwork","year":"2004","unstructured":"Dwork C, Naor M, Sahai A (2004) Concurrent zero-knowledge. J ACM 51(6):851\u2013898. https:\/\/doi.org\/10.1145\/1039488.1039489","journal-title":"J ACM"},{"key":"453_CR27","doi-asserted-by":"publisher","unstructured":"El Kaafarani A, Katsumata S (2018) Attribute-based signatures for unbounded circuits in the ROM and efficient instantiations from lattices. In: Abdalla M, Dahab R (eds) Public-key cryptography\u2014PKC 2018\u201421st IACR international conference on practice and theory of public-key cryptography, Rio de Janeiro, Brazil, March 25\u201329, 2018, proceedings, part II. Lecture notes in computer science, vol 10770. Springer, Cham, pp 89\u2013119. https:\/\/doi.org\/10.1007\/978-3-319-76581-5_4","DOI":"10.1007\/978-3-319-76581-5_4"},{"key":"453_CR28","doi-asserted-by":"publisher","unstructured":"Fiat A, Shamir A (1986) How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko AM (ed) Advances in cryptology\u2014CRYPTO \u201986, Santa Barbara, California, USA, 1986, proceedings. Lecture notes in computer science, vol 263. Springer, Berlin, pp 186\u2013194. https:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"453_CR29","doi-asserted-by":"publisher","unstructured":"Fouque P, Pointcheval D, Zimmer S (2008) HMAC is a randomness extractor and applications to TLS. In: Abe M, Gligor VD (eds) Proceedings of the 2008 ACM symposium on information, computer and communications security, ASIACCS 2008, Tokyo, Japan, March 18\u201320, 2008. ACM, New York, NY, USA, pp 21\u201332. https:\/\/doi.org\/10.1145\/1368310.1368317","DOI":"10.1145\/1368310.1368317"},{"key":"453_CR30","doi-asserted-by":"publisher","unstructured":"Garay JA, Jakobsson M (2002) Timed release of standard digital signatures. In: Blaze M (ed) Financial cryptography, 6th international conference, FC 2002, Southampton, Bermuda, March 11\u201314, 2002, revised papers. Lecture notes in computer science, vol 2357. Springer, Berlin, pp 168\u2013182. https:\/\/doi.org\/10.1007\/3-540-36504-4_13","DOI":"10.1007\/3-540-36504-4_13"},{"key":"453_CR31","doi-asserted-by":"publisher","unstructured":"Goldwasser S, Micali S, Rackoff C (1985) The knowledge complexity of interactive proof-systems (extended abstract). In: Sedgewick R (ed) Proceedings of the 17th annual ACM symposium on theory of computing, May 6\u20138, 1985, Providence, Rhode Island, USA. ACM, New York, NY, USA, pp 291\u2013304. https:\/\/doi.org\/10.1145\/22145.22178","DOI":"10.1145\/22145.22178"},{"key":"453_CR32","doi-asserted-by":"publisher","unstructured":"Golovnev A, Lee J, Setty STV, Thaler J, Wahby RS (2023) Brakedown: linear-time and field-agnostic snarks for R1CS. In: Handschuh H, Lysyanskaya A (eds) Advances in cryptology\u2014CRYPTO 2023\u201443rd annual international cryptology conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20\u201324, 2023, proceedings, part II. Lecture notes in computer science, vol 14082. Springer, Cham, pp 193\u2013226. https:\/\/doi.org\/10.1007\/978-3-031-38545-2_7","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"453_CR33","doi-asserted-by":"publisher","unstructured":"Guillou LC, Quisquater J (1988) A \u201cparadoxical\u201d indentity-based signature scheme resulting from zero-knowledge. In: Goldwasser S (ed) Advances in cryptology\u2014CRYPTO \u201988, 8th annual international cryptology conference, Santa Barbara, California, USA, August 21\u201325, 1988, proceedings. Lecture notes in computer science, vol 403. Springer, New York, NY, pp 216\u2013231. https:\/\/doi.org\/10.1007\/0-387-34799-2_16","DOI":"10.1007\/0-387-34799-2_16"},{"key":"453_CR34","unstructured":"Hanke T, Movahedi M, Williams D (2018) DFINITY technology overview series, consensus system. CoRR arXiv:1805.04548"},{"key":"453_CR35","unstructured":"iden3: CircomLib. https:\/\/github.com\/iden3\/circomlib"},{"key":"453_CR36","unstructured":"iden3: rapidsnark. https:\/\/github.com\/iden3\/rapidsnark"},{"key":"453_CR37","unstructured":"Jacksoom Ozdemir A. circom-bigint. https:\/\/github.com\/jacksoom\/circom-bigint"},{"key":"453_CR38","doi-asserted-by":"publisher","unstructured":"Jakobsson M, Sako K, Impagliazzo R (1996) Designated verifier proofs and their applications. In: Maurer UM (ed) Advances in cryptology\u2014EUROCRYPT \u201996, international conference on the theory and application of cryptographic techniques, Saragossa, Spain, May 12\u201316, 1996, proceeding. Lecture notes in computer science, vol 1070. Springer, Berlin, pp 143\u2013154. https:\/\/doi.org\/10.1007\/3-540-68339-9_13","DOI":"10.1007\/3-540-68339-9_13"},{"key":"453_CR39","doi-asserted-by":"publisher","unstructured":"Katz J, Wang N (2003) Efficiency improvements for signature schemes with tight security reductions. In: Jajodia S, Atluri V, Jaeger T (eds) Proceedings of the 10th ACM conference on computer and communications security, CCS 2003, Washington, DC, USA, October 27\u201330, 2003. ACM, New York, NY, USA, pp 155\u2013164. https:\/\/doi.org\/10.1145\/948109.948132","DOI":"10.1145\/948109.948132"},{"key":"453_CR40","doi-asserted-by":"publisher","unstructured":"Kavousi A, Abadi A, Jovanovic P (2024) Timed secret sharing. In: Chung K, Sasaki Y (eds) Advances in cryptology\u2014ASIACRYPT 2024\u201430th international conference on the theory and application of cryptology and information security, Kolkata, India, December 9\u201313, 2024, proceedings, part VII. Lecture notes in computer science, vol 15490. Springer, Singapore, pp 129\u2013164. https:\/\/doi.org\/10.1007\/978-981-96-0941-3_5","DOI":"10.1007\/978-981-96-0941-3_5"},{"key":"453_CR41","unstructured":"Kelsey J, Brand\u00e3o LT, Peralta R, Booth H (2019) A reference for randomness beacons: format and protocol version 2. Technical report, National Institute of Standards and Technology"},{"key":"453_CR42","doi-asserted-by":"publisher","unstructured":"Kiltz E, Masny D, Pan J (2016) Optimal security proofs for signatures from identification schemes. In: Robshaw M, Katz J (eds) Advances in cryptology\u2014CRYPTO 2016\u201436th annual international cryptology conference, Santa Barbara, CA, USA, August 14\u201318, 2016, proceedings, part II. Lecture notes in computer science, vol 9815. Springer, Berlin, pp 33\u201361. https:\/\/doi.org\/10.1007\/978-3-662-53008-5_2","DOI":"10.1007\/978-3-662-53008-5_2"},{"key":"453_CR43","unstructured":"Lam TC, Tan C-C, Chang Y-J, Liu J-CS (2007) Timed zero-knowledge proof (TZKP) protocol (2006). https:\/\/api.semanticscholar.org\/CorpusID:18473854"},{"issue":"11","key":"453_CR44","doi-asserted-by":"publisher","first-page":"2549","DOI":"10.1007\/S10623-018-0461-X","volume":"86","author":"J Liu","year":"2018","unstructured":"Liu J, Jager T, Kakvi SA, Warinschi B (2018) How to build time-lock encryption. Des Codes Cryptogr 86(11):2549\u20132586. https:\/\/doi.org\/10.1007\/S10623-018-0461-X","journal-title":"Des Codes Cryptogr"},{"key":"453_CR45","doi-asserted-by":"publisher","unstructured":"Malavolta G, Thyagarajan SAK (2019) Homomorphic time-lock puzzles and applications. In: Boldyreva A, Micciancio D (eds) Advances in cryptology\u2014CRYPTO 2019\u201439th annual international cryptology conference, Santa Barbara, CA, USA, August 18\u201322, 2019, proceedings, part I. Lecture notes in computer science, vol 11692. Springer, Cham, pp 620\u2013649. https:\/\/doi.org\/10.1007\/978-3-030-26948-7_22","DOI":"10.1007\/978-3-030-26948-7_22"},{"key":"453_CR46","unstructured":"NIST Randomness Beacon (Version 2.0 Beta)\u2014work in progress. https:\/\/csrc.nist.gov\/Projects\/interoperable-randomness-beacons\/beacon-20"},{"key":"453_CR47","doi-asserted-by":"publisher","unstructured":"Pietrzak K (2019) Simple verifiable delay functions. In: Blum A (ed) 10th Innovations in theoretical computer science conference, ITCS 2019, January 10\u201312, 2019, San Diego, California, USA. LIPIcs, vol 124. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, pp 60\u201316015. https:\/\/doi.org\/10.4230\/LIPICS.ITCS.2019.60","DOI":"10.4230\/LIPICS.ITCS.2019.60"},{"key":"453_CR48","unstructured":"Polygon: polygon Plonky3 enables you to build modern zk-rollups. https:\/\/polygon.technology\/plonky3"},{"key":"453_CR49","unstructured":"Rivest RL, Shamir A, Wagner DA (1996) Time-lock puzzles and timed-release crypto. Technical report, USA"},{"key":"453_CR50","doi-asserted-by":"publisher","unstructured":"Sahai A (1999) Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: 40th Annual symposium on foundations of computer science, FOCS \u201999, 17\u201318 October, 1999, New York, NY, USA. IEEE Computer Society, New York, NY, USA, pp 543\u2013553. https:\/\/doi.org\/10.1109\/SFFCS.1999.814628","DOI":"10.1109\/SFFCS.1999.814628"},{"issue":"3","key":"453_CR51","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C Schnorr","year":"1991","unstructured":"Schnorr C (1991) Efficient signature generation by smart cards. J Cryptol 4(3):161\u2013174. https:\/\/doi.org\/10.1007\/BF00196725","journal-title":"J Cryptol"},{"key":"453_CR52","unstructured":"Stinson D (2001) Universal hash families and the leftover hash lemma, and applications to cryptography and computing. J Combin Math Combin Comput 42"},{"key":"453_CR53","unstructured":"Team PZ (2021) Plonky2: fast recursive arguments with PLONK and FRI. https:\/\/docs.rs\/crate\/plonky2\/latest\/source\/plonky2.pdf"},{"key":"453_CR54","doi-asserted-by":"publisher","unstructured":"Thyagarajan SAK, Bhat A, Malavolta G, D\u00f6ttling N, Kate A, Schr\u00f6der D (2020) Verifiable timed signatures made practical. In: Ligatti J, Ou X, Katz J, Vigna G (eds) CCS \u201920: 2020 ACM SIGSAC conference on computer and communications security, virtual event, USA, November 9\u201313, 2020. ACM, New York, NY, USA, pp 1733\u20131750. https:\/\/doi.org\/10.1145\/3372297.3417263","DOI":"10.1145\/3372297.3417263"},{"key":"453_CR55","doi-asserted-by":"publisher","unstructured":"Thyagarajan SAK, Malavolta G, Schmid F, Schr\u00f6der D (2022) Verifiable timed linkable ring signatures for scalable payments for Monero. In: Atluri V, Pietro RD, Jensen CD, Meng W (eds) Computer security\u2014ESORICS 2022\u201427th European symposium on research in computer security, Copenhagen, Denmark, September 26\u201330, 2022, proceedings, part II. Lecture notes in computer science, vol 13555. Springer, Cham, pp 467\u2013486. https:\/\/doi.org\/10.1007\/978-3-031-17146-8_23","DOI":"10.1007\/978-3-031-17146-8_23"},{"key":"453_CR56","unstructured":"Venturi D (2015) Zero-knowledge proofs and applications"},{"issue":"4","key":"453_CR57","doi-asserted-by":"publisher","first-page":"2113","DOI":"10.1007\/S00145-020-09364-X","volume":"33","author":"B Wesolowski","year":"2020","unstructured":"Wesolowski B (2020) Efficient verifiable delay functions. J Cryptol 33(4):2113\u20132147. https:\/\/doi.org\/10.1007\/S00145-020-09364-X","journal-title":"J Cryptol"},{"key":"453_CR58","unstructured":"Wuille P, Nick J, Ruffing T (2020) Schnorr Signatures for secp256k1. https:\/\/github.com\/bitcoin\/bips\/blob\/master\/bip-0340.mediawiki"},{"key":"453_CR59","doi-asserted-by":"publisher","unstructured":"Xie T, Zhang Y, Song D (2022) Orion: zero knowledge proof with linear prover time. In: Dodis Y, Shrimpton T (eds) Advances in cryptology\u2014CRYPTO 2022\u201442nd annual international cryptology conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15\u201318, 2022, proceedings, part IV. Lecture notes in computer science, vol 13510. Springer, Cham, pp 299\u2013328. https:\/\/doi.org\/10.1007\/978-3-031-15985-5_11","DOI":"10.1007\/978-3-031-15985-5_11"},{"key":"453_CR60","doi-asserted-by":"publisher","first-page":"5345","DOI":"10.1109\/TIFS.2023.3306107","volume":"18","author":"X Zhou","year":"2023","unstructured":"Zhou X, He D, Ning J, Luo M, Huang X (2023) Efficient construction of verifiable timed signatures and its application in scalable payments. IEEE Trans Inf Forensics Secur 18:5345\u20135358. https:\/\/doi.org\/10.1109\/TIFS.2023.3306107","journal-title":"IEEE Trans Inf Forensics Secur"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00453-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-025-00453-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00453-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T07:25:19Z","timestamp":1768980319000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s42400-025-00453-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,21]]},"references-count":60,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["453"],"URL":"https:\/\/doi.org\/10.1186\/s42400-025-00453-7","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,21]]},"assertion":[{"value":"11 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"None of the authors have any conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"110"}}