Time capsule signature

Lecture Notes in Computer Science

Volumn 3570, Issue , 2005, Pages 57-71

  Dodis, Yevgeniy ^a   Yum, Dae Hyun ^a,b  

^a POLYTECHNIC UNIVERSITY   (United States)

^b Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION ANALYSIS; INFORMATION RETRIEVAL;

IDTHTR; KPI; TIME CAPSULE SIGNATURE;

CRYPTOGRAPHY;

EID: 26444461506     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11507840_6     Document Type: Conference Paper

References (32)

1. N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. In EUROCRYPT 1998, LNCS 1403, pp. 591-606, Springer, 1998.
2. N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. IEEE J. Select. Areas Commun, 18(4), pp. 593-610, 2000.
3. M. Bellare and S. Goldwasser. Encapsulated key escrow. MIT Laborator for Computer Science Technical Report 688, 1996.
4. M. Bellare and S. Goldwasser. Verifiable partial key escrow. In the 4th ACM CCS, pp. 78-91, 1997.
5. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In the 1st ACM CCS, pp. 62-73, 1993.
6. I. Blake and A. Chan. Scalable, server-passive, user-anonymous timed release public key encryption from bilinear pairing. http://eprint.iacr.org/ 2004/211/.
7. D. Boneh and M. Franklin. Identity based encryption from the Weil pairing. In CRYPTO 2001, LNCS 2139, pp. 213-229, Springer, 2001.
8. D. Boneh, C. Gentry, B. Lynn, and H. Shacham. Aggregate and verifiably encrypted signatures from bilinear maps. In EUROCRYPT 2003, pp. 416-432.
9. D. Boneh, B. Lynn and H. Shacham. Short signatures from the Weil pairing. In ASIACRYPT 2001, LNCS 2248, pp. 514-532, Springer, 2001.
10. D. Boneh and M. Naor. Timed commitments. In CRYPTO 2000, pp. 236-254.
11. J. Camenisch and A. Lysyanskaya. Signature schemes with efficient protocols. In SCN 2002, LNCS 2576, pp. 268-289, Springer, 2002.
12. J. Camenisch and A. Lysyanskaya. Signature schemes and anonymous credentials from bilinear maps. In CRYPTO 2004, LNCS 3152, pp. 56-72, Springer, 2004.
13. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In CRYPTO 1994, pp. 174-187.
14. Y. Dodis and L. Reyzin. Breaking and repairing optimistic fair exchange from PODC 2003. In Digital Rights Management 2003, pp. 47-54, 2003.
15. C. Dwork and M. Naor. Pricing via processing or combatting junk mail. In CRYPTO 1992, LNCS 740, pp. 139-147, Springer, 2004.
16. U. Feige and A. Shamir. Zero knowledge proofs of knowledge in two rounds. In CRYPTO 1989, LNCS 435, pp. 526-544, Springer, 1989.
17. U. Feige and A. Shamir. Witness indistinguishable and witness hiding protocols. In the 22nd Annual ACM Symposium on Theory of Computing, pp. 416-426, 1990.
18. A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In CRYPTO 1986, LNCS 263, pp. 186-194, Springer, 1986.
19. J. Garay and M. Jakobsson. Timed release of standard digital signatures. In Financial Cryptography 2002, LNCS 2357, pp. 168-182, Springer, 2002.
20. J. Garay and C. Pomerance. Timed fair exchange of standard signatures. In Financial Cryptography 2003, LNCS 2742, pp. 190-207, Springer, 2003.
21. O. Goldreich, S. Micali and A.Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, 38(3), pp. 691-729, 1991.
22. L. Guillou and J.J. Quisquater. A "paradoxical" indentity-based signature scheme resulting from zero-knowledge. In CRYPTO 1988, pp. 216-231, Springer, 1988.
23. R. Impagliazzo and S. Rudich. Limits on the provable consequences of one-way permutations. In the 21st STOC, pp. 44-61, 1989.
24. A. Joux and K. Nguyen. Separating decision Diffie-Hellman from Diffie-Hellman in cryptographic groups. http://eprint.iacr.org/2001/003/.
25. I. Osipkov, Y. Kim and J. Cheon. New approaches to timed-release cryptography. http://eprint.iacr.org/2004/231/.
26. R. Pass. On deniability in the common reference string and random oracle model. In CRYPTO 2003, LNCS 2729, pp. 316-337, Springer, 2003.
27. D. Pointcheval and J. Stern. Security proofs for signature schemes. In EURO-CRYPT 1996, LNCS 1070, pp. 387-398, Springer, 1996.
28. R. Rivest, A. Shamir, and D. Wagner. Time lock puzzles and timed release cryptography. Technical report, MIT/LCS/TR-684.
29. J. Rompel. One-way functions are necessary and sufficient for secure signatures. In the 22nd Annual ACM Symposium on Theory of Computing, pp. 387-394, 1990.
30. A. De Santis and G. Persiano. Zero-knowledge proofs of knowledge without interaction. In the 33rd FOCS, pp. 427-436, 1992.
31. C. Schnorr. Efficient identification and signatures for smart cards. In CRYPTO 1989, LNCS 435, pp. 239-252, Springer, 1989.
32. A. Shamir. Identity-based cryptosystems and signature schemes. In CRYPTO 1984, LNCS 196, pp. 47-53, Springer, 1984.