Round-efficient secure computation in point-to-point networks

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

Volumn 4515 LNCS, Issue , 2007, Pages 311-328

  Katz, Jonathan ^a   Koo, Chiu Yuen ^a  

^a University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; NETWORK PROTOCOLS; NETWORK SECURITY;

BROADCAST CHANNELS; POINT TO POINT NETWORKS; SECURE COMPUTATION;

TELECOMMUNICATION NETWORKS;

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

References (30)

1. D. Beaver. Multiparty protocols tolerating half faulty processors. In Advances in Cryptology - Crypto '89, pages 560-572. Springer-Verlag, 1989.
2. D. Beaver. Secure multi-party protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 4(2):75-122, 1991.
3. D. Beaver. Efficient multiparty protocols using circuit randomization. In Advances in Cryptology -Crypto '91, pages 420-432. Springer-Verlag, 1992.
4. D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols. In 22nd Annual ACM Symposium on Theory of Computing, pages 503-513, 1990.
5. M. Ben-Or. Another advantage of free choice: Completely asynchronous agreement protocols. In 2nd Annual ACM Symposium on Principles of Distributed Computing (PODC), 1983.
6. M. Ben-Or and R. El-Yaniv. Resilient-optimal interactive consistency in constant time. Distributed Computing, 16(4):249-262, 2003.
7. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In Proc. 20th Annual ACM Symposium on Theory of Computing, pages 1-10. ACM Press, 1988.
8. D. Chaum, C Crepeau, and I. Damgård. Multiparty unconditionally secure protocols. In Proc. 20th Annual ACM Symposium on Theory of Computing, pages 11-19. ACM Press, 1988.
9. R. Cramer, I. Damgård, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations secure against an adaptive adversary. In Advances in Cryptology -Eurocrypt '99, volume 1592 of LNCS, pages 311-326. Springer-Verlag, 1999.
10. I. Damgård and Y. Ishai. Constant-round multiparty computation using a blackbox pseudorandom generator. In Adv. in Cryptology -Crypto 2005, pages 378-394. Springer-Verlag, 2005.
11. D. Dolev and H. Strong. Authenticated algorithms for Byzantine agreement. SIAM J. Computing, 12(4):656-666, 1983.
12. P. Feldman and S. Micali. An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM J. Comput., 26(4):873-933, 1997.
13. M. J. Fischer and N. A. Lynch. A lower bound for the time to assure interactive consistency. Info. Proc. Lett., 14(4):183-186, 1982.
14. M. Fitzi and J. A. Garay. Efficient player-optimal protocols for strong and differential consensus. In 22nd Annual ACM Symposium on Principles of Distributed Computing, pages 211-220, 2003.
15. M. Fitzi, J. A. Garay, S. Gollakota, C. P. Rangan, and K. Srinathan. Roundoptimal and efficient verifiable secret sharing. In 3rd Theory of Cryptography Conference, pages 329-342, 2006.
16. J. A. Garay and Y. Moses. Fully polynomial Byzantine agreement for n > 3t processors in t + 1 rounds. SIAM J. Comput, 27(1):247-290, 1998.
17. R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. The round complexity of verifiable secret sharing and secure multicast. In 33rd Annual ACM Symposium on Theory of Computing, pages 580-589, 2001.
18. R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. On 2-round secure multiparty computation. In Advances in Cryptology -Crypto 2002, pages 178-193. Springer-Verlag, 2002.
19. R. Gennaro, M. O. Rabin, and T. Rabin. Simplified VSS and fast-track multiparty computation with applications to threshold cryptography. In Proc. 17th Annual ACM Symposium on Principles of Distributed Computing, pages 101-111. ACM Press, 1998.
20. S. Goldwasser and Y. Lindell. Secure computation without agreement. In 16th Intl. Conf. on Distributed Computing (DISC), pages 17-32. Springer-Verlag, 2002.
21. M. Hirt, J. B. Nielsen, and B. Przydatek. Cryptographic asynchronous multiparty computation with optimal resilience. In Adv. in Cryptology -EUROCRYPT 2005, volume 3494 of Lecture Notes in Computer Science, pages 322-340. Springer-Verlag, 2005.
22. J. Katz and C.-Y. Koo. On expected constant-round protocols for Byzantine agreement. In Adv. in Cryptology -Crypto 2006. Full version available at http://eccc.hpi-web.de/eccc-reports/2006/TR06-028/index.html.
23. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Trans. Program. Lang. Syst., 4(3):382-401, 1982.
24. Y. Lindell, A. Lysyanskaya, and T. Rabin. Sequential composition of protocols without simultaneous termination. In Proc. 21st Annual ACM Symposium on Principles of Distributed Computing, pages 203-212, 2002.
25. S. Micali and T. Rabin. Collective coin tossing without assumptions nor broadcasting. In Adv. in Cryptology -Crypto '90, pages 253-266. Springer-Verlag, 1991.
26. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. J. ACM, 27(2):228-234, 1980.
27. B. Pfitzmann and M. Waidner. Information-theoretic pseudosignatures and Byzantine agreement for t ≥ n/3. Technical Report RZ 2882 (#90830), IBM Research, 1996.
28. M. Rabin. Randomized Byzantine generals. In Proc. 24th IEEE Symposium on Foundations of Computer Science, pages 403-409, 1983.
29. T. Rabin. Robust sharing of secrets when the dealer is honest or cheating. J. ACM, 41(6):1089-1109, 1994.
30. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proc. 21st Annual ACM Symposium on Theory of Computing, pages 73-85. ACM Press, 1989.