Timed commitments

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

Volumn 1880, Issue , 2000, Pages 236-254

  Boneh, Dan ^a   Naor, Moni ^b  

^a STANFORD UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMMITMENT SCHEME; CONTRACT SIGNING; RABIN SIGNATURE; TWO-PARTY PROTOCOLS;

CRYPTOGRAPHY;

EID: 84974588386     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44598-6_15     Document Type: Conference Paper

References (38)

1. L. Adleman, and K. Kompella, “Using smoothness to achieve parallelism”, proc. of STOC 1988, pp. 528-538.
2. N. Asokan, V. Shoup and M. Waidner, “Optimistic fair exchange of digital signatures”, in proc. Eurocrypt’98, pp. 591-606, 1998.
3. G. Ateniese, “Efficient protocols for verifiable encryption and fair exchange of digital signatures”, in proc. of the 6th ACM CCS, 1999.
4. M. Bellare and S. Goldwasser, “Verifiable Partial Key Escrow”, in proc. of ACM CCS, pp. 78-91, 1997.
5. M. Bellare and S. Goldwasser, “Encapsulated key escrow”. MIT Laboratory for Computer Science Technical Report 688, April 1996.
6. M. Bellare and P. Rogaway, “The Exact Security of Digital Signatures-Ho w to Sign with RSA and Rabin”, EUROCRYPT 1996, pp. 399-416
7. M. Ben-Or, O. Goldreich, S. Micali and R. L. Rivest, “A Fair Protocol for Signing Contracts”, IEEE Transactions on Information Theory 36/1 (1990) 40-46
8. M. Blum, “How to Exchange (Secret) Keys”, STOC 1983: 440-447 and ACM TOCS 1(2): 175-193 (1983)
9. L. Blum, M. Blum and M. Shub, A Simple Unpredictable Pseudo-Random Number Generator. SIAM J. Comput. 15(2): 364-383 (1986).
10. J. Y. Cai, R. J. Lipton, R. Sedgwick, A. C. Yao, “Towards uncheatable benchmarks, Structures in Complexity”, in proc. Structures in Complexity, pp. 2-11, 1993.
11. J. Camenisch, M. Michels, “Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes”, EUROCRYPT 1999, pp. 107-122.
12. R. Canetti, O. Goldreich, S. Goldwasser and S. Micali. “Resettable Zero-Knowledge”, ECCC Report TR99-042, Oct 27, 1999 and STOC 2000.
13. D. Chaum, and T. Pederson, “Wallet databases with observers”, in Proceedings of Crypto ’92, 1992, pp. 89-105.
14. R. Cleve, “Limits on the Security of Coin Flips when Half the Processors Are Faulty”, in proc. STOC 1986, pp. 364-369.
15. R. Cleve, “Controlled gradual disclosure schemes for random bits and their applications”, in proc. Crypto’89, 1990, pp. 573-588.
16. R. Cleve, R. Impagliazzo, “Martingales, collective coin flipping and discrete control processes”, manuscript, 1993. Available: http://www.cpsc.ucalgary.ca/˜cleve/papers.html
17. I. Damgård, “Concurrent Zero-Knowledge in the auxilary string model”, in proc. EUROCRYPT 2000.
18. I. Damgård, “Practical and Provably Secure Release of a Secret and Exchange of Signatures,” J. of Cryptology 8(4): 201-222 (1995)
19. D. Dolev, C. Dwork and M. Naor, “Non-malleable Cryptography”, Preliminary version: Proc. 21st STOC, 1991. Full version: to appear, Siam J. on Computing. Available: http://www.wisdom.weizmann.ac.il/˜naor
20. C. Dwork and M. Naor, “Pricing via Processing-or-Combatting Junk Mail”, Advances in Cryptology-CRYPTO’92, pp. 139-147.
21. C. Dwork and M. Naor, “An Efficient Existentially Unforgeable Signature Scheme and Its Applications”, J. of Cryptology 11, 1998, pp. 187-208.
22. C. Dwork and M. Naor, “Zaps and their applications”, manuscript.
23. C. Dwork, M. Naor and A. Sahai, “Concurrent Zero-Knowledge”, STOC, 1998.
24. S. Even, O. Goldreich and A. Lempel, “A Randomized Protocol for Signing Contracts,” CACM 28(6): 637-647 (1985).
25. A. Fiat and A. Shamir, “How to Prove Yourself: Practical Solutions to Identification and Signature Problems”, CRYPTO’86, pp. 186-194.
26. J. A. Garay, M. Jakobsson and P. D. MacKenzie: “Abuse-Free Optimistic Contract Signing,” CRYPTO 1999, pp. 449-466.
27. O. Goldreich and H. Krawczyk. “On the Composition of Zero Knowledge Proof Systems,” SIAM J. on Computing, Vol. 25, No. 1, pp. 169-192, 1996.
28. J. Kilian, E. Petrank and C. Rackoff, “Lower Bounds for Zero Knowledge on the Internet”, FOCS 1998, pp. 484-492.
29. M. Luby, S. Micali and C. Rackoff, “How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin,” FOCS 1983, pp. 11-21
30. A. Menezes, P. van Oorschot and S. Vanstone, “Handbook of Applied Cryptography,” CRC Press, 1996.
31. M. Naor, B. Pinkas and R. Sumner, “Privacy Preserving Auctions and Mechanism Design,” Proc. of the 1st ACM conference on E-Commerce, November 1999, pp. 129-139.
32. B. Pfitzmann, M. Schunter, M. Waidner, “Optimal Efficiency of Optimistic Contract Signing,” PODC 1998: 113-122
33. M. O. Rabin, “Transaction Protection by Beacons,” JCSS 27(2): 256-267 (1983)
34. R. Richardson and J. Kilian, “On the Concurrent Composition of Zero-Knowledge Proofs,” EUROCRYPT ’99, pp. 415-431, 1999.
35. R. Rivest, A. Shamir and D. Wagner, “Time lock puzzles and timed release cryptography,” Technical report, MIT/LCS/TR-684
36. A. Rosen, “A note on the round-complexity of concurrent zero-knowledge”, these proceedings.
37. V. Shmatikov and J. C. Mitchell, “Analysis of Abuse-Free Contract Signing,” in proc. of 4th Annual Conference on Financial Cryptography, 2000.
38. J. P. Sorenson, “A Sublinear-Time Parallel Algorithm for Integer Modular Exponentiation,” manuscript.