Adaptively secure broadcast

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

Volumn 6110 LNCS, Issue , 2010, Pages 466-485

  Hirt, Martin ^a   Zikas, Vassilis ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCAST PROTOCOLS; COMPOSABILITY; IDEAL BEHAVIOR; MULTI-PARTY COMPUTATION PROTOCOLS; MULTI-PARTY PROTOCOLS; POINT-TO-POINT NETWORK; SECURE CHANNELS; SECURE COMPOSITION; SIMULATION-BASED;

BROADCASTING; CHANNEL CAPACITY; CRYPTOGRAPHY; NETWORK PROTOCOLS;

NETWORK SECURITY;

EID: 77954642421     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13190-5_24     Document Type: Conference Paper

References (37)

1. Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: STOC 1993, pp. 52-61 (1993)
2. Bar-Noy, A., Dolev, D., Dwork, C., Strong, H.R.: Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement. Information and Computation 97(2), 205-233 (1992)
3. Berman, P.J., Garray, J., Perry, J.: Towards optimal distributed consensus. In: FOCS 1989, pp. 410-415 (1989);
4. Full version in Computer Science Research (1992)
5. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computation. In: STOC 1988, pp. 1-10 (1988)
6. Beerliova-Trubiniova, Z., Hirt, M., Riser, M.: Efficient Byzantine agreement with faulty minority. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 393-409. Springer, Heidelberg (2007)
7. Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience (extended abstract). In: PODC 1994, pp. 183-192. ACM, New York (1994)
8. Baum-Waidner, B., Pfitzmann, B., Waidner, M.: Unconditional Byzantine agreement with good majority. In: Jantzen, M., Choffrut, C. (eds.) STACS 1991. LNCS, vol. 480, pp. 285-295. Springer, Heidelberg (1991)
9. Bracha, G.: An asynchronou [(n-1)/3]-resilient consensus protocol. In: PODC 1984, pp. 154-162 (1984)
10. Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 143-202 (2000)
11. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS 2001, pp. 136-145 (2001)
12. Canetti, R.: Universally composable signatures, certification and authentication. Cryptology ePrint Archive, Report 2003/239 (2003), http://eprint.iacr.org/
13. Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC 1988, pp. 11-19 (1988)
14. Cramer, R., Damgård, I., Dziembowski, S., Hirt,M., Rabin, T.: Efficient multiparty computations secure against an adaptive adversary. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 311-326. Springer, Heidelberg (1999)
15. Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: FOCS 1985, pp. 383-395 (1985) (Pubitemid 16541437)
16. Chor, B., Rabin, M.O.: Achieving independence in logarithmic number of rounds. In: PODC 1987, pp. 260-268 (1987)
17. Coan, B.A., Welch, J.L.: Modular construction of nearly optimal Byzantine agreement protocols. In: PODC 1989, pp. 295-305 (1989);
18. Full version in Information and Computation (1992)
19. Dolev, D., Fischer, M.J., Fowler, R., Lynch, N.A., Strong, H.R.: An efficient algorithm for Byzantine agreement without authentication. Information and Control 52(3), 257-274 (1982)
20. Dolev, D., Strong, H.R.: Polynomial algorithms for multiple processor agreement. In: STOC 1982, pp. 401-407 (1982);
21. Full version in SIAM Journal on Computing 12(4), 656-666 (1983)
22. Fitzi, M.: Generalized Communication and Security Models in Byzantine Agreement. PhD thesis, ETH Zurich (2003)
23. Fischer, M.J., Lynch, N.A., Merritt, M.: Easy impossibility proofs for distributed consensus problems. Distributed Computing 1, 26-39 (1986)
24. Feldman, P., Micali, S.: Optimal algorithms for Byzantine agreement. In: STOC 1988, pp. 148-161 (1988)
25. Gennaro, R.: Achieving independence efficiently and securely. In: PODC 1995, pp. 130-136 (1995)
26. Gennaro, R.: A protocol to achieve independence in constant rounds. IEEE Trans. Parallel Distrib. Syst. 11(7), 636-647 (2000)
27. Goldwasser, S., Lindell, Y.: Secure computation without agreement. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 17-32. Springer, Heidelberg (2002)
28. Garay, J.A., Moses, Y.: Fully polynomial Byzantine agreement in t+1 rounds. In: STOC 1993, pp. 31-41 (1993)
29. Hevia, A.: Universally composable simultaneous broadcast. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol. 4116, pp. 18-33. Springer, Heidelberg (2006)
30. Hevia, A., Micciancio, D.: Simultaneous broadcast revisited. In: PODC 2005, pp. 324-333 (2005)
31. Karlin, A., Yao, A.C.: Manuscript (1984)
32. Lindell, Y., Lysyanskaya, A., Rabin, T.: On the composition of authenticated Byzantine agreement. In: STOC 2002, pp. 514-523 (2002)
33. Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Transactions on Programming Languages and Systems 4(3), 382-401 (1982)
34. Nielsen, J.B.:On Protocol Security in the CryptographicModel. PhD thesis, BRICS (2003)
35. Pfitzmann, B.,Waidner, M.: Unconditional Byzantine agreement for any number of faulty processors. In: STACS 1992. LNCS, vol. 577, pp. 339-350 (1992)
36. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: STOC 1989, pp. 73-85 (1989)
37. Toueg, S., Perry, K.J., Srikanth, T.K.: Fast distributed agreement. SIAM J. Comput. 16(3), 445-457 (1987)