Universally composable simultaneous Broadcast

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

Volumn 4116 LNCS, Issue , 2006, Pages 18-33

  Hevia, Alejandro ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; INTERACTIVE COMPUTER SYSTEMS; NETWORK PROTOCOLS; PARALLEL PROCESSING SYSTEMS; SECURITY OF DATA;

COMPUTATIONALLY EFFICIENT; RANDOM STRING MODEL; SIMULTANEOUS BROADCAST PROTOCOLS; UNIVERSALLY COMPOSABLE (UC) SECURITY;

BROADCASTING;

EID: 33750001509     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11832072_2     Document Type: Conference Paper

References (36)

1. M. Abe and S. Fehr. Adaptively secure feldman VSS and applications to universally-composable threshold cryptography. In Advances in Cryptology CRYPTO, LNCS 3152, pages 317-334. Springer-Verlag, 2004.
2. B. Barak, Y. Lindell, and T. Rabin. Protocol initialization for the framework of universal composability. Cryptology ePrint Archive, Report 2004/006, 2004. http://eprint.iacr.org/.
3. M. Ben-Or, R. Canetti, and O. Goldreich. Asynchronous secure computation. In ACM STOC'93, pages 52-61. ACM Press, 1993.
4. M. Ben-Or and R. El-Yaniv. Resilient-optimal interactive consistency in constant time. Distributed Computing, 16(4):249-262, 2003.
5. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computations. In ACM STOC'88, pages 1-10. ACM Press, 1988.
6. M. Ben-Or, B. Kelmer, and T. Rabin. Asynchronous secure computations with optimal resilience (extended abstract). In ACM PODC'94, pages 183-192, 1994.
7. C. Cachin, K. Kursawe, F. Petzold, and V. Shoup. Secure and efficient asynchronous broadcast protocols. In Advances in Cryptology - CRYPTO, LNCS 2139, pages 524-541. Springer-Verlag, 2001.
8. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. Report 2000/067, Cryptology ePrint Archive, January 2005. Full version of that in IEEE Symposium on Foundations of Computer Science (FOGS'01).
9. R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively secure multi-party computation. In ACM STOC'96. ACM Press, 1996.
10. R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai. Universally composable twoparty and multi-party secure computation. In ACM STOC'02, 2002.
11. R. Canetti and T. Rabin. Fast asynchronous Byzantine agreement with optimal resilience (extended abstract). In ACM STOC'93, pages 42-51. ACM Press, 1993.
12. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. In IEEE Symposium on Foundations of Computer Science (FOCS'85), pages 383-395. IEEE CS, 1985.
13. B. Chor and M. O. Rabin. Achieving independence in logarithmic number of rounds. In ACM Symposium on Principles of Distributed Computing (PODC'87), pages 260-268. ACM Press, 1987.
14. 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, pages 311-326. Springer-Verlag, 1999.
15. I. Damgård and J. B. Nielsen. Universally composable efficient multiparty computation from threshold homomorphic encryption. In Advances in Cryptology -CRYPTO, LNCS 2729, pages 247-264. Springer-Verlag, 2003.
16. I. Damgård and J.B. Nielsen. Improved non-committing encryption schemes based on a general complexity assumption. In Advances in Cryptology - CRYPTO, LNCS 1880, pages 432-450. Springer-Verlag, 2000.
17. D. Dolev, C. Dwork, and M. Naor. Nonmalleable cryptography. SIAM Journal on Computing, 30(2):391-437, April 2001.
18. P. Feldman and S. Micali. An optimal probabilistic protocol for synchronous byzantine agreement. SIAM Journal on Computing, 26(4):873-933, 1997.
19. R. Gennaro. A protocol to achieve independence in constant rounds. IEEE Transactions on Parallel and Distributed Systems, 11(7):636-647, July 2000.
20. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, 38(3):691-729, July 1991.
21. A. Hevia. Universally composable simultaneous broadcast. Available from http://www.dcc.uchile.cl/~ahevia/pubs/, 2006. Full version of this paper.
22. A. Hevia and D. Micciancio. Simultaneous broadcast revisited. In ACM PODC'05, pages 324-333. ACM Press, 2005.
23. M. Hirt, J. B. Nielsen, and B. Przydatek. Cryptographic asynchronous multiparty computation with optimal resilience (extended abstract). In Advances in Cryptology - EUROCRYPT'05, LNCS 3494, pages 322-340. Springer-Verlag, 2005.
24. D. Hofheinz and J. Muller-quade. A synchronous model for multi-party computation and the incompleteness of oblivious transfer. Available from http://eprint.iacr.org/2004/016, 2004.
25. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, July 1982.
26. Y. Lindell, A. Lysyanskaya, and T. Rabin. On the composition of authenticated byzantine agreement. In ACM STOC'02, pages 514-523. ACM Press, 2002.
27. Y. Lindell, A. Lysyanskaya, and T. Rabin. Sequential composition of protocols without simultaneous termination. In ACM PODC'02, pages 203-212, 2002.
28. A. Lysyanskaya. Threshold cryptography secure against the adaptive adversary, concurrently. Report 2000/019, Cryptology ePrint Archive, 2000.
29. S. Micali and T. Rabin. Collective coin tossing without assumptions nor broadcasting. In Advances in Cryptology - CRYPTO, LNCS 537, pages 253-266, 1990.
30. J. B. Nielsen. On Protocol Security in the Cryptographic Model. Ph.D. thesis, Aarhus University, 2003.
31. M. Pease, R. Shostak, and L. Lamport. Reaching agreements in the presence of faults. Journal of the ACM, 27(2):228-234, April 1980.
32. B. Pfitzmann and M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In IEEE Symposium on Security and Privacy (S&P-01), pages 184-201. IEEE CS, 2001.
33. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In ACM STOC'89, pages 73-85. ACM Press, 1989.
34. A. De Santis and G. Persiano. Zero-knowledge proofs of knowledge without interaction (extended abstract). In IEEE Symposium on Foundations of Computer Science (FOCS'92), pages 427-436. IEEE CS, 1992.
35. A. Shamir. How to share a secret. Communications of the ACM, 22(11), 1979.
36. L. von Ahn, A. Bortz, and N.J. Hopper. k-Anonymous message transmission. In ACM Conference on Computer and Communication Security - CCS'03, pages 122-130. ACM Press, 2003.