{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T03:47:49Z","timestamp":1752551269005,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030920746"},{"type":"electronic","value":"9783030920753"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92075-3_13","type":"book-chapter","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T19:21:35Z","timestamp":1638300095000},"page":"367-397","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On Time-Lock Cryptographic Assumptions in\u00a0Abelian Hidden-Order Groups"],"prefix":"10.1007","author":[{"given":"Aron","family":"van Baarsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Stevens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,1]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Aigner, M., Ziegler, G.: Proofs from the Book, vol. 274. Springer (2010). https:\/\/link.springer.com\/book\/10.1007\/978-3-642-00856-6","DOI":"10.1007\/978-3-642-00856-6"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"van Baarsen, A., Stevens, M.: On time-lock cryptographic assumptions in abelian hidden-order groups. Cryptology ePrint Archive, Report 2021\/1184 (2021)","DOI":"10.1007\/978-3-030-92075-3_13"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/A:1014927327846","volume":"25","author":"I Biehl","year":"2002","unstructured":"Biehl, I., Buchmann, J., Hamdy, S., Meyer, A.: A signature scheme based on the intractability of computing roots. Des. Codes Cryptogr. 25(3), 223\u2013236 (2002)","journal-title":"Des. Codes Cryptogr."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Block, A.R., Holmgren, J., Rosen, A., Rothblum, R.D., Soni, P.: Time- and space-efficient arguments from groups of unknown order. In: CRYPTO (4). LNCS, vol. 12828, pp. 123\u2013152. Springer (2021). https:\/\/link.springer.com\/chapter\/10.1007\/978-3-030-84259-8_5","DOI":"10.1007\/978-3-030-84259-8_5"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Boneh, D., Bonneau, J., Bunz, B., Fisch, B.: Verifiable delay functions. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology. LNCS, vol. 10991. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Boneh, D., Bunz, B., Fisch, B.: Batching techniques for accumulators with applications to IOPs and stateless blockchains. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology. LNCS, vol. 11692. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_20","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Boneh, D., B\u00fcnz, B., Fisch, B.: A survey of two verifiable delay functions. Cryptology ePrint Archive, Report 2018\/712 (2018)","DOI":"10.1007\/978-3-319-96884-1_25"},{"issue":"252","key":"13_CR8","doi-asserted-by":"publisher","first-page":"2017","DOI":"10.1090\/S0025-5718-05-01740-0","volume":"74","author":"J Buchmann","year":"2005","unstructured":"Buchmann, J., Schmidt, A.: Computing the structure of a finite abelian group. Math. Comput. 74(252), 2017\u20132026 (2005)","journal-title":"Math. Comput."},{"key":"13_CR9","unstructured":"Buchmann, J., Vollmer, U.: Binary quadratic forms - an algorithmic approach, Algorithms and computation in mathematics, vol. 20. Springer (2007). https:\/\/link.springer.com\/book\/10.1007\/978-3-540-46368-9"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02351719","volume":"1","author":"J Buchmann","year":"1988","unstructured":"Buchmann, J., Williams, H.C.: A key-exchange system based on imaginary quadratic fields. J. Cryptol. 1(2), 107\u2013118 (1988)","journal-title":"J. Cryptol."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent snarks from DARK compilers. In: EUROCRYPT (1). LNCS, vol. 12105, pp. 677\u2013706. Springer (2020). https:\/\/link.springer.com\/chapter\/10.1007\/978-3-030-45721-1_24","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Cohen, H., Lenstra, H.: Heuristics on class groups of number fields. In: Number Theory Noordwijkerhout 1983, pp. 33\u201362. Springer (1984). https:\/\/link.springer.com\/chapter\/10.1007\/BFb0099440","DOI":"10.1007\/BFb0099440"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Damgard, I., Fujisaki, E.: A statistically-hiding integer commitment scheme based on groups with hidden order. In: Zheng, Y. (eds.) Advances in Cryptology. LNCS, vol. 2501. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_8","DOI":"10.1007\/3-540-36178-2_8"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Damgard, I., Koprowski, M.: Generic lower bounds for root extraction and signature schemes in general groups. In: Knudsen, L.R. (eds.) Advances in Cryptology. LNCS, vol. 2332. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_17","DOI":"10.1007\/3-540-46035-7_17"},{"key":"13_CR15","unstructured":"Dusart, P.: Autour de la fonction qui compte le nombre de nombres premiers. Ph.D. thesis, Universit\u00e9 de Limoges (1998)"},{"key":"13_CR16","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. LNCS, vol. 12107. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_5","DOI":"10.1007\/978-3-030-45727-3_5"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology. Lecture Notes in Computer Science, vol. 10992. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"13_CR18","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.) Theory of Cryptography. TCC 2020. LNCS, vol. 12552. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_14","DOI":"10.1007\/978-3-030-64381-2_14"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Landerreche, E., Stevens, M., Schaffner, C.: Non-interactive cryptographic timestamping based on verifiable delay functions. In: Financial Cryptography. LNCS, vol. 12059, pp. 541\u2013558. Springer (2020). https:\/\/link.springer.com\/chapter\/10.1007\/978-3-030-51280-4_29","DOI":"10.1007\/978-3-030-51280-4_29"},{"key":"13_CR20","unstructured":"Lindhurst, S.: Computing roots in finite fields and groups, with a jaunt through sums of digits. Ph.D. thesis, The University of Wisconsin\u2013Madison (1997)"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Maurer, U., Wolf, S.: Lower bounds on generic algorithms in groups. In: Nyberg, K. (eds.) Advances in Cryptology. LNCS, vol. 1403. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054118","DOI":"10.1007\/BFb0054118"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Nechaev, V.: Complexity of a determinate algorithm for the discrete logarithm. Math. Notes 55(2), 165\u2013172 (1994)","DOI":"10.1007\/BF02113297"},{"key":"13_CR23","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: ITCS. LIPIcs, vol. 124, pp. 1\u201315. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"13_CR24","unstructured":"Rabin, M.O.: Digitalized signatures and public-key functions as intractable as factorization. Tech. Rep. Massachusetts Inst. Technol. Cambridge Lab Comput. Sci. (1979)"},{"issue":"2","key":"13_CR25","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0022-0000(83)90042-9","volume":"27","author":"MO Rabin","year":"1983","unstructured":"Rabin, M.O.: Transaction protection by beacons. J. Comput. Syst. Sci. 27(2), 256\u2013267 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR26","unstructured":"Rivest, R., Shamir, A., Wagner, D.: Time-lock puzzles and timed-release crypto. Tech. Rep. Massachusetts Inst. Technol. (1996)"},{"key":"13_CR27","doi-asserted-by":"publisher","unstructured":"Rotem, L., Segev, G.: Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions. In: Micciancio, D., Ristenpart, T. (eds.) Advances in Cryptology. Lecture Notes in Computer Science, vol. 12172. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_17","DOI":"10.1007\/978-3-030-56877-1_17"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Rotem, L., Segev, G., Shahaf, I.: Generic-group delay functions require hidden-order groups. In: EUROCRYPT (3). LNCS, vol. 12107, pp. 155\u2013180. Springer (2020). https:\/\/link.springer.com\/chapter\/10.1007\/978-3-030-45727-3_6","DOI":"10.1007\/978-3-030-45727-3_6"},{"issue":"4","key":"13_CR29","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701\u2013717 (1980)","journal-title":"J. ACM"},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (eds.) Advances in Cryptology. LNCS, vol. 1233. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18","DOI":"10.1007\/3-540-69053-0_18"},{"key":"13_CR31","doi-asserted-by":"publisher","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: Ishai, Y., Rijmen, V. (eds.) Advances in Cryptology. LNCS, vol. 11478. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_13","DOI":"10.1007\/978-3-030-17659-4_13"},{"key":"13_CR32","doi-asserted-by":"publisher","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (eds.) Symbolic and Algebraic Computation. LNCS, vol. 72. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_73","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92075-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T00:06:25Z","timestamp":1732925185000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92075-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030920746","9783030920753"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92075-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"341","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.21","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.61","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}