{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:13:42Z","timestamp":1743081222547,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031757563"},{"type":"electronic","value":"9783031757570"}],"license":[{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-75757-0_12","type":"book-chapter","created":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T11:03:12Z","timestamp":1729594992000},"page":"232-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ChronoCloak: An Integrated Solution for\u00a0Mitigating Premature Disclosure in\u00a0Oblivious Digital Dissemination"],"prefix":"10.1007","author":[{"given":"Ahmed","family":"Zawia","sequence":"first","affiliation":[]},{"given":"M. Anwar","family":"Hasan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,17]]},"reference":[{"key":"12_CR1","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":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-030-64834-3_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"N Alamati","year":"2020","unstructured":"Alamati, N., De Feo, L., Montgomery, H., Patranabis, S.: Cryptographic group actions and applications. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 411\u2013439. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_14"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-030-92075-3_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"M Arapinis","year":"2021","unstructured":"Arapinis, M., Lamprou, N., Zacharias, T.: Astrolabous: a\u00a0universally composable time-lock encryption scheme. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13091, pp. 398\u2013426. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92075-3_14"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Badrinarayanan, S., Masny, D., Mukherjee, P.: Efficient and tight oblivious transfer from PKE with tight multi-user security. In: Applied Cryptography and Network Security - 20th International Conference, ACNS 2022, LNCS, vol. 13269, pp. 626\u2013642. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09234-3_31","DOI":"10.1007\/978-3-031-09234-3_31"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Badrinarayanan, S., Masny, D., Mukherjee, P., Patranabis, S., Raghuraman, S., Sarkar, P.: Round-optimal oblivious transfer and MPC from computational CSIDH. In: Boldyreva, A., Kolesnikov, V. (eds.) Public-Key Cryptography - PKC 2023. LNCS, vol. 13940, pp. 376\u2013405. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_14","DOI":"10.1007\/978-3-031-31368-4_14"},{"key":"12_CR6","unstructured":"Barreto, P., Oliveira, G., Benits, W.: Supersingular isogeny oblivious transfer. IACR Cryptol. ePrint Arch. p.\u00a0459 (2018), https:\/\/eprint.iacr.org\/2018\/459"},{"key":"12_CR7","unstructured":"Barreto, P.S.L.M., David, B., Dowsley, R., Morozov, K., Nascimento, A.C.A.: A framework for efficient adaptively secure composable oblivious transfer in the ROM. CoRR abs\/1710.08256 (2017). http:\/\/arxiv.org\/abs\/1710.08256"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Baum, C., David, B., Dowsley, R., Kishore, R., Nielsen, J.B., Oechsner, S.: CRAFT: composable randomness beacons and output-independent abort MPC from time. In: Boldyreva, A., Kolesnikov, V. (eds.) Public-Key Cryptography - PKC 2023. LNCS, vol. 13940, pp. 439\u2013470. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_16","DOI":"10.1007\/978-3-031-31368-4_16"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-030-77883-5_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"C Baum","year":"2021","unstructured":"Baum, C., David, B., Dowsley, R., Nielsen, J.B., Oechsner, S.: TARDIS: a foundation of time-lock puzzles in UC. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 429\u2013459. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_15"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-030-34578-5_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"W Beullens","year":"2019","unstructured":"Beullens, W., Kleinjung, T., Vercauteren, F.: CSI-FiSh: efficient isogeny based signatures through class group computations. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 227\u2013247. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_9"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Branco, P., D\u00f6ttling, N., Srinivasan, A.: A framework for statistically sender private OT with optimal rate. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023. Lecture Notes in Computer Science, vol. 14081, pp. 548\u2013576. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_18","DOI":"10.1007\/978-3-031-38557-5_18"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145 (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. J. Cryptol. 19(2), 135\u2013167 (2006). https:\/\/doi.org\/10.1007\/s00145-005-0419-9","DOI":"10.1007\/s00145-005-0419-9"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-030-64840-4_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"R Canetti","year":"2020","unstructured":"Canetti, R., Sarkar, P., Wang, X.: Efficient and round-optimal oblivious transfer and commitment with adaptive security. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 277\u2013308. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_10"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Castryck, W., Decru, T.: An efficient key recovery attack on SIDH. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology - EUROCRYPT 2023. LNCS, vol. 14008, pp. 423\u2013447. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_15","DOI":"10.1007\/978-3-031-30589-4_15"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. In: Peyrin, T., Galbraith, S. (eds.) Advances in Cryptology - ASIACRYPT 2018. LNCS, vol. 11274, pp. 395\u2013427. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_15","DOI":"10.1007\/978-3-030-03332-3_15"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Ch\u00e1vez-Saab, J., Rodr\u00edguez-Henr\u00edquez, F., Tibouchi, M.: Verifiable isogeny walks: Towards an isogeny-based postquantum VDF. In: Selected Areas in Cryptography - 28th International Conference, SAC 2021. LNCS, vol. 13203, pp. 441\u2013460. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-99277-4_21","DOI":"10.1007\/978-3-030-99277-4_21"},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23\u201325 October 1995, pp. 41\u201350. IEEE Computer Society (1995). https:\/\/doi.org\/10.1109\/SFCS.1995.492461","DOI":"10.1109\/SFCS.1995.492461"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-22174-8_3","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2015","author":"T Chou","year":"2015","unstructured":"Chou, T., Orlandi, C.: The simplest protocol for oblivious transfer. In: Lauter, K., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LATINCRYPT 2015. LNCS, vol. 9230, pp. 40\u201358. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22174-8_3"},{"key":"12_CR20","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":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-48910-X_6","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"G Di Crescenzo","year":"1999","unstructured":"Di Crescenzo, G., Ostrovsky, R., Rajagopalan, S.: Conditional oblivious transfer and timed-release encryption. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 74\u201389. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_6"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-12280-9_10","volume-title":"Cryptology and Network Security","author":"B David","year":"2014","unstructured":"David, B., Dowsley, R., Nascimento, A.C.A.: Universally composable oblivious transfer based on a variant of LPN. In: Gritzalis, D., Kiayias, A., Askoxylakis, I. (eds.) CANS 2014. LNCS, vol. 8813, pp. 143\u2013158. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12280-9_10"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1007\/978-3-030-45724-2_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"N D\u00f6ttling","year":"2020","unstructured":"D\u00f6ttling, N., Garg, S., Hajiabadi, M., Masny, D., Wichs, D.: Two-round oblivious transfer from CDH or LPN. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 768\u2013797. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_26"},{"key":"12_CR24","unstructured":"Eldefrawy, K., Jakkamsetti, S., Terner, B., Yung, M.: Standard model time-lock puzzles: defining security and constructing via composition. IACR Cryptol. ePrint Arch, p.\u00a0439 (2023). https:\/\/eprint.iacr.org\/2023\/439"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-030-45727-3_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"N Ephraim","year":"2020","unstructured":"Ephraim, N., Freitag, C., Komargodski, I., Pass, R.: Continuous verifiable delay functions. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 125\u2013154. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_5"},{"key":"12_CR26","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":"12_CR27","doi-asserted-by":"publisher","first-page":"105975","DOI":"10.1016\/J.IPL.2020.105975","volume":"161","author":"ZA Gen\u00e7","year":"2020","unstructured":"Gen\u00e7, Z.A., Iovino, V., Rial, A.: The simplest protocol for oblivious transfer revisited. Inf. Process. Lett. 161, 105975 (2020). https:\/\/doi.org\/10.1016\/J.IPL.2020.105975","journal-title":"Inf. Process. Lett."},{"key":"12_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14303-8","volume-title":"Efficient Secure Two-Party Protocols: Techniques and Constructions","author":"C Hazay","year":"2010","unstructured":"Hazay, C., Lindell, Y.: Efficient Secure Two-Party Protocols: Techniques and Constructions, 1st edn. Springer-Verlag, Berlin, Heidelberg (2010)","edition":"1"},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32"},{"key":"12_CR30","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"},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-030-77870-5_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"Y-F Lai","year":"2021","unstructured":"Lai, Y.-F., Galbraith, S.D., Delpech de Saint Guilhem, C.: Compact, efficient and UC-secure isogeny-based oblivious transfer. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 213\u2013241. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_8"},{"key":"12_CR32","unstructured":"Lai, Y.F., Galbraith, S.D., de\u00a0Saint\u00a0Guilhem, C.D.: Compact, efficient and uc-secure isogeny-based oblivious transfer. Cryptology ePrint Archive, Paper 2020\/1012 (2020). https:\/\/eprint.iacr.org\/2020\/1012"},{"issue":"4","key":"12_CR33","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1504\/IJACT.2017.10010315","volume":"3","author":"AK Lenstra","year":"2017","unstructured":"Lenstra, A.K., Wesolowski, B.: Trustworthy public randomness with sloth, unicorn, and TRX. Int. J. Appl. Cryptogr. 3(4), 330\u2013343 (2017). https:\/\/doi.org\/10.1504\/IJACT.2017.10010315","journal-title":"Int. J. Appl. Cryptogr."},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-319-76578-5_18","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"B Li","year":"2018","unstructured":"Li, B., Micciancio, D.: Equational security proofs of oblivious transfer protocols. In: Abdalla, M., Dahab, R. (eds.) PKC 2018. LNCS, vol. 10769, pp. 527\u2013553. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76578-5_18"},{"key":"12_CR35","unstructured":"Loe, A.F., Medley, L., O\u2019Connell, C., Quaglia, E.A.: A practical verifiable delay function and delay encryption scheme. IACR Cryptol. ePrint Arch. p.\u00a01293 (2021). https:\/\/eprint.iacr.org\/2021\/1293"},{"issue":"3","key":"12_CR36","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1016\/j.jss.2010.11.886","volume":"84","author":"X Ma","year":"2011","unstructured":"Ma, X., Xu, L., Zhang, F.: Oblivious transfer with timed-release receiver privacy. J. Syst. Softw. 84(3), 460\u2013464 (2011). https:\/\/doi.org\/10.1016\/j.jss.2010.11.886","journal-title":"J. Syst. Softw."},{"key":"12_CR37","doi-asserted-by":"publisher","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.P.: Publicly verifiable proofs of sequential work. In: Kleinberg, R.D. (ed.) Innovations in Theoretical Computer Science, ITCS 2013, Berkeley, CA, USA, 9-12 January 2013, pp. 373\u2013388. ACM (2013). https:\/\/doi.org\/10.1145\/2422436.2422479","DOI":"10.1145\/2422436.2422479"},{"key":"12_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-030-64834-3_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"D Micciancio","year":"2020","unstructured":"Micciancio, D., Sorrell, J.: Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 381\u2013407. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_13"},{"key":"12_CR39","doi-asserted-by":"publisher","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: Blum, A. (ed.) 10th Innovations in Theoretical Computer Science Conference, ITCS 2019, 10\u201312 January 2019, San Diego, California, USA. LIPIcs, vol.\u00a0124, pp. 60:1\u201360:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2019.60","DOI":"10.4230\/LIPIcs.ITCS.2019.60"},{"key":"12_CR40","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. Tech. Report. TR-81; Aiken Computation Lab, Harvard University: Cambridge, MA, USA (1981)"},{"key":"12_CR41","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Technical Report, Massachusetts Institute of Technology, USA (1996)"},{"key":"12_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-030-65411-5_12","volume-title":"Cryptology and Network Security","author":"CD de Saint Guilhem","year":"2020","unstructured":"de Saint Guilhem, C.D., Orsini, E., Petit, C., Smart, N.P.: Semi-commutative masking: a framework for isogeny-based protocols, with an application to fully secure two-round isogeny-based OT. In: Krenn, S., Shulman, H., Vaudenay, S. (eds.) CANS 2020. LNCS, vol. 12579, pp. 235\u2013258. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65411-5_12"},{"key":"12_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-030-23696-0_4","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2019","author":"V Vitse","year":"2019","unstructured":"Vitse, V.: Simple oblivious transfer protocols compatible with supersingular isogenies. In: Buchmann, J., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2019. LNCS, vol. 11627, pp. 56\u201378. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23696-0_4"},{"key":"12_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-030-17659-4_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Wesolowski","year":"2019","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 379\u2013407. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_13"},{"issue":"7","key":"12_CR45","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1002\/sec.845","volume":"7","author":"L Xu","year":"2014","unstructured":"Xu, L., Zhang, F., Tang, S.: Timed-release oblivious transfer. Secur. Commun. Netw. 7(7), 1138\u20131149 (2014). https:\/\/doi.org\/10.1002\/sec.845","journal-title":"Secur. Commun. Netw."},{"key":"12_CR46","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-031-30122-3_5","volume-title":"Foundations and Practice of Security","author":"A Zawia","year":"2023","unstructured":"Zawia, A., Hasan, M.A.: A new class of trapdoor verifiable delay functions. In: Jourdan, G.V., Mounier, L., Adams, C., S\u00e8des, F., Garcia-Alfaro, J. (eds.) Foundations and Practice of Security, pp. 71\u201387. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30122-3_5"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75757-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T11:05:07Z","timestamp":1729595107000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75757-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,17]]},"ISBN":["9783031757563","9783031757570"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75757-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,17]]},"assertion":[{"value":"17 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Arlington, VA","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":"24 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2024","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":"isw2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isc24.cs.gmu.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}