{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:10:53Z","timestamp":1767337853384,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031376788"},{"type":"electronic","value":"9783031376795"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-37679-5_21","type":"book-chapter","created":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T20:31:15Z","timestamp":1689193875000},"page":"490-515","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Applications of\u00a0Timed-Release Encryption with\u00a0Implicit Authentication"],"prefix":"10.1007","author":[{"given":"Angelique","family":"Loe","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4533-7890","authenticated-orcid":false,"given":"Liam","family":"Medley","sequence":"additional","affiliation":[]},{"given":"Christian","family":"O\u2019Connell","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4010-773X","authenticated-orcid":false,"given":"Elizabeth A.","family":"Quaglia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,13]]},"reference":[{"key":"21_CR1","unstructured":"Edward Snowden\u2019s Motive Revealed: He Can \u2018Sleep at Night\u2019 (2014). https:\/\/www.nbcnews.com\/feature\/edward-snowden-interview\/edward-snowdens-motive-revealed-he-can-sleep-night-n116851"},{"key":"21_CR2","unstructured":"SecureDrop Whistleblower Submission System (2021). https:\/\/securedrop.org"},{"key":"21_CR3","unstructured":"Signal Messaging (2021). https:\/\/signal.org\/en"},{"key":"21_CR4","unstructured":"The Tor Project (2021). https:\/\/www.torproject.org"},{"key":"21_CR5","unstructured":"Abdi, H.: Coefficient of variation. In: Encyclopedia of Research Design (2010)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Barker, E., Chen, L., Roginsky, A., Vassilev, A., Davis, R., Simon, S.: SP 800-56b rev. 2, recommendation for pair-wise key-establishment using integer factorization cryptography. ITL Computer Security Resource Center (2019)","DOI":"10.6028\/NIST.SP.800-56Br2"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/3-540-44448-3_41","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"M Bellare","year":"2000","unstructured":"Bellare, M., Namprempre, C.: Authenticated encryption: relations among notions and analysis of the generic composition paradigm. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 531\u2013545. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_41"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201994","author":"M Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: Optimal asymmetric encryption. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 92\u2013111. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0053428"},{"key":"21_CR9","first-page":"20","volume":"12","author":"P Berglez","year":"2018","unstructured":"Berglez, P., Gearing, A.: The panama and paradise papers. The rise of a global fourth estate. Int. J. Commun. 12, 20 (2018)","journal-title":"Int. J. Commun."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Berti, F., Koeune, F., Pereira, O., Peters, T., Standaert, F.: Ciphertext integrity with misuse and leakage: definition and efficient constructions with symmetric primitives. In: Proceedings of the 2018 on Asia Conference on Computer and Communications Security, pp. 37\u201350 (2018)","DOI":"10.1145\/3196494.3196525"},{"key":"21_CR11","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, 364\u2013383 (1986)","journal-title":"J. Comput."},{"key":"21_CR12","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":"21_CR13","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":"21_CR14","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":"21_CR15","doi-asserted-by":"crossref","unstructured":"Carmichael, R.: Note on a new number theory function. Bull. Am. Math. Soc. (1910)","DOI":"10.1090\/S0002-9904-1910-01892-9"},{"key":"21_CR16","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":"21_CR17","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":"21_CR18","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":"21_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. Am. Math. Soc. Math. Comput. 70, 1591\u20131605 (2000)","journal-title":"Am. Math. Soc. Math. Comput."},{"key":"21_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":"21_CR21","unstructured":"Garside, J.: Panama Papers: inside the Guardian\u2019s investigation into offshore secrets (2016). https:\/\/www.theguardian.com\/news\/2016\/apr\/16\/panama-papers-inside-the-guardians-investigation-into-offshore-secrets"},{"key":"21_CR22","unstructured":"Gauss, C.: Disquisitiones Arithmeticae. Yale University Press (2009)"},{"key":"21_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, 2159\u20132162 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR24","volume-title":"An Introduction to the Theory of Numbers","author":"G Hardy","year":"1979","unstructured":"Hardy, G., Wright, E.: An Introduction to the Theory of Numbers. Oxford University Press, Oxford (1979)"},{"key":"21_CR25","doi-asserted-by":"publisher","DOI":"10.1201\/b17668","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2014","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, 2nd edn. CRC Press, Boca Raton (2014)","edition":"2"},{"key":"21_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-45664-3_16","volume-title":"Public Key Cryptography","author":"AK Lenstra","year":"2002","unstructured":"Lenstra, A.K., Shparlinski, I.E.: Selective forgery of RSA signatures with fixed-pattern padding. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 228\u2013236. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45664-3_16"},{"key":"21_CR27","unstructured":"Liedtke, M., Mattise, J.: Leaked \u201cpandora papers\u201d expose how billionaires and corrupt leaders hide wealth. Guardian (Sydney) (2021)"},{"key":"21_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-031-22301-3_13","volume-title":"Information Security and Privacy","author":"A Loe","year":"2022","unstructured":"Loe, A., Medley, L., O\u2019Connell, C., Quaglia, E.: TIDE: a novel approach to constructing timed-release encryption. In: Nguyen, K., Yang, G., Guo, F., Susilo, W. (eds.) ACISP 2022. LNCS, vol. 13494, pp. 244\u2013264. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22301-3_13"},{"key":"21_CR29","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"},{"key":"21_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-69053-0_34","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"M Girault","year":"1997","unstructured":"Girault, M., Misarsky, J.-F.: Selective forgery of RSA signatures using redundancy. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 495\u2013507. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_34"},{"issue":"3","key":"21_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":"21_CR32","doi-asserted-by":"publisher","first-page":"4117","DOI":"10.1093\/rfs\/hhz017","volume":"32","author":"J O\u2019Donovan","year":"2019","unstructured":"O\u2019Donovan, J., Wagner, H., Zeume, S.: The value of offshore secrets: evidence from the panama papers. Rev. Financ. Stud. 32, 4117\u20134155 (2019)","journal-title":"Rev. Financ. Stud."},{"key":"21_CR33","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: 10th Innovations in Theoretical Computer Science Conference, ITCS 201 (2019)"},{"key":"21_CR34","unstructured":"Rabin, M.: Digitalized signatures and public-key functions as intractable as factorization. MIT\/LCS\/TR-212, MIT Laboratory for Computer Science (1979)"},{"key":"21_CR35","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, 120\u2013126 (1983)","journal-title":"Commun. ACM"},{"key":"21_CR36","unstructured":"Rivest, R., Shamir, A., Wagner, D.: Time-lock puzzles and timed-release crypto. MIT\/LCS\/TR-684, MIT Laboratory for Computer Science (1996)"},{"key":"21_CR37","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1177\/0191453714537263","volume":"40","author":"W Scheuerman","year":"2014","unstructured":"Scheuerman, W.: Whistleblowing as civil disobedience: the case of Edward Snowden. Philos. Soc. Criticism 40, 609\u2013628 (2014)","journal-title":"Philos. Soc. Criticism"},{"key":"21_CR38","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/2684097.2684101","volume":"44","author":"J Verble","year":"2014","unstructured":"Verble, J.: The NSA and Edward Snowden: surveillance in the 21st century. ACM SIGCAS Comput. Soc. 44, 14\u201320 (2014)","journal-title":"ACM SIGCAS Comput. Soc."},{"key":"21_CR39","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"},{"key":"21_CR40","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1080\/00031305.2014.917055","volume":"68","author":"P Westfall","year":"2014","unstructured":"Westfall, P.: Kurtosis as Peakedness. Am. Stat. 68, 91\u2013195 (2014)","journal-title":"Am. Stat."},{"key":"21_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BFb0052234","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"Y Zheng","year":"1997","unstructured":"Zheng, Y.: Digital signcryption or how to achieve cost (signature & encryption) $$\\ll $$ cost(signature) + cost(encryption). In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 165\u2013179. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052234"},{"issue":"5","key":"21_CR42","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1002\/sec.1017","volume":"8","author":"Y Zheng","year":"2015","unstructured":"Zheng, Y.: A new efficient signcryption scheme in the standard model. Secur. Commun. Netw. 8(5), 703\u2013878 (2015)","journal-title":"Secur. Commun. Netw."},{"key":"21_CR43","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Imai, H.: How to construct efficient signcryption schemes on elliptic curves. In: Proceedings of IFIP SEC98, vol. 68, no. 5, pp. 227\u2013233 (1998)","DOI":"10.1016\/S0020-0190(98)00167-7"},{"key":"21_CR44","unstructured":"Zimmerman, P.: Why I Wrote PGP, Essays on PGP. Phil Zimmermann and Associates LLC (2013)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37679-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T20:32:36Z","timestamp":1689193956000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37679-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031376788","9783031376795"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37679-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sousse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tunisia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2023","order":10,"name":"conference_id","label":"Conference ID","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":"59","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":"21","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":"36% - 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":"2.9","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.5","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)"}}]}}