Building on the recent work by Boneh and Naor on timed commitments, we introduce the notion of a reusable time-line, which, besides allowing the release of standard signatures, lowers the session costs of existing timed applications.
Category / Keywords: applications / Timed release cryptography, timed commitments, blind signatures, pseudo-random number generators, discrete logarithm problem Publication Info: FC '02 Date: received 26 Feb 2002, withdrawn 9 May 2002 Contact author: mjakobsson at rsasecurity com Available format(s): (-- withdrawn --) Version: 20020509:191214 (All versions of this report) Short URL: ia.cr/2002/024 Discussion forum: Show discussion | Start new discussion