Time-lock puzzles and timed-release Crypto
نویسنده
چکیده
Our motivation is the notion of \timed-release crypto," where the goal is to encrypt a message so that it can not be decrypted by anyone, not even the sender, until a pre-determined amount of time has passed. The goal is to \send information into the future." This problem was rst discussed by Timothy May [6]. What are the applications of \timed-release crypto"? Here are a few possibilities (some due to May):
منابع مشابه
Sending Message into a Deenite Future: Non-parallelizable Case
We construct a proof of membership protocol that uses log 2 t steps to prove an element to have the structure a 2 t (modn) given public values n; a; t where n is the product of two large secret primes. Such a proof serves a concrete basis of trust for a time-lock puzzle scheme and its applications in timed-release cryptography. The achieved ef-ciency expressed in log 2 t (number of modulo expon...
متن کاملCombating Spam and Denial-of-Service Attacks with Trusted Puzzle Solvers
Cryptographic puzzles can be used to mitigate spam and denial-of-service (DoS) attacks, as well as to implement timed-release cryptography. However, existing crypto puzzles are impractical because: (1) solving them wastes computing resources and/or human time, (2) the time it takes to solve them can vary dramatically across computing platforms, and/or (3) applications become non-interoperable d...
متن کاملTime-Lock Puzzles in the Random Oracle Model
A time-lock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until enough time has elapsed for the puzzle to be solved. For timelock puzzles to be useful, generating a puzzle should take less time than solving it. Since adversaries may have access to many more computers than honest solvers, massive...
متن کاملSending Message into a De nite Future: Non-Parallelizable Case
We construct a proof of membership protocol that uses log2 t steps to prove an element to have the structure a t (modn) given public values n; a; t where n is the product of two large secret primes. Such a proof serves a concrete basis of trust for a time-lock puzzle scheme and its applications in timed-release cryptography. The achieved efciency expressed in log2 t (number of modulo exponentia...
متن کامل