Abstract
Rivest et al proposed a time-lock puzzle scheme for encrypting messages which can only be decrypted in the future. Such a puzzle specifies an algorithm for decrypting the message locked in and the specified algorithm has a well understood time complexity. However, that time-lock puzzle scheme does not provide a means for one to examine whether a puzzle has been formed in good order. Consequently, one may foolishly waste a lengthy time on trying to solve an intractable problem. This weakness prohibits that scheme from applications that involve mutually untrusted parties. We propose a new time-lock puzzle scheme which includes an efficient protocol that allows examination of the time needed for decrypting the message locked in.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Burmester, M., Desmedt, Y., Seberry, J.: Equitable key escrow with limited time span. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 380–391. Springer, Heidelberg (1998)
Damgård, I.B.: Practical and provably secure release of a secret and exchange of signatures. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 201–217. Springer, Heidelberg (1994)
Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryp-tography. CRC Press, Boca Raton (1997)
Pollard, J.M.: Monte Carlo method for index computation (mod p). Mth. Comp. 32(143), 918–924 (1978)
Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puz- zles and timed-release crypto. Manuscript, Available at http://theory.lcs.mit.edu/~rivest/RivestShamirWagner-timelock.ps
van de Graaf, J., Peralta, R.: A simple and secure way to show the validity of your public key. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 128–134. Springer, Heidelberg (1988)
van Oorschot, P.C., Wiener, M.J.: Parallel collision search with cryptanalytic applications. J. of Cryptology 12(1), 1–28 (1999), http://theory.lcs.mit.edu/rivest/RivestShamirWagner-timelock.ps
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mao, W. (1999). Send Message into a Definite Future. In: Varadharajan, V., Mu, Y. (eds) Information and Communication Security. ICICS 1999. Lecture Notes in Computer Science, vol 1726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-47942-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-47942-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66682-0
Online ISBN: 978-3-540-47942-0
eBook Packages: Springer Book Archive