{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T10:30:42Z","timestamp":1760956242250,"version":"3.40.3"},"publisher-location":"Cham","reference-count":61,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031683817"},{"type":"electronic","value":"9783031683824"}],"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-68382-4_13","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T09:02:41Z","timestamp":1723712561000},"page":"425-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Time-Lock Puzzles from\u00a0Lattices"],"prefix":"10.1007","author":[{"given":"Shweta","family":"Agrawalr","sequence":"first","affiliation":[]},{"given":"Giulio","family":"Malavolta","sequence":"additional","affiliation":[]},{"given":"Tianwei","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Cini, V., Lai, R.W., Malavolta, G., Thyagarajan, S.A.: Lattice-based snarks: publicly verifiable, preprocessing, and recursively composable. In: Dodis, Y., Shrimpton, T. (eds.) Annual International Cryptology Conference, vol. 13508, pp. 102\u2013132. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-15979-4_4","DOI":"10.1007\/978-3-031-15979-4_4"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-17653-2_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"S Agrawal","year":"2019","unstructured":"Agrawal, S.: Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 191\u2013225. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_7"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-662-47989-6_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"P Ananth","year":"2015","unstructured":"Ananth, P., Jain, A.: Indistinguishability obfuscation from compact functional encryption. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 308\u2013326. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_15"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-662-64331-0_28","volume-title":"Financial Cryptography and Data Security","author":"A Abadi","year":"2021","unstructured":"Abadi, A., Kiayias, A.: Multi-instance publicly verifiable time-lock puzzle and its applications. In: Borisov, N., Diaz, C. (eds.) FC 2021. LNCS, vol. 12675, pp. 541\u2013559. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-662-64331-0_28"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40041-4_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"J Alperin-Sheriff","year":"2013","unstructured":"Alperin-Sheriff, J., Peikert, C.: Practical bootstrapping in quasilinear time. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 1\u201320. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_1"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-030-77870-5_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"J Burdges","year":"2021","unstructured":"Burdges, J., De Feo, L.: Delay encryption. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 302\u2013326. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_11"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-030-36033-7_16","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2019","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. LNCS, vol. 11892, pp. 407\u2013437. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_16"},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00145-023-09471-5","volume":"36","author":"Z Brakerski","year":"2023","unstructured":"Brakerski, Z., D\u00f6ttling, N., Garg, S., Malavolta, G.: Candidate IO from homomorphic encryption schemes. J. Cryptol. 36(3), 27 (2023)","journal-title":"J. Cryptol."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Goldwasser, S., Jain, A., Paneth, O., Vaikuntanathan, V., Waters, B.: Time-lock puzzles from randomized encodings. In: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, pp. 345\u2013356 (2016)","DOI":"10.1145\/2840728.2840745"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Garg, S., Lin, H., Pass, R., Telang, S.: Succinct randomized encodings and their applications. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 439\u2013448 (2015)","DOI":"10.1145\/2746539.2746574"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-44598-6_15","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"D Boneh","year":"2000","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 236\u2013254. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_15"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Lattice-based FHE as secure as PKE. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, ITCS 2014, pp. 1-12, New York, NY, USA. Association for Computing Machinery (2014)","DOI":"10.1145\/2554797.2554799"},{"issue":"6","key":"13_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3234511","volume":"65","author":"N Bitansky","year":"2018","unstructured":"Bitansky, N., Vaikuntanathan, V.: Indistinguishability obfuscation from functional encryption. J. ACM (JACM) 65(6), 1\u201337 (2018)","journal-title":"J. ACM (JACM)"},{"key":"13_CR14","unstructured":"Chen, Y.C., Chow, S.S., Chung, K.M., Lai, R.W., Lin, W.K., Zhou, H.S.: Computation-trace indistinguishability obfuscation and its applications. IACR Cryptol. ePrint Arch. 2015, 406 (2015)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Canetti, R., Holmgren, J.: Fully succinct garbled RAM. In: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, pp. 169\u2013178 (2016)","DOI":"10.1145\/2840728.2840765"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Canetti, R., Holmgren, J., Jain, A., Vaikuntanathan, V.:Succinct garbling and indistinguishability obfuscation for RAM programs. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 429\u2013437 (2015)","DOI":"10.1145\/2746539.2746621"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-46800-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"JH Cheon","year":"2015","unstructured":"Cheon, J.H., Han, K., Lee, C., Ryu, H., Stehl\u00e9, D.: Cryptanalysis of the multilinear map over the integers. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 3\u201312. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_1"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: Snargs for p from LWE. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 68\u201379. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00016"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Cini, V., Lai, R.W., Malavolta, G.: Lattice-based succinct arguments from vanishing polynomials. In: Handschuh, H., Lysyanskaya, A. (eds.) Annual International Cryptology Conference, vol. 14082, pp. 72\u2013105. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_3","DOI":"10.1007\/978-3-031-38545-2_3"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-319-96881-0_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"Y Chen","year":"2018","unstructured":"Chen, Y., Vaikuntanathan, V., Wee, H.: GGH15 beyond permutation branching programs: proofs, attacks, and candidates. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 577\u2013607. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_20"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Dujmovic, J., Garg, R., Malavolta, G.: Time-lock puzzles with efficient batch solving. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-58723-8_11"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Hanzlik, L., Magri, B., Wohnig, S.: McFly: verifiable encryption to the future made practical. In: Baldimtsi, F., Cachin, C. (eds.) International Conference on Financial Cryptography and Data Security, vol. 13950, pp. 252\u2013269. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-47754-6_15","DOI":"10.1007\/978-3-031-47754-6_15"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-030-90456-2_15","volume-title":"Theory of Cryptography","author":"C Freitag","year":"2021","unstructured":"Freitag, C., Komargodski, I., Pass, R., Sirkin, N.: Non-malleable time-lock puzzles and applications. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13044, pp. 447\u2013479. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_15"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. PhD thesis, Stanford, CA, USA (2009). AAI3382729","DOI":"10.1145\/1536414.1536440"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"1353","DOI":"10.1007\/s00453-017-0276-6","volume":"79","author":"S Garg","year":"2017","unstructured":"Garg, S., Gentry, C., Halevi, S., Wichs, D.: On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input. Algorithmica 79, 1353\u20131373 (2017)","journal-title":"Algorithmica"},{"issue":"4","key":"13_CR26","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Sahai, A., Waters, B.: Witness encryption and its applications. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 467\u2013476 (2013)","DOI":"10.1145\/2488608.2488667"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Raykova, M., Wichs, D.: Outsourcing private ram computation. In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS), pp. 404\u2013413, Los Alamitos, CA, USA. IEEE Computer Society (2014)","DOI":"10.1109\/FOCS.2014.50"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: Reusable garbled circuits and succinct functional encryption. In: Proceedings of the 45th Annual ACM Symposium on Symposium on theory of computing, STOC 2013, pp. 555\u2013564, New York, NY, USA. ACM (2013)","DOI":"10.1145\/2488608.2488678"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Gay, R., Pass, R.: Indistinguishability obfuscation from circular security. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 736\u2013749 (2021)","DOI":"10.1145\/3406325.3451070"},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"C Gentry","year":"2013","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5"},{"key":"13_CR33","unstructured":"Glaeser, N., Seres, I.A., Zhu, M. and Bonneau, J.: Cicada: a framework for private non-interactive on-chain auctions and voting. Cryptology ePrint Archive (2023)"},{"issue":"4","key":"13_CR34","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.L.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"13_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/978-3-030-84245-1_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"S Hopkins","year":"2021","unstructured":"Hopkins, S., Jain, A., Lin, H.: Counterexamples to new circular security assumptions underlying iO. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 673\u2013700. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_23"},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"Hsieh, Y.C., Lin, H. and Luo, J.,. Attribute-based encryption for circuits of unbounded depth from lattices. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pp. 415\u2013434. IEEE (2023)","DOI":"10.1109\/FOCS57990.2023.00031"},{"key":"13_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/978-3-030-92518-5_26","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2021","author":"S Jaques","year":"2021","unstructured":"Jaques, S., Montgomery, H., Rosie, R., Roy, A.: Time-release cryptography from\u00a0minimal circuit assumptions. In: Adhikari, A., K\u00fcsters, R., Preneel, B. (eds.) INDOCRYPT 2021. LNCS, vol. 13143, pp. 584\u2013606. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92518-5_26"},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-030-64381-2_14","volume-title":"Theory of Cryptography","author":"J Katz","year":"2020","unstructured":"Katz, J., Loss, J., Xu, J.: On the security of time-lock puzzles and timed commitments. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 390\u2013413. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_14"},{"issue":"11","key":"13_CR39","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, S.A., Warinschi, B.: How to build time-lock encryption. Des. Codes Crypt. 86(11), 2549\u20132586 (2018). https:\/\/doi.org\/10.1007\/s10623-018-0461-x","journal-title":"Des. Codes Crypt."},{"key":"13_CR40","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, pp. 782\u2013804, vol. 14085. Springer, Cham.https:\/\/doi.org\/10.1007\/978-3-031-38554-4_25","DOI":"10.1007\/978-3-031-38554-4_25"},{"key":"13_CR41","first-page":"273","volume":"2017","author":"H Lin","year":"2017","unstructured":"Lin, H., Pass, R., Soni, P.: Two-round concurrent non-malleable commitment from time-lock puzzles. IACR Cryptol. ePrint Arch. 2017, 273 (2017)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"13_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/978-3-662-53008-5_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"E Miles","year":"2016","unstructured":"Miles, E., Sahai, A., Zhandry, M.: Annihilation attacks for multilinear maps: cryptanalysis of indistinguishability obfuscation over GGH13. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 629\u2013658. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_22"},{"key":"13_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/978-3-030-26948-7_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"G Malavolta","year":"2019","unstructured":"Malavolta, G., Thyagarajan, S.A.K.: Homomorphic time-lock puzzles and applications. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 620\u2013649. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_22"},{"key":"13_CR44","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem: Extended abstract. In: STOC 2009, page 333\u2013342, New York, NY, USA. Association for Computing Machinery (2009)","DOI":"10.1145\/1536414.1536461"},{"key":"13_CR45","doi-asserted-by":"crossref","unstructured":"Quach, W., Wee, H., Wichs, D.: Laconic function evaluation and applications. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 859\u2013870. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00086"},{"issue":"6","key":"13_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM (JACM) 56(6), 1\u201340 (2009)","journal-title":"J. ACM (JACM)"},{"key":"13_CR47","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. (1996)"},{"key":"13_CR48","doi-asserted-by":"publisher","unstructured":"Srinivasan, S., Loss, J., Malavolta, G., Nayak, K., Papamanthou, C., Thyagarajan, S.A.: Transparent batchable time-lock puzzles and applications to byzantine consensus. In: Boldyreva, A., Kolesnikov, V. (eds.) Public-Key Cryptography \u2013 PKC 2023, 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":"13_CR49","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, STOC 2014, pp. 475\u2013484, New York, NY, USA. Association for Computing Machinery (2014)","DOI":"10.1145\/2591796.2591825"},{"key":"13_CR50","doi-asserted-by":"crossref","unstructured":"Tyagi, N., Arun, A., Freitag, C., Wahby, R., Bonneau, J., Mazi\u00e8res, D.: Riggs: Decentralized sealed-bid auctions. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 1227\u20131241 (2023)","DOI":"10.1145\/3576915.3623182"},{"key":"13_CR51","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: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 1733\u20131750 (2020)","DOI":"10.1145\/3372297.3417263"},{"key":"13_CR52","doi-asserted-by":"crossref","unstructured":"Thyagarajan, S.A.K., Castagnos, G., Laguillaumie, F., Malavolta, G.: Efficient CCA timed commitments in class groups. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 2663\u20132684 (2021)","DOI":"10.1145\/3460120.3484773"},{"key":"13_CR53","doi-asserted-by":"crossref","unstructured":"Thyagarajan, S.A., Malavolta, G., Moreno-Sanchez, P.: Universal atomic swaps: secure exchange of coins across all blockchains. In: 2022 IEEE Symposium on Security and Privacy (SP), pp. 1299\u20131316. IEEE (2022)","DOI":"10.1109\/SP46214.2022.9833731"},{"key":"13_CR54","doi-asserted-by":"publisher","unstructured":"Thyagarajan, S.A., 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.) European Symposium on Research in Computer Security, 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":"13_CR55","doi-asserted-by":"publisher","unstructured":"Tsabary, R.: Candidate witness encryption from lattice techniques. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022, vol. 13507, pp. 535\u2013559. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_19","DOI":"10.1007\/978-3-031-15802-5_19"},{"key":"13_CR56","doi-asserted-by":"publisher","unstructured":"Vaikuntanathan, V., Wee, H., Wichs, D.: Witness encryption and ull-IO from evasive lwe. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2022, pp. 195\u2013221. Springer, Cham (2022).https:\/\/doi.org\/10.1007\/978-3-031-22963-3_7","DOI":"10.1007\/978-3-031-22963-3_7"},{"key":"13_CR57","doi-asserted-by":"publisher","unstructured":"Wee, H.: Optimal broadcast encryption and CP-ABE from evasive lattice assumptions. In: Dunkelman, O., Dziembowski, S. (eds.) Annual International Conference on the Theory and Applications of Cryptographic Techniques, vol. 13276, pp. 217\u2013241. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_8","DOI":"10.1007\/978-3-031-07085-3_8"},{"key":"13_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-77883-5_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"H Wee","year":"2021","unstructured":"Wee, H., Wichs, D.: Candidate obfuscation via oblivious LWE sampling. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 127\u2013156. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_5"},{"key":"13_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-030-64375-1_15","volume-title":"Theory of Cryptography","author":"J Wan","year":"2020","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.) TCC 2020. LNCS, vol. 12550, pp. 412\u2013456. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_15"},{"key":"13_CR60","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Protocols for secure computations (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982, pp. 160\u2013164. IEEE Computer Society (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"13_CR61","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27-29 October 1986, pp. 162\u2013167. IEEE Computer Society (1986)","DOI":"10.1109\/SFCS.1986.25"}],"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-68382-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T19:04:13Z","timestamp":1732647853000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68382-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683817","9783031683824"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68382-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 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"}}]}}