{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:24:50Z","timestamp":1764937490403,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031223006"},{"type":"electronic","value":"9783031223013"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22301-3_13","type":"book-chapter","created":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T15:17:17Z","timestamp":1669907837000},"page":"244-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["TIDE: A Novel Approach to\u00a0Constructing Timed-Release Encryption"],"prefix":"10.1007","author":[{"given":"Angelique Faye","family":"Loe","sequence":"first","affiliation":[]},{"given":"Liam","family":"Medley","sequence":"additional","affiliation":[]},{"given":"Christian","family":"O\u2019Connell","sequence":"additional","affiliation":[]},{"given":"Elizabeth A.","family":"Quaglia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,29]]},"reference":[{"key":"13_CR1","unstructured":"Ausubel, L.: A generalized Vickrey auction. Econo0 metrica (1999)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"B Barak","year":"2001","unstructured":"Barak, B., et al.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1\u201318. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_1"},{"key":"13_CR3","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 (2016)","DOI":"10.1145\/2840728.2840745"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Blass, E., Kerschbaum, F.: BOREALIS: building block for sealed bid auctions on blockchains. In: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (2020)","DOI":"10.1145\/3320269.3384752"},{"issue":"2","key":"13_CR5","first-page":"364","volume":"15","author":"L Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. J. Comput. 15(2), 364\u2013383 (1986)","journal-title":"J. Comput."},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/S0022-0531(03)00104-2","volume":"114","author":"A Blume","year":"2004","unstructured":"Blume, A., Heidhues, P.: All equilibria of the Vickrey auction. J. Econ. Theory 114(1), 170\u2013177 (2004)","journal-title":"J. Econ. Theory"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-03549-4_20","volume-title":"Financial Cryptography and Data Security","author":"P Bogetoft","year":"2009","unstructured":"Bogetoft, P., et al.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325\u2013343. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03549-4_20"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/978-3-319-96884-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 757\u2013788. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Brandt, F.: Auctions. In: Handbook of Financial Cryptography and Security. Chapman and Hall\/CRC (2010)","DOI":"10.1201\/9781420059823-c2"},{"key":"13_CR10","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_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/11602897_25","volume-title":"Information and Communications Security","author":"J Cathalo","year":"2005","unstructured":"Cathalo, J., Libert, B., Quisquater, J.-J.: Efficient and non-interactive timed-release encryption. In: Qing, S., Mao, W., L\u00f3pez, J., Wang, G. (eds.) ICICS 2005. LNCS, vol. 3783, pp. 291\u2013303. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11602897_25"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-88428-4_4","volume-title":"Computer Security \u2013 ESORICS 2021","author":"P Chvojka","year":"2021","unstructured":"Chvojka, P., Jager, T., Slamanig, D., Striecks, C.: Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract). In: Bertino, E., Shulman, H., Waidner, M. (eds.) ESORICS 2021. LNCS, vol. 12973, pp. 64\u201385. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88428-4_4"},{"key":"13_CR13","unstructured":"Cohen, B., Pietrzak, K.: The chia network blockchain (2019)"},{"key":"13_CR14","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"2009","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2009)"},{"key":"13_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-28979-8","volume-title":"Prime Numbers: A Computational Perspective","author":"R Crandall","year":"2005","unstructured":"Crandall, R., Pomerance, C.: Prime Numbers: A Computational Perspective. Springer, New York (2005). https:\/\/doi.org\/10.1007\/0-387-28979-8"},{"key":"13_CR16","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":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-030-34578-5_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"L De Feo","year":"2019","unstructured":"De Feo, L., Masson, S., Petit, C., Sanso, A.: Verifiable delay functions from supersingular isogenies and pairings. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 248\u2013277. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_10"},{"key":"13_CR18","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_CR19","doi-asserted-by":"publisher","first-page":"1591","DOI":"10.1090\/S0025-5718-00-01282-5","volume":"70","author":"J Friedlander","year":"2000","unstructured":"Friedlander, J., Pomerance, C., Shparlinski, I.: Period of the power generator and small values of Carmichael\u2019s function. Math. Comput. 70, 1591\u20131605 (2000)","journal-title":"Math. Comput."},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-44647-8_16","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"E Fujisaki","year":"2001","unstructured":"Fujisaki, E., Okamoto, T., Pointcheval, D., Stern, J.: RSA-OAEP is secure under the RSA assumption. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 260\u2013274. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_16"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-662-58820-8_18","volume-title":"Financial Cryptography and Data Security","author":"HS Galal","year":"2019","unstructured":"Galal, H.S., Youssef, A.M.: Verifiable sealed-bid auction on the ethereum blockchain. In: Zohar, A., et al. (eds.) FC 2018. LNCS, vol. 10958, pp. 265\u2013278. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-662-58820-8_18"},{"key":"13_CR22","unstructured":"Goodstein, R.L.: Boolean Algebra. Dover Publications (2007)"},{"issue":"6","key":"13_CR23","doi-asserted-by":"publisher","first-page":"2159","DOI":"10.1109\/18.868485","volume":"46","author":"F Griffin","year":"2000","unstructured":"Griffin, F., Shparlinski, I.: On the linear complexity profile of the power generator. IEEE Trans. Inf. Theory 46(6), 2159\u20132162 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (2021)","DOI":"10.1145\/3406325.3451093"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-36504-4_6","volume-title":"Financial Cryptography","author":"A Juels","year":"2003","unstructured":"Juels, A., Szydlo, M.: A two-server, sealed-bid auction protocol. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 72\u201386. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36504-4_6"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, 2nd edn. CRC Press (2014)","DOI":"10.1201\/b17668"},{"issue":"10","key":"13_CR27","first-page":"530","volume":"40","author":"J Liu","year":"2015","unstructured":"Liu, J., Garcia, F., Ryan, M.: Time-release protocol from bitcoin and witness encryption for sat. Korean Circ. J. 40(10), 530\u2013535 (2015)","journal-title":"Korean Circ. J."},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Loe, A.F., Medley, L., O\u2019Connell, C., Quaglia, E.A.: TIDE: a novel approach to constructing timed-release encryption. Cryptology ePrint Archive (2021)","DOI":"10.1007\/978-3-031-22301-3_13"},{"key":"13_CR29","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_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-45537-X_27","volume-title":"Selected Areas in Cryptography","author":"W Mao","year":"2001","unstructured":"Mao, W.: Timed-release cryptography. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol. 2259, pp. 342\u2013357. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45537-X_27"},{"issue":"3","key":"13_CR31","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","volume":"13","author":"G Miller","year":"1976","unstructured":"Miller, G.: Riemann\u2019s hypothesis and tests for primality. J. Comput. Syst. Sci. 13(3), 300\u2013317 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR32","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: 10th Innovations in Theoretical Computer Science Conference, ITCS 2019 (2019)"},{"key":"13_CR33","unstructured":"Rabin, M.: Digitalized signatures and public-key functions as intractable as factorization. In: MIT\/LCS\/TR-212. MIT Laboratory for Computer Science (1979)"},{"issue":"2","key":"13_CR34","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R Rivest","year":"1983","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1983)","journal-title":"Commun. ACM"},{"key":"13_CR35","unstructured":"Rivest, R., Shamir, A., Wagner, D.: Time-lock puzzles and timed-release crypto. In: MIT\/LCS\/TR-684. MIT Laboratory for Computer Science (1996)"},{"key":"13_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-540-46588-1_28","volume-title":"Public Key Cryptography","author":"K Sako","year":"2000","unstructured":"Sako, K.: An auction protocol which hides bids of losers. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 422\u2013432. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-46588-1_28"},{"issue":"1","key":"13_CR37","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16(1), 8\u201337 (1961)","journal-title":"J. Finance"},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-17659-4_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"M Zhandry","year":"2019","unstructured":"Zhandry, M.: On ELFs, deterministic encryption, and correlated-input security. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 3\u201332. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_1"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22301-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,15]],"date-time":"2023-03-15T01:33:39Z","timestamp":1678844019000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22301-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223006","9783031223013"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22301-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACISP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Conference on Information Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wollongong, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2022","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":"acisp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/uow-ic2.github.io\/acisp2022\/index.html","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","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":"25","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":"40% - 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":"4","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":"3","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)"}}]}}