Timed release of standard digital signatures extended abstract

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

Volumn 2357, Issue , 2003, Pages 168-182

  Garay, Juan A ^a   Jakobsson, Markus ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b RSA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; CHROMIUM COMPOUNDS;

DSA SIGNATURES; EXTENDED ABSTRACTS; TIME LINE;

CRYPTOGRAPHY;

EID: 84957040406     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36504-4_13     Document Type: Conference Paper

References (25)

1. F. Bao. An efficient verifiable encryption scheme for encryption of discrete logarithms. In Proc. CARDIS'98, 1998.
2. L. Blum, M. Blum, and M. Shub. A simple unpredictable pseudorandom number generator. SI AM Journal on Computing, 15(2):364-383, May 1986.
3. E. Brickell, D. Chaum, I. Damgard, and J. van de Graaf. Gradual and verifiable release of a secret (extended abstract). In Advances in Cryptology—CRYPTO '87, volume 293 of Lecture Notes in Computer Science, pages 156-166. Springer-Verlag, 1988, 16-20 August 1987.
4. M. Bellaxe and S. Goldwasser. Encapsulated key escrow. In MIT/LCS/TR-688, 1996.
5. M. Belleire aaid S. Goldwasser. Verifiable paxtial key escrow. In Proc. ACM CCS, pages 78-91, 1997.
6. D. Bleichenbacher. On the distribution of DSA session keys. Manuscript, 2000.
7. D. Boneh and M. Naor. Timed commitments (extended abstract). In Advances in Cryptology—CRYPTO '00, volume 1880 of Lecture Notes in Computer Science, pages 236-254. Springer-Verlag, 2000.
8. F. Boudot. Efficient proofs that a committed number lies in an interval. In Advances in Cryptology—EUROCRYPT '00, volume 1807 of Lecture Notes in Computer Science, pages 431-444. Springer-Verlag, 2000.
9. F. Boudot and J. Traore. Efficient publicly verifiable secret sharing schemes with fast or delayed recovery. In Proc. 2nd International Conference on Information and Communication Security, volume 1726 of Lecture Notes in Computer Science, pages 87-102. Springer-Verlag, 1999.
10. D. Chaum. Bhnd signatures for untraceable payments. In Advances in Cryptology: Proceedings of Crypto 82, pages 199-203. Plenum Press, New York and London, 1983, 23-25 August 1982.
11. R. Cramer, I. Damgard, and B. Schoenmalcers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology—CRYPTO '94, volume 839 of Lecture Notes in Computer Science, pages 174-187. Springer-Verlag, 21-25 August 1994.
12. D. Chaum, J. Evertse, and J. van de Graaf. An improved protocol for demonstrating possession of discrete logarithms and some generalizations. In Advances in Cryptology—EUROCRYPT 87, volume 304 of Lecture Notes in Computer Science, pages 127-141. Springer-Verlag, 1988, 13-15 April 1987.
13. A. Chan, Y. Prankel, and Y. Thiounis. Easy come - easy go divisible cash. In Advances in Cryptology—EUROCRYPT 98, volume 1403 of Lecture Notes in Computer Science, pages 561-575. Springer-Verlag, 1998.
14. J. Camenisch and M. Michels. Separability and efficiency for generic group signature schemes (extended abstract). In Advances in Cryptology—CRYPTO '99, volume 1666 of Lecture Notes in Computer Science, pages 414-430. Springer-Verlag, 1999.
15. D. Chaum and T. Pedersen. Wallet databases with observers (extended abstract). In CRYPTO'92 [CRY92], pages 89-105.
16. Advances in Cryptology—CRYPTO '92, volume 740 of Lecture Notes in Computer Science. Springer-Verlag, 1993, 16-20 August 1992.
17. C. Dwork and M. Naor. Pricing via processing or combatting junk mail. In CRYPTO'92 [CRY92], pages 139-147.
18. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology—CRYPTO '86, volume 263 of Lecture Notes in Computer Science, pages 186-194. Springer-Verlag, 1987, 11-15 August 1986.
19. S. Galbraith, W. Mao, and K. Paterson. A cautionary note regarding cryptographic protocols based on composite integers. In HPL-2001-284, 2001.
20. W. Mao. Guaranteed correct sharing of integer factorization with offline shareholders. In Proa. Public Key Cryptography '98, pages 27-42, 1998.
21. T. May. Timed-release crypto. In http://www.hks.net.cpuiiks/cpunks-0/1460.html, 1993.
22. P. Paillier. Public-key cryptosystems based on composite degree residuosity. In Jacques Stern, editor, Advances in Cryptology—EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 223-238. Springer-Verlag, 1999.
23. R. Rivest, A. Shamir, and D. Wagner. Time-lock puzzles and timedrelease crypto. In MIT/LCS/TR-684, 1996.
24. A. Shamir. Identity-based cryptosystems and signature schemes. In Advances in Cryptology: Proceedings of CRYPTO 84, volume 196 of Lecture Notes in Computer Science, pages 47-53. Springer-Verlag, 1985, 19-22 August 1984.
25. A. Shamir. Partial key escrow: A new approach to software key escrow. In Key Escrow Conference, 1995.