Paper Info
Title
Improved anonymous timed-release encryption
Abstract
We revisit the problem of "sending information into the future" by proposing an anonymous, non-interactive, server-based Timed-Release Encryption (TRE) protocol. We improve upon recent approaches by Blake and Chan, Hwang et al., and Cathalo et al., by reducing the number of bilinear pairings that users must compute, and by enabling additional pre-computations. Our solution compares favorably with existing schemes in terms of computational efficiency, communication cost and memory requirements, and is secure in the random oracle model.
Year
DOI
Venue
2007
10.1007/978-3-540-74835-9_21
ESORICS
Keywords
Field
DocType
server-based timed-release encryption,communication cost,improved anonymous timed-release encryption,recent approach,additional pre-computations,memory requirement,computational efficiency,random oracle model,bilinear pairings
Computer science,Computer security,Random oracle,Encryption,Theoretical computer science,Probabilistic encryption,Distributed computing,Bilinear interpolation
Conference
Volume
ISSN
ISBN
4734
0302-9743
3-540-74834-2
Citations 
PageRank 
References 
22
0.81
21
Authors
3
Name
Order
Citations
PageRank
Konstantinos Chalkias1587.08
Dimitrios Hristu-Varsakelis216310.20
george stephanides331123.44