{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:43:24Z","timestamp":1780069404162,"version":"3.54.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,14]],"date-time":"2016-01-14T00:00:00Z","timestamp":1452729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CNS-1350619 CNS-1414119 CNS-1347364 CNS-1413920"],"award-info":[{"award-number":["CNS-1350619 CNS-1414119 CNS-1347364 CNS-1413920"]}]},{"name":"NSF","award":["CNS-1228599 CNS-1414082"],"award-info":[{"award-number":["CNS-1228599 CNS-1414082"]}]},{"name":"DARPA\/ARL","award":["W911NF-15-C- 0213"],"award-info":[{"award-number":["W911NF-15-C- 0213"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,1,14]]},"DOI":"10.1145\/2840728.2840745","type":"proceedings-article","created":{"date-parts":[[2016,1,5]],"date-time":"2016-01-05T14:26:11Z","timestamp":1452003971000},"page":"345-356","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":90,"title":["Time-Lock Puzzles from Randomized Encodings"],"prefix":"10.1145","author":[{"given":"Nir","family":"Bitansky","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shafi","family":"Goldwasser","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology & Weizman Institute, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abhishek","family":"Jain","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Omer","family":"Paneth","sequence":"additional","affiliation":[{"name":"Boston University, Boston, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vinod","family":"Vaikuntanathan","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brent","family":"Waters","sequence":"additional","affiliation":[{"name":"University of Texas Austin, Austin, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,1,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47989-6_15"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-006-0211-8"},{"key":"e_1_3_2_1_3_1","first-page":"194","volume-title":"6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002","author":"Barak B.","year":"2002","unstructured":"B. Barak . A probabilistic-time hierarchy theorem for \"slightly non-uniform\" algorithms. In Randomization and Approximation Techniques , 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002 , Proceedings , pages 194 -- 208 , 2002 . B. Barak. A probabilistic-time hierarchy theorem for \"slightly non-uniform\" algorithms. In Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings, pages 194--208, 2002."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746574"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.20"},{"key":"e_1_3_2_1_6_1","first-page":"236","volume-title":"20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20--24, 2000","author":"Boneh D.","year":"2000","unstructured":"D. Boneh and M. Naor . Timed commitments. In Advances in Cryptology - CRYPTO 2000 , 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20--24, 2000 , Proceedings , pages 236 -- 254 , 2000 . D. Boneh and M. Naor. Timed commitments. In Advances in Cryptology - CRYPTO 2000, 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20--24, 2000, Proceedings, pages 236--254, 2000."},{"key":"e_1_3_2_1_7_1","volume-title":"Symposium on Theory of Computing, STOC 2015","author":"Canetti R.","year":"2015","unstructured":"R. Canetti , J. Holmgren , A. Jain , and V. Vaikuntanathan . Indistinguishability obfuscation of iterated circuits and ram programs . In Symposium on Theory of Computing, STOC 2015 , 2015 . R. Canetti, J. Holmgren, A. Jain, and V. Vaikuntanathan. Indistinguishability obfuscation of iterated circuits and ram programs. In Symposium on Theory of Computing, STOC 2015, 2015."},{"key":"e_1_3_2_1_8_1","first-page":"483","volume-title":"30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings","author":"Chung K.","year":"2010","unstructured":"K. Chung , Y. T. Kalai , and S. P. Vadhan . Improved delegation of computation using fully homomorphic encryption. In Advances in Cryptology - CRYPTO 2010 , 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings , pages 483 -- 501 , 2010 . K. Chung, Y. T. Kalai, and S. P. Vadhan. Improved delegation of computation using fully homomorphic encryption. In Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings, pages 483--501, 2010."},{"key":"e_1_3_2_1_9_1","first-page":"139","volume-title":"Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16-20, 1992","author":"Dwork C.","year":"1992","unstructured":"C. Dwork and M. Naor . Pricing via processing or combatting junk mail . In Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16-20, 1992 , Proceedings , pages 139 -- 147 , 1992 . C. Dwork and M. Naor. Pricing via processing or combatting junk mail. In Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16-20, 1992, Proceedings, pages 139--147, 1992."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-010-9080-z"},{"key":"e_1_3_2_1_11_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/978-3-642-14623-7_25","volume-title":"Advances in Cryptology - CRYPTO","author":"Gennaro R.","year":"2010","unstructured":"R. Gennaro , C. Gentry , and B. Parno . Non-interactive verifiable computing: Outsourcing computation to untrusted workers . In T. Rabin, editor, Advances in Cryptology - CRYPTO 2010 , 30th Annual Cryptology Conference, Santa Barbara, CA, USA , August 15-19, 2010. Proceedings, volume 6223 of Lecture Notes in Computer Science , pages 465 -- 482 . Springer , 2010. R. Gennaro, C. Gentry, and B. Parno. Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In T. Rabin, editor, Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings, volume 6223 of Lecture Notes in Computer Science, pages 465--482. Springer, 2010."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"The Foundations of Cryptography -","author":"Goldreich O.","year":"2001","unstructured":"O. Goldreich . The Foundations of Cryptography - Volume 1 , Basic Techniques. Cambridge University Press , 2001 . O. Goldreich. The Foundations of Cryptography - Volume 1, Basic Techniques. Cambridge University Press, 2001."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"The Foundations of Cryptography -","author":"Goldreich O.","year":"2001","unstructured":"O. Goldreich . The Foundations of Cryptography - Volume 1 , Basic Techniques. Cambridge University Press , 2001 . O. Goldreich. The Foundations of Cryptography - Volume 1, Basic Techniques. Cambridge University Press, 2001."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488678"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195085914.001.0001","volume-title":"Limits to Parallel Computation: P-completeness Theory","author":"Greenlaw R.","year":"1995","unstructured":"R. Greenlaw , H. J. Hoover , and W. L. Ruzzo . Limits to Parallel Computation: P-completeness Theory . Oxford University Press, Inc. , New York, NY, USA , 1995 . R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-completeness Theory. Oxford University Press, Inc., New York, NY, USA, 1995."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1965-0170805-7"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1780"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796556"},{"key":"e_1_3_2_1_19_1","first-page":"650","volume-title":"41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I","author":"Ishai Y.","year":"2014","unstructured":"Y. Ishai and H. Wee . Partial garbling schemes and their applications. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I , pages 650 -- 662 , 2014 . Y. Ishai and H. Wee. Partial garbling schemes and their applications. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, pages 650--662, 2014."},{"key":"e_1_3_2_1_20_1","volume-title":"How to build time-lock encryption. IACR Cryptology ePrint Archive","author":"Jager T.","year":"2015","unstructured":"T. Jager . How to build time-lock encryption. IACR Cryptology ePrint Archive , 2015 :478, 2015. T. Jager. How to build time-lock encryption. IACR Cryptology ePrint Archive, 2015:478, 2015."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/647800.757199"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746614"},{"key":"e_1_3_2_1_23_1","volume-title":"Output-compressing randomized encodings and applications. IACR Cryptology ePrint Archive","author":"Lin H.","year":"2015","unstructured":"H. Lin , R. Pass , K. Seth , and S. Telang . Output-compressing randomized encodings and applications. IACR Cryptology ePrint Archive , 2015 :720, 2015. H. Lin, R. Pass, K. Seth, and S. Telang. Output-compressing randomized encodings and applications. IACR Cryptology ePrint Archive, 2015:720, 2015."},{"key":"e_1_3_2_1_24_1","volume-title":"Time-release protocol from bitcoin and witness encryption for SAT. IACR Cryptology ePrint Archive","author":"Liu J.","year":"2015","unstructured":"J. Liu , F. Garcia , and M. Ryan . Time-release protocol from bitcoin and witness encryption for SAT. IACR Cryptology ePrint Archive , 2015 :482, 2015. J. Liu, F. Garcia, and M. Ryan. Time-release protocol from bitcoin and witness encryption for SAT. IACR Cryptology ePrint Archive, 2015:482, 2015."},{"key":"e_1_3_2_1_25_1","volume-title":"USA","author":"Mahmoody M.","year":"2011","unstructured":"M. Mahmoody , T. Moran , and S. P. Vadhan . Time-lock puzzles in the random oracle model. In Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference, Santa Barbara, CA , USA , August 14-18, 2011 . Proceedings, pages 39--50 , 2011. M. Mahmoody, T. Moran, and S. P. Vadhan. Time-lock puzzles in the random oracle model. In Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011. Proceedings, pages 39--50, 2011."},{"key":"e_1_3_2_1_26_1","volume-title":"Timed-release crypto","author":"May T. C.","year":"1993","unstructured":"T. C. May . Timed-release crypto , 1993 . http:\/\/www.hks.net\/cpunks\/cpunks-0\/1460.html. T. C. May. Timed-release crypto, 1993. http:\/\/www.hks.net\/cpunks\/cpunks-0\/1460.html."},{"key":"e_1_3_2_1_27_1","volume-title":"A peer-to-peer electronic cash system","author":"Nakamoto S.","year":"2000","unstructured":"S. Nakamoto . Bitcoin : A peer-to-peer electronic cash system , 2000 . http:\/\/bitcoin.org\/bitcoin.pdf. S. Nakamoto. Bitcoin: A peer-to-peer electronic cash system, 2000. http:\/\/bitcoin.org\/bitcoin.pdf."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.95"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"ITCS'16: Innovations in Theoretical Computer Science","location":"Cambridge Massachusetts USA","acronym":"ITCS'16","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2840728.2840745","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2840728.2840745","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:53:47Z","timestamp":1750222427000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2840728.2840745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,14]]},"references-count":29,"alternative-id":["10.1145\/2840728.2840745","10.1145\/2840728"],"URL":"https:\/\/doi.org\/10.1145\/2840728.2840745","relation":{},"subject":[],"published":{"date-parts":[[2016,1,14]]},"assertion":[{"value":"2016-01-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}