Timed-release cryptography

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2259, Issue , 2001, Pages 342-357

  Mao, Wenbo ^a  

^a HEWLETT PACKARD LABORATORIES   (United Kingdom)

Author keywords

Efficient zero knowledge protocols; Non parallelisability; Time lock puzzles; Timed release cryptography

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPOSITE NUMBERS; EFFICIENT PROTOCOLS; NON-PARALLELISABILITY; TIME-LOCK PUZZLES; TIMED-RELEASE CRYPTOGRAPHY; TIMED-RELEASE ENCRYPTION; ZERO KNOWLEDGE PROOF; ZERO-KNOWLEDGE PROTOCOLS;

CRYPTOGRAPHY;

EID: 84949193057     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45537-x_27     Document Type: Conference Paper

References (13)

1. Blum, M. Coin Flipping by Telephone: A Protocol for Solving Impossible Problems, Proceedings of the 24th IEEE Computer Conference, pages 133–137, 1981.
2. Boyar, J., Friedl, K. and Lund, C. Practical zero-knowledge proofs: Giving hints and using deficiencies, Advances in Cryptology — Proceedings of EUROCRYPT 89 (J.-J. Quisquater and J. Vandewalle, eds.), Lecture Notes in Computer Science 434, Springer-Verlag 1990, pages 155–172.
3. Boneh, D. and Naor, M. Timed commitments (extended abstract), Advances in Cryptology: Proceedings of CRYPTO’00, Lecture Notes in Computer Science 1880, Springer-Verlag 2000, pages 236–254.
4. Camenisch J. and Michels, M. Proving in zero-knowledge that a number is the product of two safe primes, In Advances in Cryptology — EUROCRYPT 99 (J. Stern ed.), Lecture Notes in Computer Science 1592, Springer-Verlag 1999, pages 106–121.
5. Chaum, D. Zero-knowledge undeniable signatures, Advances in Cryptology: Proceedings of CRYPTO 90 (I.B. Damgaard, ed.) Lecture Notes in Computer Science 473, Springer-Verlag 1991, pages 458-464.
6. Damgård, I. Practical and probably secure release of a secret and exchange of signatures, Advances in Cryptology—Proceedings of EUROCRYPT 93 (T. Helleseth ed.), Lecture Notes in Computer Science 765, Springer-Verlag 1994, pages 200–217.
7. Fujisaki, E., Okamoto, T., Pointcheval, D. and Stern, J. RSA-OAEP is Secure under the RSA Assumption, To appear in Advances in Cryptology: Proceedings of CRYPTO 01, Springer-Verlag 2001.
8. Galbraith, S., Mao, W. and Paterson, K. RSA-based undeniable signatures for general moduli, to appear in the 2002 RSA Conference, Cryptographers’ Track, February 2002.
9. Goldreich, O., Micali, S. and Wigderson, A. How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design, Advances in Cryptology — Proceedings of CRYPTO 86 (A.M. Odlyzko ed.), Lecture Notes in Computer Science, Springer-Verlag 263 (1987), pages 171–185.
10. Rivest, R.L. Description of the LCS35 Time Capsule Crypto-Puzzle, http://www.lcs.mit.edu/about/tcapintro041299, April 4th, 1999.
11. Rivest, R.L., Shamir, A. and Wagner, D.A. Time-lock puzzles and timed-release crypto, Manuscript. Available at (http://theory.lcs.mit.edu/~rivest/RivestShamirWagner-timelock.ps).
12. van de Graaf, J. and Peralta, R. A simple and secure way to show that validity of your public key, (C. Pomerance ed.), CRYPTO’87, Springer LNCS 293, (1988) 128–134.
13. van Oorschot, P.C. and Wiener, M.J. Parallel collision search with cryptanalytic applications, J. of Cryptology, Vol.12, No.1 (1999), pages 1–28.