Almost-everywhere secure computation

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

Volumn 4965 LNCS, Issue , 2008, Pages 307-323

  Garay, Juan A ^a   Ostrovsky, Rafail ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Almost everywhere agreement; Bounded degree networks; Expander graphs; Secure message transmission; Secure multi party computation

Indexed keywords

ALMOST-EVERYWHERE AGREEMENT; BOUNDED-DEGREE NETWORKS; SECURE MESSAGE TRANSMISSION; SECURE MULTI-PARTY COMPUTATION;

COMPUTATION THEORY; GRAPH THEORY; MESSAGE PASSING; PROBLEM SOLVING; PUBLIC KEY CRYPTOGRAPHY;

SECURITY OF DATA;

EID: 44449163037     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78967-3_18     Document Type: Conference Paper

References (33)

1. Agarwal, S., Cramer, R., de Haan, R.: Asymptotically optimal two-round perfectly secure message transmission. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, Springer, Heidelberg (2006)
2. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc. 20th Annual ACM Symposium of the Theory of Computation, pp. 1-10 (May 1988)
3. Bennett, C.H., Brassard, G., Crèpeau, C., Maurer, U.: Generalized privacy amplification. IEEE Transactions on Information Theory 41(6), 1015-1923 (1995)
4. Bennett, C.H., Brassard, G., Robert, J.M.: Privacy amplification by public discussion. Siam Journal of Computing 17(2) (April 1988)
5. Berman, P., Garay, J.: Fast consensus in networks of bounded degree. WDAG 1990 2(7), 62-73 (1993); Preliminary version in WDAG 1990
6. Chaum, D., Crepeau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: Proceedings 20th Annual Symposium on Theory of Computing, STOC, Association for Computing Machinery (May 1988)
7. Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and simultaneous broadcast. In: Proc. 26th Annual IEEE Symposium on Foundations of Computer Science, pp. 383-395 (1985)
8. Desmedt, Y., Wang, Y.: Perfectly secure message transmission revisited. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 502-517. Springer, Heidelberg (2002)
9. Dolev, D.: The byzantine generals strike again. Journal of Algorithms 1(3), 14-30 (1982)
10. Dolev, D., Dwork, C., Waarts, O., Young, M.: Perfectly secure message transmission. Journal of ACM 1(40), 17-47 (1993)
11. Dwork, C., Peleg, D., Pippinger, N., Upfal, E.: Fault tolerance in networks of bounded degree. In: Proc. 18th Annual Symposium on the Theory of Computing, pp. 370-379 (1986)
12. Fitzi, M., Franklin, M., Garay, J., Vardhan, S.H.: Towards optimal and efficient perfectly secure message transmission. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, Springer, Heidelberg (2007)
13. Fitzi, M., Garay, J., Gollakota, S., Rangan, C.P., Srinathan, K.: Round-optimal and efficient verifiable secret sharing. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 329-342. Springer, Heidelberg (2006)
14. Fitzi, M., Hirt, M., Maurer, U.: Trading correctness for privacy in unconditional mpc. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, Springer, Heidelberg (1998)
15. Franklin, M.K., Wright, R.N.: Secure communications in minimal connectivity models. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 346-360. Springer, Heidelberg (1998)
16. Garay, J., Moses, Y.: Fully polynomial Byzantine agreement for n > 3t processors in t + 1 rounds. SIAM J. Comput. 27(1), 247-290 (1998); Preliminary version in STOC 1992
17. Garay, J., Ostrovsky, R., Vaya, S.: Almost-eveywhere secure computation. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, Springer, Heidelberg (2007)
18. Garay, J., Ostrovsky, R., Vaya, S.: Almost-eveywhere secure computation. In: Presentation at the 2007 Workshop on Cryptographic Protocols WCP 2007, Bertinoro, Italy (March 2007)
19. Garay, J., Perry, K.: A continuum of failure models for distributed computing. In: Segall, A., Zaks, S. (eds.) WDAG 1992. LNCS, vol. 647, pp. 153-165. Springer, Heidelberg (1992)
20. Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: On 2-round secure multiparty computation. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, Springer, Heidelberg (2002)
21. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for orotocols with honest majority. In: Proc. 19th Annual ACM Symposium on Theory of Computation, pp. 218-229 (May 1987)
22. Goldreich, O.: Secure multi-party computation, final (incomplete) draft, version 1.4 (2002)
23. Kilian, J., Kushilevitz, E., Micali, S., Ostrovsky, R.: Reducibility and completeness in private computations. SIAM Journal on Computing 29 (1999)
24. Kurosawa, K., Suzuki, K.: Truly efficient 2-round perfectly secure message transmission scheme. These proceedings
25. Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 382-401 (July 1982)
26. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM, JACM 27(2) (April 1980)
27. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proc. 21st ACM Symposium on the Theory of Computing, pp. 73-85 (1989)
28. Sayeed, H., Abu-Amara, H.: Efficient perfectly secure message transmission in synchronous networks. Information and Computation 1(126), 53-61 (1996)
29. Srinathan, K., Narayanan, A., Pandu Rangan, C.: Optimal perfectly secure message transmission. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 545-561. Springer, Heidelberg (2004)
30. Upfal, E.: Tolerating linear number of faults in networks of bounded degree. In: Proc. 11th ACM Symposiyum on Principles of Distributed Computing, pp. 83-89 (1992)
31. Vaya, S.: Almost-everywhere secure computation. Ph.D. Thesis, University of California at Los Angeles, California (December 2006)
32. Vaya, S.: Secure computation on incomplete networks. In: Cryptology ePrint archive, Report 2007/346 (September 2007)
33. Yao, A.: Protocols for secure computation. In: Proc. 23rd Annual IEEE Symposium on Foundations of Computer Science (1982)