Time-Lock Puzzles from Randomized Encodings Article Swipe
Nir Bitansky
,
Shafi Goldwasser
,
Abhishek Jain
,
Omer Paneth
,
Vinod Vaikuntanathan
,
Brent Waters
·
YOU?
·
· 2016
· Open Access
·
· DOI: https://doi.org/10.1145/2840728.2840745
YOU?
·
· 2016
· Open Access
·
· DOI: https://doi.org/10.1145/2840728.2840745
Time-lock puzzles are a mechanism for sending messages "to the future". A sender can quickly generate a puzzle with a solution s that remains hidden until a moderately large amount of time t has elapsed. The solution s should be hidden from any adversary that runs in time significantly less than t, including resourceful parallel adversaries with polynomially many processors. While the notion of time-lock puzzles has been around for 22 years, there has only been a single candidate proposed. Fifteen years ago, Rivest, Shamir and Wagner suggested a beautiful candidate time-lock puzzle based on the assumption that exponentiation modulo an RSA integer is an "inherently sequential" computation. We show that various flavors of randomized encodings give rise to time-lock puzzles of varying strengths, whose security can be shown assuming the mere existence of non-parallelizing languages, which are languages that require circuits of depth at least t to decide, in the worst-case. The existence of such languages is necessary for the existence of time-lock puzzles. We instantiate the construction with different randomized encodings from the literature, where increasingly better efficiency is obtained based on increasingly stronger cryptographic assumptions, ranging from one-way functions to indistinguishability obfuscation. We also observe that time-lock puzzles imply one-way functions, and thus the reliance on some cryptographic assumption is necessary. Finally, generalizing the above, we construct other types of puzzles such as proofs of work from randomized encodings and a suitable worst-case hardness assumption (that is necessary for such puzzles to exist).
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1145/2840728.2840745
- OA Status
- green
- Cited By
- 104
- References
- 32
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2294814269
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2294814269Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1145/2840728.2840745Digital Object Identifier
- Title
-
Time-Lock Puzzles from Randomized EncodingsWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2016Year of publication
- Publication date
-
2016-01-05Full publication date if available
- Authors
-
Nir Bitansky, Shafi Goldwasser, Abhishek Jain, Omer Paneth, Vinod Vaikuntanathan, Brent WatersList of authors in order
- Landing page
-
https://doi.org/10.1145/2840728.2840745Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://hdl.handle.net/1721.1/112999Direct OA link when available
- Concepts
-
Lock (firearm), Computer science, Adversary, Communication source, Computer security, Theoretical computer science, Distributed computing, Computer network, Engineering, Mechanical engineeringTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
104Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 5, 2024: 12, 2023: 13, 2022: 7, 2021: 21Per-year citation counts (last 5 years)
- References (count)
-
32Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2294814269 |
|---|---|
| doi | https://doi.org/10.1145/2840728.2840745 |
| ids.doi | https://doi.org/10.1145/2840728.2840745 |
| ids.mag | 2294814269 |
| ids.openalex | https://openalex.org/W2294814269 |
| fwci | 7.32879886 |
| type | article |
| title | Time-Lock Puzzles from Randomized Encodings |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | 356 |
| biblio.first_page | 345 |
| topics[0].id | https://openalex.org/T10237 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9998000264167786 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | Cryptography and Data Security |
| topics[1].id | https://openalex.org/T11017 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9983000159263611 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1707 |
| topics[1].subfield.display_name | Computer Vision and Pattern Recognition |
| topics[1].display_name | Chaos-based Image/Signal Encryption |
| topics[2].id | https://openalex.org/T10951 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9977999925613403 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1702 |
| topics[2].subfield.display_name | Artificial Intelligence |
| topics[2].display_name | Cryptographic Implementations and Security |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C174839445 |
| concepts[0].level | 2 |
| concepts[0].score | 0.8155875205993652 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q1134386 |
| concepts[0].display_name | Lock (firearm) |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.7853763103485107 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C41065033 |
| concepts[2].level | 2 |
| concepts[2].score | 0.7494747042655945 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q2825412 |
| concepts[2].display_name | Adversary |
| concepts[3].id | https://openalex.org/C198104137 |
| concepts[3].level | 2 |
| concepts[3].score | 0.6741369962692261 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q974688 |
| concepts[3].display_name | Communication source |
| concepts[4].id | https://openalex.org/C38652104 |
| concepts[4].level | 1 |
| concepts[4].score | 0.3820595145225525 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q3510521 |
| concepts[4].display_name | Computer security |
| concepts[5].id | https://openalex.org/C80444323 |
| concepts[5].level | 1 |
| concepts[5].score | 0.3515860438346863 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[5].display_name | Theoretical computer science |
| concepts[6].id | https://openalex.org/C120314980 |
| concepts[6].level | 1 |
| concepts[6].score | 0.33032500743865967 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q180634 |
| concepts[6].display_name | Distributed computing |
| concepts[7].id | https://openalex.org/C31258907 |
| concepts[7].level | 1 |
| concepts[7].score | 0.28304851055145264 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[7].display_name | Computer network |
| concepts[8].id | https://openalex.org/C127413603 |
| concepts[8].level | 0 |
| concepts[8].score | 0.0 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q11023 |
| concepts[8].display_name | Engineering |
| concepts[9].id | https://openalex.org/C78519656 |
| concepts[9].level | 1 |
| concepts[9].score | 0.0 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q101333 |
| concepts[9].display_name | Mechanical engineering |
| keywords[0].id | https://openalex.org/keywords/lock |
| keywords[0].score | 0.8155875205993652 |
| keywords[0].display_name | Lock (firearm) |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.7853763103485107 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/adversary |
| keywords[2].score | 0.7494747042655945 |
| keywords[2].display_name | Adversary |
| keywords[3].id | https://openalex.org/keywords/communication-source |
| keywords[3].score | 0.6741369962692261 |
| keywords[3].display_name | Communication source |
| keywords[4].id | https://openalex.org/keywords/computer-security |
| keywords[4].score | 0.3820595145225525 |
| keywords[4].display_name | Computer security |
| keywords[5].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[5].score | 0.3515860438346863 |
| keywords[5].display_name | Theoretical computer science |
| keywords[6].id | https://openalex.org/keywords/distributed-computing |
| keywords[6].score | 0.33032500743865967 |
| keywords[6].display_name | Distributed computing |
| keywords[7].id | https://openalex.org/keywords/computer-network |
| keywords[7].score | 0.28304851055145264 |
| keywords[7].display_name | Computer network |
| language | en |
| locations[0].id | doi:10.1145/2840728.2840745 |
| locations[0].is_oa | False |
| locations[0].source | |
| locations[0].license | |
| locations[0].pdf_url | |
| locations[0].version | publishedVersion |
| locations[0].raw_type | proceedings-article |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science |
| locations[0].landing_page_url | https://doi.org/10.1145/2840728.2840745 |
| locations[1].id | pmh:oai:dspace.mit.edu:1721.1/112999 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400425 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | DSpace@MIT (Massachusetts Institute of Technology) |
| locations[1].source.host_organization | https://openalex.org/I63966007 |
| locations[1].source.host_organization_name | Massachusetts Institute of Technology |
| locations[1].source.host_organization_lineage | https://openalex.org/I63966007 |
| locations[1].license | cc-by-nc-sa |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | http://purl.org/eprint/type/ConferencePaper |
| locations[1].license_id | https://openalex.org/licenses/cc-by-nc-sa |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | MIT Web Domain |
| locations[1].landing_page_url | http://hdl.handle.net/1721.1/112999 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5065373891 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-8361-6035 |
| authorships[0].author.display_name | Nir Bitansky |
| authorships[0].countries | US |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I63966007 |
| authorships[0].affiliations[0].raw_affiliation_string | Massachusetts Institute of Technology, Cambridge, MA, USA |
| authorships[0].institutions[0].id | https://openalex.org/I63966007 |
| authorships[0].institutions[0].ror | https://ror.org/042nb2s44 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I63966007 |
| authorships[0].institutions[0].country_code | US |
| authorships[0].institutions[0].display_name | Massachusetts Institute of Technology |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Nir Bitansky |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Massachusetts Institute of Technology, Cambridge, MA, USA |
| authorships[1].author.id | https://openalex.org/A5110776230 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Shafi Goldwasser |
| authorships[1].countries | US |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I63966007 |
| authorships[1].affiliations[0].raw_affiliation_string | Massachusetts Institute of Technology & Weizman Institute, Cambridge, MA, USA |
| authorships[1].institutions[0].id | https://openalex.org/I63966007 |
| authorships[1].institutions[0].ror | https://ror.org/042nb2s44 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I63966007 |
| authorships[1].institutions[0].country_code | US |
| authorships[1].institutions[0].display_name | Massachusetts Institute of Technology |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Shafi Goldwasser |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Massachusetts Institute of Technology & Weizman Institute, Cambridge, MA, USA |
| authorships[2].author.id | https://openalex.org/A5100661347 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-3572-7643 |
| authorships[2].author.display_name | Abhishek Jain |
| authorships[2].countries | US |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I145311948 |
| authorships[2].affiliations[0].raw_affiliation_string | Johns Hopkins University, Baltimore, MD, USA |
| authorships[2].institutions[0].id | https://openalex.org/I145311948 |
| authorships[2].institutions[0].ror | https://ror.org/00za53h95 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I145311948 |
| authorships[2].institutions[0].country_code | US |
| authorships[2].institutions[0].display_name | Johns Hopkins University |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Abhishek Jain |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Johns Hopkins University, Baltimore, MD, USA |
| authorships[3].author.id | https://openalex.org/A5035828031 |
| authorships[3].author.orcid | https://orcid.org/0000-0001-8561-1123 |
| authorships[3].author.display_name | Omer Paneth |
| authorships[3].affiliations[0].raw_affiliation_string | Boston University, Boston, MA, USA |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Omer Paneth |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | Boston University, Boston, MA, USA |
| authorships[4].author.id | https://openalex.org/A5000240220 |
| authorships[4].author.orcid | https://orcid.org/0000-0002-2666-0045 |
| authorships[4].author.display_name | Vinod Vaikuntanathan |
| authorships[4].countries | US |
| authorships[4].affiliations[0].institution_ids | https://openalex.org/I63966007 |
| authorships[4].affiliations[0].raw_affiliation_string | Massachusetts Institute of Technology, Cambridge, MA, USA |
| authorships[4].institutions[0].id | https://openalex.org/I63966007 |
| authorships[4].institutions[0].ror | https://ror.org/042nb2s44 |
| authorships[4].institutions[0].type | education |
| authorships[4].institutions[0].lineage | https://openalex.org/I63966007 |
| authorships[4].institutions[0].country_code | US |
| authorships[4].institutions[0].display_name | Massachusetts Institute of Technology |
| authorships[4].author_position | middle |
| authorships[4].raw_author_name | Vinod Vaikuntanathan |
| authorships[4].is_corresponding | False |
| authorships[4].raw_affiliation_strings | Massachusetts Institute of Technology, Cambridge, MA, USA |
| authorships[5].author.id | https://openalex.org/A5007379830 |
| authorships[5].author.orcid | https://orcid.org/0009-0008-9718-8623 |
| authorships[5].author.display_name | Brent Waters |
| authorships[5].countries | US |
| authorships[5].affiliations[0].institution_ids | https://openalex.org/I86519309 |
| authorships[5].affiliations[0].raw_affiliation_string | University of Texas Austin, Austin, TX, USA |
| authorships[5].institutions[0].id | https://openalex.org/I86519309 |
| authorships[5].institutions[0].ror | https://ror.org/00hj54h04 |
| authorships[5].institutions[0].type | education |
| authorships[5].institutions[0].lineage | https://openalex.org/I86519309 |
| authorships[5].institutions[0].country_code | US |
| authorships[5].institutions[0].display_name | The University of Texas at Austin |
| authorships[5].author_position | last |
| authorships[5].raw_author_name | Brent Waters |
| authorships[5].is_corresponding | False |
| authorships[5].raw_affiliation_strings | University of Texas Austin, Austin, TX, USA |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | http://hdl.handle.net/1721.1/112999 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Time-Lock Puzzles from Randomized Encodings |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10237 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9998000264167786 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | Cryptography and Data Security |
| related_works | https://openalex.org/W2993833576, https://openalex.org/W2776877297, https://openalex.org/W3125718803, https://openalex.org/W2127920220, https://openalex.org/W3119288169, https://openalex.org/W4388150944, https://openalex.org/W2945097178, https://openalex.org/W4388741024, https://openalex.org/W4320855289, https://openalex.org/W1554494913 |
| cited_by_count | 104 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 5 |
| counts_by_year[1].year | 2024 |
| counts_by_year[1].cited_by_count | 12 |
| counts_by_year[2].year | 2023 |
| counts_by_year[2].cited_by_count | 13 |
| counts_by_year[3].year | 2022 |
| counts_by_year[3].cited_by_count | 7 |
| counts_by_year[4].year | 2021 |
| counts_by_year[4].cited_by_count | 21 |
| counts_by_year[5].year | 2020 |
| counts_by_year[5].cited_by_count | 15 |
| counts_by_year[6].year | 2019 |
| counts_by_year[6].cited_by_count | 8 |
| counts_by_year[7].year | 2018 |
| counts_by_year[7].cited_by_count | 8 |
| counts_by_year[8].year | 2017 |
| counts_by_year[8].cited_by_count | 6 |
| counts_by_year[9].year | 2016 |
| counts_by_year[9].cited_by_count | 4 |
| counts_by_year[10].year | 2015 |
| counts_by_year[10].cited_by_count | 5 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:dspace.mit.edu:1721.1/112999 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400425 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | DSpace@MIT (Massachusetts Institute of Technology) |
| best_oa_location.source.host_organization | https://openalex.org/I63966007 |
| best_oa_location.source.host_organization_name | Massachusetts Institute of Technology |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I63966007 |
| best_oa_location.license | cc-by-nc-sa |
| best_oa_location.pdf_url | |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | http://purl.org/eprint/type/ConferencePaper |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by-nc-sa |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | MIT Web Domain |
| best_oa_location.landing_page_url | http://hdl.handle.net/1721.1/112999 |
| primary_location.id | doi:10.1145/2840728.2840745 |
| primary_location.is_oa | False |
| primary_location.source | |
| primary_location.license | |
| primary_location.pdf_url | |
| primary_location.version | publishedVersion |
| primary_location.raw_type | proceedings-article |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science |
| primary_location.landing_page_url | https://doi.org/10.1145/2840728.2840745 |
| publication_date | 2016-01-05 |
| publication_year | 2016 |
| referenced_works | https://openalex.org/W1419302722, https://openalex.org/W2138532540, https://openalex.org/W2101230806, https://openalex.org/W2196732887, https://openalex.org/W6759108932, https://openalex.org/W2398442921, https://openalex.org/W2116653107, https://openalex.org/W2037285013, https://openalex.org/W1557386445, https://openalex.org/W1548880861, https://openalex.org/W2161508639, https://openalex.org/W3157585079, https://openalex.org/W2125495920, https://openalex.org/W2062855793, https://openalex.org/W6637519905, https://openalex.org/W6764258616, https://openalex.org/W2039677636, https://openalex.org/W2296101771, https://openalex.org/W6680838611, https://openalex.org/W2061106457, https://openalex.org/W2088492763, https://openalex.org/W2141870382, https://openalex.org/W1954882695, https://openalex.org/W2951028269, https://openalex.org/W2395490828, https://openalex.org/W1720250315, https://openalex.org/W1601379374, https://openalex.org/W1632088469, https://openalex.org/W1497287285, https://openalex.org/W1597159947, https://openalex.org/W1748501741, https://openalex.org/W1490590996 |
| referenced_works_count | 32 |
| abstract_inverted_index.A | 11 |
| abstract_inverted_index.a | 3, 16, 19, 26, 76, 88, 233 |
| abstract_inverted_index.s | 21, 37 |
| abstract_inverted_index.t | 32, 146 |
| abstract_inverted_index.22 | 70 |
| abstract_inverted_index.We | 108, 165, 195 |
| abstract_inverted_index.an | 100, 104 |
| abstract_inverted_index.as | 225 |
| abstract_inverted_index.at | 144 |
| abstract_inverted_index.be | 39, 127 |
| abstract_inverted_index.in | 46, 149 |
| abstract_inverted_index.is | 103, 157, 180, 212, 239 |
| abstract_inverted_index.of | 30, 63, 113, 121, 133, 142, 154, 162, 222, 227 |
| abstract_inverted_index.on | 94, 183, 208 |
| abstract_inverted_index.t, | 51 |
| abstract_inverted_index.to | 118, 147, 192, 244 |
| abstract_inverted_index.we | 218 |
| abstract_inverted_index."to | 8 |
| abstract_inverted_index.RSA | 101 |
| abstract_inverted_index.The | 35, 152 |
| abstract_inverted_index.and | 85, 204, 232 |
| abstract_inverted_index.any | 42 |
| abstract_inverted_index.are | 2, 137 |
| abstract_inverted_index.can | 13, 126 |
| abstract_inverted_index.for | 5, 69, 159, 241 |
| abstract_inverted_index.has | 33, 66, 73 |
| abstract_inverted_index.the | 9, 61, 95, 130, 150, 160, 167, 174, 206, 216 |
| abstract_inverted_index.ago, | 82 |
| abstract_inverted_index.also | 196 |
| abstract_inverted_index.been | 67, 75 |
| abstract_inverted_index.from | 41, 173, 189, 229 |
| abstract_inverted_index.give | 116 |
| abstract_inverted_index.less | 49 |
| abstract_inverted_index.many | 58 |
| abstract_inverted_index.mere | 131 |
| abstract_inverted_index.only | 74 |
| abstract_inverted_index.rise | 117 |
| abstract_inverted_index.runs | 45 |
| abstract_inverted_index.show | 109 |
| abstract_inverted_index.some | 209 |
| abstract_inverted_index.such | 155, 224, 242 |
| abstract_inverted_index.than | 50 |
| abstract_inverted_index.that | 22, 44, 97, 110, 139, 198 |
| abstract_inverted_index.thus | 205 |
| abstract_inverted_index.time | 31, 47 |
| abstract_inverted_index.with | 18, 56, 169 |
| abstract_inverted_index.work | 228 |
| abstract_inverted_index.(that | 238 |
| abstract_inverted_index.While | 60 |
| abstract_inverted_index.based | 93, 182 |
| abstract_inverted_index.depth | 143 |
| abstract_inverted_index.imply | 201 |
| abstract_inverted_index.large | 28 |
| abstract_inverted_index.least | 145 |
| abstract_inverted_index.other | 220 |
| abstract_inverted_index.shown | 128 |
| abstract_inverted_index.there | 72 |
| abstract_inverted_index.types | 221 |
| abstract_inverted_index.until | 25 |
| abstract_inverted_index.where | 176 |
| abstract_inverted_index.which | 136 |
| abstract_inverted_index.whose | 124 |
| abstract_inverted_index.years | 81 |
| abstract_inverted_index.Shamir | 84 |
| abstract_inverted_index.Wagner | 86 |
| abstract_inverted_index.above, | 217 |
| abstract_inverted_index.amount | 29 |
| abstract_inverted_index.around | 68 |
| abstract_inverted_index.better | 178 |
| abstract_inverted_index.hidden | 24, 40 |
| abstract_inverted_index.modulo | 99 |
| abstract_inverted_index.notion | 62 |
| abstract_inverted_index.proofs | 226 |
| abstract_inverted_index.puzzle | 17, 92 |
| abstract_inverted_index.sender | 12 |
| abstract_inverted_index.should | 38 |
| abstract_inverted_index.single | 77 |
| abstract_inverted_index.years, | 71 |
| abstract_inverted_index.Fifteen | 80 |
| abstract_inverted_index.Rivest, | 83 |
| abstract_inverted_index.decide, | 148 |
| abstract_inverted_index.exist). | 245 |
| abstract_inverted_index.flavors | 112 |
| abstract_inverted_index.integer | 102 |
| abstract_inverted_index.observe | 197 |
| abstract_inverted_index.one-way | 190, 202 |
| abstract_inverted_index.puzzles | 1, 65, 120, 200, 223, 243 |
| abstract_inverted_index.quickly | 14 |
| abstract_inverted_index.ranging | 188 |
| abstract_inverted_index.remains | 23 |
| abstract_inverted_index.require | 140 |
| abstract_inverted_index.sending | 6 |
| abstract_inverted_index.various | 111 |
| abstract_inverted_index.varying | 122 |
| abstract_inverted_index.Finally, | 214 |
| abstract_inverted_index.assuming | 129 |
| abstract_inverted_index.circuits | 141 |
| abstract_inverted_index.elapsed. | 34 |
| abstract_inverted_index.future". | 10 |
| abstract_inverted_index.generate | 15 |
| abstract_inverted_index.hardness | 236 |
| abstract_inverted_index.messages | 7 |
| abstract_inverted_index.obtained | 181 |
| abstract_inverted_index.parallel | 54 |
| abstract_inverted_index.puzzles. | 164 |
| abstract_inverted_index.reliance | 207 |
| abstract_inverted_index.security | 125 |
| abstract_inverted_index.solution | 20, 36 |
| abstract_inverted_index.stronger | 185 |
| abstract_inverted_index.suitable | 234 |
| abstract_inverted_index.Time-lock | 0 |
| abstract_inverted_index.adversary | 43 |
| abstract_inverted_index.beautiful | 89 |
| abstract_inverted_index.candidate | 78, 90 |
| abstract_inverted_index.construct | 219 |
| abstract_inverted_index.different | 170 |
| abstract_inverted_index.encodings | 115, 172, 231 |
| abstract_inverted_index.existence | 132, 153, 161 |
| abstract_inverted_index.functions | 191 |
| abstract_inverted_index.including | 52 |
| abstract_inverted_index.languages | 138, 156 |
| abstract_inverted_index.mechanism | 4 |
| abstract_inverted_index.necessary | 158, 240 |
| abstract_inverted_index.proposed. | 79 |
| abstract_inverted_index.suggested | 87 |
| abstract_inverted_index.time-lock | 64, 91, 119, 163, 199 |
| abstract_inverted_index.assumption | 96, 211, 237 |
| abstract_inverted_index.efficiency | 179 |
| abstract_inverted_index.functions, | 203 |
| abstract_inverted_index.languages, | 135 |
| abstract_inverted_index.moderately | 27 |
| abstract_inverted_index.necessary. | 213 |
| abstract_inverted_index.randomized | 114, 171, 230 |
| abstract_inverted_index.strengths, | 123 |
| abstract_inverted_index.worst-case | 235 |
| abstract_inverted_index."inherently | 105 |
| abstract_inverted_index.adversaries | 55 |
| abstract_inverted_index.instantiate | 166 |
| abstract_inverted_index.literature, | 175 |
| abstract_inverted_index.processors. | 59 |
| abstract_inverted_index.resourceful | 53 |
| abstract_inverted_index.sequential" | 106 |
| abstract_inverted_index.worst-case. | 151 |
| abstract_inverted_index.assumptions, | 187 |
| abstract_inverted_index.computation. | 107 |
| abstract_inverted_index.construction | 168 |
| abstract_inverted_index.generalizing | 215 |
| abstract_inverted_index.increasingly | 177, 184 |
| abstract_inverted_index.obfuscation. | 194 |
| abstract_inverted_index.polynomially | 57 |
| abstract_inverted_index.cryptographic | 186, 210 |
| abstract_inverted_index.significantly | 48 |
| abstract_inverted_index.exponentiation | 98 |
| abstract_inverted_index.non-parallelizing | 134 |
| abstract_inverted_index.indistinguishability | 193 |
| cited_by_percentile_year.max | 100 |
| cited_by_percentile_year.min | 97 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 6 |
| citation_normalized_percentile.value | 0.98647533 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | True |