Optimistic fair secure computation

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

Volumn 1880, Issue , 2000, Pages 93-111

  Cachin, Christian ^a   Camenisch, Jan ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ASYNCHRONOUS NETWORKS; DECISIONAL DIFFIE HELLMAN ASSUMPTION; OBLIVIOUS TRANSFER; PROTOCOL EXECUTION; SECURE COMPUTATION; SECURE FUNCTION EVALUATION; SECURE TWO-PARTY COMPUTATIONS; TRUSTED THIRD PARTIES;

CRYPTOGRAPHY;

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

References (36)

1. N. Asokan, M. Schunter, and M. Waidner, “Optimistic protocols for fair exchange,” in Proc. 4th ACM Conference on Computer and Communications Security, pp. 6, 8-17, 1997.
2. N. Asokan, V. Shoup, and M. Waidner, “Optimistic fair exchange of digital signatures,” IEEE Journal on Selected Areas in Communications, vol. 18, pp. 591-610, Apr. 2000.
3. B. Baum-Waidner and M. Waidner, “Optimistic asynchronous multi-party contract signing,” Research Report RZ 3078 (#93124), IBM Research, Nov. 1998.
4. D. Beaver, “Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority,” Journal of Cryptology, vol. 4, no. 2, pp. 75-122, 1991.
5. D. Beaver and S. Goldwasser, “Multiparty computation with faulty majority (extended announcement),” in Proc. 30th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 468-473, 1989.
6. D. Beaver, S. Micali, and P. Rogaway, “The round complexity of secure protocols,” in Proc. 22nd Annual ACM Symposium on Theory of Computing (STOC), pp. 503-513, 1990.
7. M. Bellare and S. Micali, “Non-interactive oblivious transfer and applications,” in Advances in Cryptology: CRYPTO ’89 (G. Brassard, ed.), vol. 435 of Lecture Notes in Computer Science, pp. 547-557, Springer, 1990.
8. M. Ben-Or, O. Goldreich, S. Micali, and R. L. Rivest, “A fair protocol for signing contracts,” IEEE Transactions on Information Theory, vol. 36, pp. 40-46, Jan. 1990.
9. E. F. Brickell, D. Chaum, I. Damgård, and J. van de Graaf, “Gradual and verifiable release of a secret,” in Advances in Cryptology: CRYPTO ’87 (C. Pomerance, ed.), vol. 293 of Lecture Notes in Computer Science, Springer, 1988.
10. J. Camenisch and I. Damgård, “Verifiable encryption and applications to group signatures and signature sharing,” Tech. Rep. RS-98-32, BRICS, Departement of Computer Science, University of Aarhus, Dec. 1998.
11. J. Camenisch and M. Stadler, “Efficient group signature schemes for large groups,” in Advances in Cryptology: CRYPTO ’97 (B. Kaliski, ed.), vol. 1233 of Lecture Notes in Computer Science, pp. 410-424, Springer, 1997.
12. R. Canetti, “Security and composition of multi-party cryptographic protocols,” Journal of Cryptology, vol. 13, no. 1, pp. 143-202, 2000.
13. D. Chaum, I. Damgård, and J. van de Graaf, “Multiparty computations ensuring privacy of each party’s input and correctness of the result,” in Advances in Cryptology: CRYPTO ’87 (C. Pomerance, ed.), vol. 293 of Lecture Notes in Computer Science, Springer, 1988.
14. D. Chaum and T. P. Pedersen, “Wallet databases with observers,” in Advances in Cryptology: CRYPTO ’92 (E. F. Brickell, ed.), vol. 740 of Lecture Notes in Computer Science, pp. 89-105, Springer-Verlag, 1993.
15. R. Cleve, “Limits on the security of coin flips when half the processors are faulty,” in Proc. 18th Annual ACM Symposium on Theory of Computing (STOC), pp. 364-369, 1986.
16. R. Cramer and I. Damgård, “Linear zero-knowledge—a note on efficient zeroknowledge proofs and arguments,” in Proc. 29th Annual ACM Symposium on Theory of Computing (STOC), 1997.
17. R. Cramer, I. Damgård, and B. Schoemakers, “Proofs of partial knowledge and simplified design of witness hiding protocols,” in Advances in Cryptology: CRYPTO ’94 (Y. G. Desmedt, ed.), vol. 839 of Lecture Notes in Computer Science, 1994.
18. R. Cramer and V. Shoup, “A practical public-key cryptosystem provably secure against adaptive chosen-ciphertext attack,” in Advances in Cryptology: CRYPTO ’98 (H. Krawczyk, ed.), vol. 1462 of Lecture Notes in Computer Science, Springer, 1998.
19. C. Crépeau, J. van de Graaf, and A. Tapp, “Committed oblivious transfer and private multi-party computation,” in Advances in Cryptology: CRYPTO ’95 (D. Coppersmith, ed.), vol. 963 of Lecture Notes in Computer Science, Springer, 1995.
20. I. B. Damgård, “Efficient concurrent zero-knowledge in the auxiliary string model,” in Advances in Cryptology: EUROCRYPT 2000 (B. Preneel, ed.), vol. 1087 of Lecture Notes in Computer Science, pp. 418-430, Springer, 2000.
21. D. Dolev, C. Dwork, and M. Naor, “Non-malleable cryptography (extended abstract),” in Proc. 23rd Annual ACM Symposium on Theory of Computing (STOC), pp. 542-552, 1991.
22. T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Transactions on Information Theory, vol. 31, pp. 469-472, July 1985.
23. S. Even, O. Goldreich, and A. Lempel, “A randomized protocol for signing contracts,” Communications of the ACM, vol. 28, pp. 637-647, 1985.
24. U. Feige, J. Kilian, and M. Naor, “A minimal model for secure computation (extended abstract),” in Proc. 26th Annual ACM Symposium on Theory of Computing (STOC), pp. 554-563, 1994.
25. O. Goldreich, “Secure multi-party computation.” Manuscript, 1998. (Version 1.1).
26. O. Goldreich, S. Micali, and A. Wigderson, “How to play any mental game or a completeness theorem for protocols with honest majority,” in Proc. 19th Annual ACM Symposium on Theory of Computing (STOC), pp. 218-229, 1987.
27. S. Goldwasser and L. Levin, “Fair computation of general functions in presence of immoral majority,” in Advances in Cryptology: CRYPTO ’90 (A. J. Menezes and S. A. Vanstone, eds.), vol. 537 of Lecture Notes in Computer Science, Springer, 1991.
28. S. Goldwasser and S. Micali, “Probabilistic encryption,” Journal of Computer and System Sciences, vol. 28, pp. 270-299, 1984.
29. S. Micali, “Secure protocols with invisible trusted parties.” Presentation at the Workshop on Multi-Party Secure Protocols, Weizmann Institute of Science, Israel, June 1998.
30. S. Micali and P. Rogaway, “Secure computation,” in Advances in Cryptology: CRYPTO ’91 (J. Feigenbaum, ed.), vol. 576 of Lecture Notes in Computer Science, pp. 392-404, Springer, 1992.
31. M. Naor and O. Reingold, “Number-theoretic constructions of efficient pseudorandom functions,” in Proc. 38th IEEE Symposium on Foundations of Computer Science (FOCS), 1997.
32. M. O. Rabin, “How to exchange secrets by oblivious transfer,” Tech. Rep. TR-81, Harvard University, 1981.
33. C. P. Schnorr, “Efficient signature generation by smart cards,” Journal of Cryptology, vol. 4, pp. 161-174, 1991.
34. M. Stadler, “Publicly verifiable secret sharing,” in Advances in Cryptology: EUROCRYPT ’96 (U. Maurer, ed.), vol. 1233 of Lecture Notes in Computer Science, pp. 190-199, Springer, 1996.
35. A. C. Yao, “Protocols for secure computation,” in Proc. 23rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 160-164, 1982.
36. A. C. Yao, “How to generate and exchange secrets,” in Proc. 27th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 162-167, 1986.