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. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Chalkias, K., Hristu-Varsakelis, D., & Stephanides, G. (2007). Improved anonymous timed-release encryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4734 LNCS, pp. 311–326). Springer Verlag. https://doi.org/10.1007/978-3-540-74835-9_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
