Time-Lock Puzzles from Randomized Encodings
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 les...
Main Authors: | Jain, Abhishek (Author), Paneth, Omer (Author), Waters, Brent (Author), Bitansky, Nir (Contributor), Goldwasser, Shafrira (Contributor), Vaikuntanathan, Vinod (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery,
2017-12-29T20:42:53Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Indistinguishability Obfuscation: From Approximate to Exact
by: Bitansky, Nir, et al.
Published: (2017) -
Indistinguishability Obfuscation from Functional Encryption
by: Bitansky, Nir, et al.
Published: (2018) -
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
by: Bitansky, Nir, et al.
Published: (2021) -
3-Message Zero Knowledge Against Human Ignorance
by: Bitansky, Nir, et al.
Published: (2017) -
A Note on Perfect Correctness by Derandomization
by: Bitansky, Nir, et al.
Published: (2021)