{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T17:34:52Z","timestamp":1784136892191,"version":"3.55.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030920746","type":"print"},{"value":"9783030920753","type":"electronic"}],"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_14","type":"book-chapter","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T19:21:35Z","timestamp":1638300095000},"page":"398-426","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Astrolabous: A\u00a0Universally Composable Time-Lock Encryption Scheme"],"prefix":"10.1007","author":[{"given":"Myrto","family":"Arapinis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikolaos","family":"Lamprou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Zacharias","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,12,1]]},"reference":[{"key":"14_CR1","unstructured":"Arapinis, M., Lamprou, N., Zacharias, T.: E-cclesia: universally composable self-tallying elections. Cryptology ePrint Archive, Report 2020\/513 (2020)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Arapinis, M., Lamprou, N., Zacharias, T.: A universally composable time-lock encryption scheme. Cryptology ePrint Archive, Astrolabous (2021)","DOI":"10.1007\/978-3-030-92075-3_14"},{"key":"14_CR3","unstructured":"Christian, B., et al.: A composable treatment. In: CRYPTO, Bitcoin as a Transaction Ledger (2017)"},{"key":"14_CR4","unstructured":"Baum, C., et al.: Craft: composable randomness and almost fairness from time. Cryptology ePrint Archive, Report 2020\/784 (2020)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Baum, C. et al.: A foundation of time-lock puzzles in uc. Advances in Cryptology - EUROCRYPT (2021)","DOI":"10.1007\/978-3-030-77883-5_15"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Biryukov, A., Dinu, D., Khovratovich, D.: Argon2: new generation of memory-hard functions for password hashing and other applications. In: 2016 IEEE European Symposium on Security and Privacy (EuroS P) (2016)","DOI":"10.1109\/EuroSP.2016.31"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Bitansky, N., et al.: Time-lock puzzles from randomized encodings. In: ITCS (2016)","DOI":"10.1145\/2840728.2840745"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: CRYPTO (2000)","DOI":"10.1007\/3-540-44598-6_15"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Boneh, D., Bonneau, J., Bunz, B., Fisch, B.: Verifiable delay functions. In: CRYPTO 2018 (2018)","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Bellare, M.: Timed commitments. In: Bellare, Mihir (ed.) Advances in Cryptology \u2013 CRYPTO 2000. Springer, Berlin Heidelberg (2000)","DOI":"10.1007\/3-540-44598-6"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lehmann, A., Neven, G., Samelin, K.: Uc-secure non-interactive public-key encryption. In: CSF 2017 (2017)","DOI":"10.1109\/CSF.2017.14"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"14_CR13","unstructured":"Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: TCC (2007)"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Hopper, N., Kim, Y., Osipkov, I.: Timed-release and key-insulated public key encryption. In: Di Crescenzo, G., Rubin, A. (eds.) Financial Cryptography and Data Security. FC 2006. LNCS, vol. 4107. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889663_17","DOI":"10.1007\/11889663_17"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Hopper, N., Kim, Y., Osipkov, I.: Provably secure timed-release public key encryption. ACM Trans. Inf. Syst. Secur., 11(2), (2008)","DOI":"10.1145\/1330332.1330336"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Dachman-Soled, D., Mahmoody, M., Malkin, T.: Can optimally-fair coin tossing be based on one-way functions?. In: Lindell, Y. (eds.) Theory of Cryptography. TCC 2014. LNCS, vol. 8349. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_10","DOI":"10.1007\/978-3-642-54242-8_10"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Daemen, J., Rijmen, V.: The design of Rijndael. Springer-Verlag (2002). https:\/\/doi.org\/10.1007\/978-3-662-60769-5","DOI":"10.1007\/978-3-662-60769-5"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10\u201318. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_2"},{"key":"14_CR19","unstructured":"Ephraim, N., Freitag, C., Komargodski, I., Pass, R.: Non-malleable time-lock puzzles and applications. Cryptology ePrint Archive, Report 2020\/779 (2020)"},{"key":"14_CR20","unstructured":"Garay, J., Kiayias, A., Panagiotakos, G.: Proofs of work for blockchain protocols. IACR Cryptol. ePrint Arch., 2017 (2017)"},{"key":"14_CR21","unstructured":"Juan, A.: Garay, Aggelos Kiayias, and Nikos Leonardos. analysis and applications. In: EUROCRYPT, The Bitcoin Backbone Protocol (2015)"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Sahai, A., Waters, B.: Witness encryption and its applications. In: STOC (2013)","DOI":"10.1145\/2488608.2488667"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. J. Cryptol. 20 (2007)","DOI":"10.1007\/s00145-006-0347-3"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Gilbert, H., Handschuh, H.: Security analysis of SHA-256 and sisters. In: Matsui, M., Zuccherato, R.J. (eds.) Selected Areas in Cryptography. SAC 2003. LNCS, vol. 3006. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24654-1_13","DOI":"10.1007\/978-3-540-24654-1_13"},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: The foundations of modern cryptography. In: Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Algorithms and Combinatorics, vol. 17. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-662-12521-2_1","DOI":"10.1007\/978-3-662-12521-2_1"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of cryptography:, vol. 1. Cambridge University Press, USA (2006)","DOI":"10.1561\/9781933019529"},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"Gordon, D., Ishai, Y., Moran, T., Ostrovsky, R., Sahai, A.: On complete primitives for fairness. In: Micciancio, D. (eds.) Theory of Cryptography. TCC 2010. LNCS, vol. 5978. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_7","DOI":"10.1007\/978-3-642-11799-2_7"},{"key":"14_CR28","doi-asserted-by":"publisher","unstructured":"Groth, J.: Evaluating security of voting schemes in the universal composability framework. In: Jakobsson, M., Yung, M., Zhou, J. (eds) Applied Cryptography and Network Security. ACNS 2004. LNCS, vol. 3089. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24852-1_4","DOI":"10.1007\/978-3-540-24852-1_4"},{"key":"14_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-13190-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M Hirt","year":"2010","unstructured":"Hirt, M., Zikas, V.: Adaptively secure broadcast. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 466\u2013485. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_24"},{"key":"14_CR30","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. Lecture Notes in Computer Science, 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":"14_CR31","doi-asserted-by":"crossref","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally composable synchronous computation. In: TCC (2013)","DOI":"10.1007\/978-3-642-36594-2_27"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"Khisti, A., Tchamkerten, A., Wornell, G. W.: Secure broadcasting over fading channels. IEEE Trans. Inf. Theory, 54(6) (2008)","DOI":"10.1109\/TIT.2008.921861"},{"key":"14_CR33","doi-asserted-by":"publisher","unstructured":"Kiayias, A., Yung, M.: Self-tallying elections and perfect ballot secrecy. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 141\u2013158. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45664-3_10","DOI":"10.1007\/3-540-45664-3_10"},{"key":"14_CR34","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-41386-5_3","volume-title":"Modern Cryptography Primer","author":"C Ko\u015bcielny","year":"2013","unstructured":"Ko\u015bcielny, C., Kurkowski, M., Srebrny, M.: Foundations of symmetric cryptography. In: Modern Cryptography Primer, pp. 77\u2013118. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41386-5_3"},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: Highly-efficient universally-composable commitments based on the DDH assumption. In: EUROCRYPT 2011 (2011)","DOI":"10.1007\/978-3-642-20465-4_25"},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"Liu, J., Jager, T., Kakvi, S.A., Warinschi, B.: How to build time-lock encryption. Designs, Codes and Cryptography (2018)","DOI":"10.1007\/s10623-018-0461-x"},{"key":"14_CR37","doi-asserted-by":"publisher","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.: Time-lock puzzles in the random oracle model. In: Rogaway, P. (eds.) Advances in Cryptology. LNCS, vol. 6841. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_3","DOI":"10.1007\/978-3-642-22792-9_3"},{"key":"14_CR38","unstructured":"Timothy, C.: May. Timed-release crypto (1993)"},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"Nielsen, J.B.: Separating random oracle proofs from complexity theoretic proofs: the non-committing encryption case. In: CRYPTO (2002)","DOI":"10.1007\/3-540-45708-9_8"},{"key":"14_CR40","doi-asserted-by":"crossref","unstructured":"Okamoto, T.: Receipt-free electronic voting schemes for large scale elections. In: Security Protocols (1998)","DOI":"10.1007\/BFb0028157"},{"key":"14_CR41","doi-asserted-by":"publisher","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) Advances in Cryptology. LNCS, vol. 576. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9","DOI":"10.1007\/3-540-46766-1_9"},{"key":"14_CR42","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: Blum, A., (ed.) 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), of Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, vol. 124 (2018)"},{"key":"14_CR43","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Technical report (1996)"},{"key":"14_CR44","unstructured":"Szepieniec, A., Preneel, B.: New techniques for electronic voting. USENIX Association (2015)"},{"key":"14_CR45","unstructured":"Toponce, A.: Further investigation into scrypt and argon2 password hashing (2016)"},{"key":"14_CR46","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"}],"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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T00:06:14Z","timestamp":1732925174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92075-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030920746","9783030920753"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92075-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}