Paper Info
Title
Timed release cryptography from bilinear pairings using hash chains
Abstract
We propose a new Timed Release Cryptography (TRC) scheme which is based on bilinear pairings together with an S/Key-like procedure used for private key generation. Existing schemes for this task, such as time-lock puzzle approach, provide an approximate release time, dependent on the recipients' CPU speed and the beginning time of the decryption process. Additionally, some other server-based schemes do not provide scalability and anonymity because the server is actively involved in the encryption or the decryption. However, there are already protocols based on bilinear pairings that solve most of the problems referred. Our goal is to extend and combine the existing protocols with desirable properties in order to create a secure, fast and scalable TRC scheme applied to dependent or sequential events. For this purpose we used continuous hashed time-instant private keys (hash chain) in the same way the S/Key system works. Our approach decreases dramatically the number of past time-instant private keys the server stores and only two keys are needed, the last one to construct the previous keys and the first one to recursively verify the authenticity of the next keys.
Year
DOI
Venue
2006
10.1007/11909033_12
Communications and Multimedia Security
Keywords
Field
DocType
decryption process,hash chain,hashed time-instant private key,timed release cryptography,existing protocol,next key,key system work,private key generation,past time-instant private key,beginning time,approximate release time,bilinear pairings,s key
Cryptography,Computer science,Computer network,S/KEY,Encryption,Hash function,Anonymity,Public-key cryptography,Hash chain,Distributed computing,Scalability
Conference
Volume
ISSN
ISBN
4237
0302-9743
3-540-47820-5
Citations 
PageRank 
References 
12
0.58
26
Authors
2
Name
Order
Citations
PageRank
Konstantinos Chalkias1587.08
george stephanides231123.44