[6747] in cryptography@c2.net mail archive

home help back first fref pref prev next nref lref last post

Re: time dependant

daemon@ATHENA.MIT.EDU (Zulfikar A Ramzan)
Wed Mar 8 00:21:45 2000

Message-Id: <200003080519.AAA17073@w20-575-14.mit.edu>
To: cryptography@c2.net
Date: Wed, 08 Mar 2000 00:19:31 -0500
From: Zulfikar A Ramzan <zulfikar@MIT.EDU>


One nice number-theoretic approach to the problem of preventing someone
(including the original sender) from decrypting a message before a
certain amount of time elapses can be found in the paper:  

Time-lock puzzles and timed-release Crypto
    by Ronald L. Rivest, Adi Shamir, and David A. Wagner.

which is avaialable from:

http://theory.lcs.mit.edu/~rivest/publications.html

The difficulty with this problem, in general, is that the notions of
cpu time and real time don't often coincide.    

Hope this help,

Zulfikar.



home help back first fref pref prev next nref lref last post