Legally-enforceable fairness in secure two-party computation

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

Volumn 4964 LNCS, Issue , 2008, Pages 121-137

  Lindell, Andrew Y ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; SECURITY SYSTEMS;

LEGAL INFRASTRUCTURE; SECURE MULTIPARTY COMPUTATION; TWO-PARTY COMPUTATION;

DATA PRIVACY;

EID: 43149090554     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79263-5_8     Document Type: Conference Paper

References (21)

1. Asokan, N., Schunter, M., Waidner, M.: Optimistic Protocols for Fair Exchange. In: 4th CCS, pp. 8-17 (1997)
2. Beaver, D., Goldwasser, S.: Multiparty Computation with Faulty Majority. In: 30th FOCS, pp. 468-473 (1989)
3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: 20th STOC, pp. 1-10 (1988)
4. Cachin, C., Camenisch, J.: Optimistic Fair Secure Computation. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 93-111. Springer, Heidelberg (2000)
5. Canetti, R.: Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology 13(1), 143-202 (2000)
6. Canetti, R.: Universally Composable Signature, Certification, and Authentication. In: 17th IEEE Computer Security Foundations Workshop (CSFW), pp. 219-235 (2004)
7. Canetti, R., Rabin, T.: Universal Composition with Joint State. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 265-281. Springer, Heidelberg (2003)
8. Chaum, D., Crépeau, C., Damgard, I.: Multi-party Unconditionally Secure Protocols. In: 20th STOC, pp. 11-19 (1988)
9. Chen, L., Kudla, C., Paterson, K.: Concurrent Signatures. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 287-305. Springer, Heidelberg (2004)
10. Cleve, R.: Limits on the Security of Coin Flips when Half the Processors are Faulty. In: 18th STOC, pp. 364-369 (1986)
11. Garay, J., MacKenzie, P., Prabhakaran, M., Yang, K.: Resource Fairness and Composability of Cryptographic Protocols. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 404-428. Springer, Heidelberg (2006)
12. Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete Fairness in Secure Two-Party Computation (manuscript, 2007)
13. Goldreich, O.: Foundations of Cryptography. Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)
14. Goldreich, O., Micali, S., Wigderson, A.: How to Play any Mental Game - A Completeness Theorem for Protocols with Honest Majority. In: 19th STOC, pp. 218-229 (1987)
15. Goldwasser, S., Levin, L.: Fair Computation of General Functions in Presence of Immoral Majority. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 77-93. Springer, Heidelberg (1991)
16. Goldwasser, S., Lindell, Y.: Secure Computation Without Agreement. Journal of Cryptology 18(3), 247-287 (2005)
17. Lindell, Y., Lysysanskaya, A., Rabin, T.: On the Composition of Authenticated Byzantine Agreement. Journal of the ACM 53(6), 881-917 (2006)
18. Micali, S.: Secure Protocols with Invisible Trusted Parties. Presentation on Multi-Party Secure Protocols, Weizmann Institute of Science, Israel (June 1998)
19. Micali, S.: Simple and Fast Optimistic Protocols for Fair Electronic Exchange. In: 22nd PODC, pp. 12-19 (2003)
20. Pinkas, B.: Fair Secure Two-Party Computation. In: Biham, E. (ed.) EURO-CRYPT 2003. LNCS, vol. 2656, pp. 87-105. Springer, Heidelberg (2003)
21. Yao, A.: How to Generate and Exchange Secrets. In: 27th FOCS, pp. 162-167 (1986)