{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:44:11Z","timestamp":1780069451855,"version":"3.54.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587221","type":"print"},{"value":"9783031587238","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-58723-8_11","type":"book-chapter","created":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T12:01:49Z","timestamp":1715083309000},"page":"311-341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Time-Lock Puzzles with\u00a0Efficient Batch Solving"],"prefix":"10.1007","author":[{"given":"Jesko","family":"Dujmovic","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rachit","family":"Garg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giulio","family":"Malavolta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,5,8]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Banerjee, A., Fuchsbauer, G., Peikert, C., Pietrzak, K., Stevens, S.: Key-homomorphic constrained pseudorandom functions. In: Dodis, Y., Nielsen, J.B. (eds.) Theory of Cryptography, TCC 2015. LNCS, vol. 9015, pp. 31\u201360. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_2","DOI":"10.1007\/978-3-662-46497-7_2"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Banerjee, A., Peikert, C.: New and improved key-homomorphic pseudorandom functions. In: Garay, J.A., Gennaro, R. (eds.) Advances in Cryptology, CRYPTO 2014. LNCS, vol. 8616, pp. 353\u2013370. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_20","DOI":"10.1007\/978-3-662-44371-2_20"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Barak, B., et al.: On the (Im)possibility of obfuscating programs. In: Kilian, J. (ed.) Advances in Cryptology, CRYPTO 2001. LNCS, vol. 2139, pp. 1\u201318. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_1","DOI":"10.1007\/3-540-44647-8_1"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Garg, S., Lin, H., Pass, R., Telang, S.: Succinct randomized encodings and their applications. In: Servedio, R.A., Rubinfeld, R. (eds.) STOC. ACM, New York (2015)","DOI":"10.1145\/2746539.2746574"},{"key":"11_CR5","doi-asserted-by":"crossref","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)","DOI":"10.1145\/2840728.2840745"},{"key":"11_CR6","unstructured":"Blackstone, T.: a16z releases anonymous voting system for ethereum (2023). https:\/\/cointelegraph.com\/news\/a16z-releases-anonymous-voting-system-for-ethereum. Accessed 27 Feb 2024"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Boneh, D., Boyen, X.: Secure identity based encryption without random oracles. In: Franklin, M. (ed.) Advances in Cryptology, CRYPTO 2004. LNCS, vol. 3152, pp. 443\u2013459. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_27","DOI":"10.1007\/978-3-540-28628-8_27"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) Theory of Cryptography. LNCS, vol. 3378, pp. 325\u2013341. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_18","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Boneh, D., Lewi, K., Montgomery, H., Raghunathan, A.: Key homomorphic PRFs and their applications. In: Canetti, R., Garay, J.A. (eds.) Advances in Cryptology, CRYPTO 2013. LNCS, vol. 8042, pp. 410\u2013428. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_23","DOI":"10.1007\/978-3-642-40041-4_23"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (ed.) Advances in Cryptology, CRYPTO 2000. LNCS, vol. 1880, pp. 236\u2013254. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_15","DOI":"10.1007\/3-540-44598-6_15"},{"key":"11_CR11","doi-asserted-by":"crossref","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.) TCC (2019)","DOI":"10.1007\/978-3-030-36033-7_16"},{"key":"11_CR12","unstructured":"Brakerski, Z., D\u00f6ttling, N., Garg, S., Malavolta, G.: Factoring and pairings are not necessary for IO: circular-secure LWE suffices. In: Bojanczyk, M., Merelli, E., Woodruff, D.P. (eds.) ICALP (2022)"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Constrained key-homomorphic PRFs from standard lattice assumptions - or: How to secretly embed a circuit in your PRF. In: Dodis, Y., Nielsen, J.B. (eds.) Theory of Cryptography, TCC 2015. LNCS, vol. 9015, pp. 1\u201330. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_1","DOI":"10.1007\/978-3-662-46497-7_1"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Burdges, J., De Feo, L.: Delay encryption. In: Canteaut, A., Standaert, F.X. (eds.) Advances in Cryptology, EUROCRYPT 2021. LNCS, vol. 12696, pp. 302\u2013326. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_11","DOI":"10.1007\/978-3-030-77870-5_11"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Carmer, B., Malozemoff, A.J., Raykova, M.: 5Gen-C: multi-input functional encryption and program obfuscation for arithmetic circuits. In: CCS (2017)","DOI":"10.1145\/3133956.3133983"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. J. Cryptol. 25(4), 601\u2013639 (2012)","DOI":"10.1007\/s00145-011-9105-2"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Chandran, N., Raghuraman, S., Vinayagamurthy, D.: Reducing depth in constrained PRFs: from bit-fixing to $$\\textbf{NC}^1$$. In: Cheng, C., Chung, K., Persiano, G., Yang, B. (eds.) Public-Key Cryptography, PKC 2016. LNCS, vol. 9615, pp. 359\u2013385. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49387-8_14","DOI":"10.1007\/978-3-662-49387-8_14"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Chen, L., Harrison, K., Soldera, D., Smart, N.P.: Applications of multiple trust authorities in pairing based cryptosystems. In: Davida, G.I., Frankel, Y., Rees, O. (eds.) Infrastructure Security, InfraSec 2002. LNCS, vol. 2437, pp. 260\u2013275. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45831-X_18","DOI":"10.1007\/3-540-45831-X_18"},{"key":"11_CR19","unstructured":"Cline, D., Dryja, T., Narula, N.: Clockwork: an exchange protocol for proofs of non front-running. The Stanford Blockchain Conference 2020 (2020)"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Hanzlik, L., Magri, B., Wohnig, S.: McFly: verifiable encryption to\u00a0the\u00a0future made practical. In: Baldimtsi, F., Cachin, C. (eds.) Financial Cryptography and Data Security, FC 2023, pp. 252\u2013269. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-47754-6_15","DOI":"10.1007\/978-3-031-47754-6_15"},{"key":"11_CR21","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Conference on the Theory and Application of Cryptographic Techniques (1986)"},{"key":"11_CR22","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.) Theory of Cryptography, TCC 2021. LNCS, vol. 13044, pp. 447\u2013479. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_15","DOI":"10.1007\/978-3-030-90456-2_15"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: FOCS (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Sahai, A., Waters, B.: Witness encryption and its applications. IACR Cryptol. ePrint Arch. (2013)","DOI":"10.1145\/2488608.2488667"},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"Gay, R., Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification. In: Canteaut, A., Standaert, F.-X. (eds.) Advances in Cryptology. EUROCRYPT 2021. LNCS, vol. 12698, pp. 97\u2013126. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_4","DOI":"10.1007\/978-3-030-77883-5_4"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Gay, R., Pass, R.: Indistinguishability obfuscation from circular security. In: Khuller, S., Williams, V.V. (eds.) STOC (2021)","DOI":"10.1145\/3406325.3451070"},{"key":"11_CR27","doi-asserted-by":"publisher","unstructured":"Groth, J., Kohlweiss, M., Maller, M., Meiklejohn, S., Miers, I.: Updatable and universal common reference strings with applications to\u00a0zk-SNARKs. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology. CRYPTO 2018. LNCS, vol. 10993, pp. 698\u2013728. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_24","DOI":"10.1007\/978-3-319-96878-0_24"},{"key":"11_CR28","unstructured":"Hall, P.: On representatives of subsets. J. Lond. Math. Soc. (1935)"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Karp, R.M.: An n5\/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","DOI":"10.1137\/0202019"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Khuller, S., Williams, V.V. (eds.) STOC (2021)","DOI":"10.1145\/3406325.3451093"},{"key":"11_CR31","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from LPN over $${\\mathbb{F}}_p$$, DLIN, and PRGs in $$NC^0$$. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology, EUROCRYPT 2022. LNCS, vol. 13275, pp. 670\u2013699. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_23","DOI":"10.1007\/978-3-031-06944-4_23"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Lewi, K., et al.: 5Gen: a framework for prototyping applications using multilinear maps and matrix branching programs. In: CCS (2016)","DOI":"10.1145\/2976749.2978314"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Lin, H., Pass, R., Soni, P.: Two-round concurrent non-malleable commitment from time-lock puzzles. IACR Cryptol. ePrint Arch. (2017)","DOI":"10.1109\/FOCS.2017.59"},{"key":"11_CR34","unstructured":"Liu, J., Kakvi, S.A., Warinschi, B.: Extractable witness encryption and timed-release encryption from bitcoin. IACR Cryptol. ePrint Arch. (2015)"},{"key":"11_CR35","doi-asserted-by":"publisher","unstructured":"Malavolta, G., Thyagarajan, S.A.K.: Homomorphic time-lock puzzles and applications. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology, CRYPTO 2019. LNCS, vol. 11692, pp. 620\u2013649. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_22","DOI":"10.1007\/978-3-030-26948-7_22"},{"key":"11_CR36","doi-asserted-by":"publisher","unstructured":"Naor, M., Pinkas, B., Reingold, O.: Distributed pseudo-random functions and KDCS. In: Stern, J. (ed.) Advances in Cryptology, EUROCRYPT 1999. LNCS, vol. 1592, pp. 327\u2013346. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_23","DOI":"10.1007\/3-540-48910-X_23"},{"key":"11_CR37","unstructured":"Nikolaenko, V., Ragsdale, S., Bonneau, J., Boneh, D.: Powers-of-tau to the people: decentralizing setup ceremonies. IACR Cryptol. ePrint Arch. (2022)"},{"key":"11_CR38","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto (1996)"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Shmoys, D.B. (ed.) STOC (2014)","DOI":"10.1145\/2591796.2591825"},{"key":"11_CR40","doi-asserted-by":"publisher","unstructured":"Srinivasan, S., et al.: Transparent batchable time-lock puzzles and applications to Byzantine consensus. In: Boldyreva, A., Kolesnikov, V. (eds.) Public-Key Cryptography. PKC 2023. LNCS, vol. 13940, pp. 554\u2013584. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_20","DOI":"10.1007\/978-3-031-31368-4_20"},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"Thyagarajan, S.A.K., Bhat, A., Malavolta, G., D\u00f6ttling, N., Kate, A., Schr\u00f6der, D.: Verifiable timed signatures made practical. In: CCS, pp. 1733\u20131750 (2020)","DOI":"10.1145\/3372297.3417263"},{"key":"11_CR42","doi-asserted-by":"publisher","unstructured":"Thyagarajan, S.A.K., Malavolta, G., Schmid, F., Schr\u00f6der, D.: Verifiable timed linkable ring signatures for scalable payments for monero. In: Atluri, V., Di Pietro, R., Jensen, C.D., Meng, W. (eds.) Computer Security. ESORICS 2022. LNCS, vol. 13555, pp. 467\u2013486. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17146-8_23","DOI":"10.1007\/978-3-031-17146-8_23"},{"key":"11_CR43","doi-asserted-by":"publisher","unstructured":"Wan, J., Xiao, H., Devadas, S., Shi, E.: Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions. In: Pass, R., Pietrzak, K. (eds.) Theory of Cryptography, TCC 2020. LNCS, vol. 12550, pp. 412\u2013456. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_15","DOI":"10.1007\/978-3-030-64375-1_15"},{"key":"11_CR44","doi-asserted-by":"publisher","unstructured":"Wee, H., Wichs, D.: Candidate obfuscation via oblivious LWE sampling. In: Canteaut, A., Standaert, F. (eds.) Advances in Cryptology. EUROCRYPT 2021. LNCS, vol. 12698, pp. 127\u2013156. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_5","DOI":"10.1007\/978-3-030-77883-5_5"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58723-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T01:22:40Z","timestamp":1778116960000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58723-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587221","9783031587238"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58723-8_11","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":"8 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","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":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}