{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:05:29Z","timestamp":1770743129179,"version":"3.49.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683879","type":"print"},{"value":"9783031683886","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68388-6_6","type":"book-chapter","created":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T08:02:51Z","timestamp":1723795371000},"page":"129-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Cryptanalysis of\u00a0Lattice-Based Sequentiality Assumptions and Proofs of Sequential Work"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0419-7501","authenticated-orcid":false,"given":"Chris","family":"Peikert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5949-237X","authenticated-orcid":false,"given":"Yi","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,17]]},"reference":[{"key":"6_CR1","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. Quaderni di Matematica 13, 1\u201332 (2004). Preliminary version in STOC 1996"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-030-17656-3_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"H Abusalah","year":"2019","unstructured":"Abusalah, H., Kamath, C., Klein, K., Pietrzak, K., Walter, M.: Reversible proofs of sequential work. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 277\u2013291. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_10"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Cai, J., Lipton, R.J., Sedgewick, R., Yao, A.C.: Towards uncheatable benchmarks. In: Structure in Complexity Theory Conference, pp. 2\u201311 (1993)","DOI":"10.1109\/SCT.1993.336546"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-319-78375-8_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B Cohen","year":"2018","unstructured":"Cohen, B., Pietrzak, K.: Simple proofs of sequential work. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 451\u2013467. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_15"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"C Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139\u2013147. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_10"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Lai, R.W.F., Malavolta, G.: Lattice-based timed cryptography. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023. CRYPTO 2023. LNCS, vol. 14085, pp. 782\u2013804. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_25","DOI":"10.1007\/978-3-031-38554-4_25"},{"key":"6_CR7","unstructured":"May, T.C.: Timed-release crypto, February 1993. http:\/\/cypherpunks.venona.com\/date\/1993\/02\/msg00129.html"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.P.: Publicly verifiable proofs of sequential work. In: Innovations in Theoretical Computer Science (ITCS), pp. 373\u2013388 (2013)","DOI":"10.1145\/2422436.2422479"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007). Preliminary version in FOCS 2004","DOI":"10.1137\/S0097539705447360"},{"key":"6_CR11","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: Innovations in Theoretical Computer Science Conference (ITCS), volume 124 of LIPIcs, pp. 60:1\u201360:15 (2019)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 1\u201340 (2009). Preliminary version in STOC 2005","DOI":"10.1145\/1568318.1568324"},{"key":"6_CR13","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Technical report, Massachusetts Institute of Technology, Cambridge, MA, USA (1996)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997). Preliminary version in FOCS 1994","DOI":"10.1137\/S0097539795293172"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Vershynin, R.: Introduction to the non-asymptotic analysis of random matrices, chapter\u00a05, pp. 210\u2013268. Cambridge University Press, 2012. http:\/\/www-personal.umich.edu\/~romanv\/papers\/non-asymptotic-rmt-plain.pdf","DOI":"10.1017\/CBO9780511794308.006"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. J. Cryptol. 33(4), 2113\u20132147 (2020). Preliminary version in EUROCRYPT 2019","DOI":"10.1007\/s00145-020-09364-x"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68388-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T19:37:31Z","timestamp":1732649851000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68388-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683879","9783031683886"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68388-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}