Adaptively secure two-party computation with erasures

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

Volumn 5473, Issue , 2009, Pages 117-132

  Lindell, Andrew Y ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SECURITY; CIRCUIT CONSTRUCTION; COMMUNICATION COST; MULTIPARTY COMPUTATION; SECURE MULTI-PARTY COMPUTATION; SECURE PROTOCOLS; SECURE TWO-PARTY COMPUTATIONS; SECURITY PROPERTIES;

CRYPTOGRAPHY; NETWORK SECURITY;

NETWORK PROTOCOLS;

EID: 67650164732     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00862-7_8     Document Type: Conference Paper

References (27)

1. Beaver, D.: Foundations of secure interactive computing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 377-391. Springer, Heidelberg (1992)
2. Beaver, D.: Plug and play encryption. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 75-89. Springer, Heidelberg (1997) (Pubitemid 127112545)
3. Beaver, D., Haber, S.: Cryptographic protocols provably secure against dynamic adversaries. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 307-323. Springer, Heidelberg (1993)
4. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: 20th STOC, pp. 1-10 (1988)
5. Canetti, R.: Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology 13(1), 143-202 (2000)
6. Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: 42nd FOCS, pp. 136-145 (2001), http://eprint.iacr. org/2000/067 (Pubitemid 33068374)
7. Canetti, R., Damgård, I., Dziembowski, S., Ishai, Y., Malkin, T.: Adaptive versus Non-Adaptive Security of Multi-Party Protocols. Journal of Cryptology 17(3), 153-207 (2004)
8. Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively Secure Multi-Party Computation. In: 28th STOC, pp. 639-648 (1996)
9. Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Adaptive security for threshold cryptosystems. In:Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 98-115. Springer, Heidelberg (1999)
10. Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally Composable Two-Party and Multi-Party Computation. In: 34th STOC, pp. 494-503 (2002), http://eprint.iacr.org/2002/140 (Pubitemid 35009410)
11. Chaum, D., Crépeau, C., Damgå, I.: rd. Multi-party Unconditionally Secure Protocols. In: 20th STOC, pp. 11-19 (1988)
12. Even, S., Goldreich, O., Lempel, A.: A Randomized Protocol for Signing Contracts. Communications of the ACM 28(6), 637-647 (1985)
13. Frankel, Y., MacKenzie, P.D., Yung, M.: Adaptively-secure optimal-resilience proactive RSA. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 180-195. Springer, Heidelberg (1999)
14. Garay, J.A., MacKenzie, P.D., Yang, K.: Efficient and Universally Composable Committed Oblivious Transfer and Applications. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 297-316. Springer, Heidelberg (2004)
15. Goldreich, O.: Foundations of Cryptography. Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)
16. 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); for details see [15]
17. Goldwasser, S., Levin, L.A.: 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)
18. Kushilevitz, E., Lindell, Y., Rabin, T.: Information-Theoretically Secure Protocols and Security Under Composition. In: The em 38th STOC, pp. 109-118 (2006) (Pubitemid 44306543)
19. Jarecki, S., Lysyanskaya, A.: Adaptively secure threshold cryptography: Introducing concurrency, removing erasures (Extended abstract). In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 221-242. Springer, Heidelberg (2000)
20. Lindell, Y.: General Composition and Universal Composability in Secure Multi-Party Computation. In: 44th FOCS, pp. 394-403 (2003)
21. Lindell, Y.: Adaptively Secure Two-Party Computation with Erasures (full version of this paper). Cryptology ePrint Archive (2009)
22. Lindell, Y., Pinkas, B.: A Proof of Security of Yao's Protocol for Two-Party Computation. the Journal of Cryptology (to appear)
23. Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 52-78. Springer, Heidelberg (2007)
24. Lindell, Y., Zarosim, H.: Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 183-201. Springer, Heidelberg (2009)
25. Micali, S., Rogaway, P.: Secure computation. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 392-404. Springer, Heidelberg (1992)
26. Wolf, S., Wullschleger, J.: Oblivious transfer is symmetric. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 222-232. Springer, Heidelberg (2006) (Pubitemid 44072242)
27. Yao, A.: How to Generate and Exchange Secrets. In: 27th FOCS, pp. 162-167 (1986)