Adaptively secure broadcast, revisited

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2011, Pages 179-186

  Garay, Juan A ^a   Katz, Jonathan ^b   Kumaresan, Ranjit ^b   Zhou, Hong Sheng ^b  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

adaptive security; broadcast; cryptographic protocols; fault tolerant distributed computing

Indexed keywords

ADAPTIVE ADVERSARY; ADAPTIVE SECURITY; ARBITRARY NUMBER; BROADCAST; CLASSICAL PROBLEMS; COMMUNICATION MODELS; CRYPTOGRAPHIC PROTOCOLS; FAULT-TOLERANT DISTRIBUTED COMPUTING; IMPOSSIBILITY RESULTS; PUBLIC KEY INFRASTRUCTURE; SECURE MULTI-PARTY COMPUTATION; SIMULATION-BASED; SYNCHRONOUS MODELS;

INFORMATION THEORY; NETWORK SECURITY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 79959901514     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993806.1993832     Document Type: Conference Paper

References (16)

1. B. Barak, R. Canetti, J. B. Nielsen, and R. Pass. Universally composable protocols with relaxed set-up assumptions. In 45th Annual Symposium on Foundations of Computer Science (FOCS), pages 186-195. IEEE, 2004.
2. R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143-202, 2000.
3. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In 42nd Annual Symposium on Foundations of Computer Science (FOCS), pages 136-145. IEEE, 2001. Full version at http://eprint.iacr. org/2000/067/.
4. R. Canetti. Universally composable signature, certification, and authentication. In 17th IEEE Computer Security Foundations Workshop, pages 219-235. IEEE Computer Society, 2004. Full version at http://eprint.iacr.org/ 2003/239/.
5. R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively secure multi-party computation. In 28th Annual ACM Symposium on Theory of Computing (STOC), pages 639-648. ACM Press, May 1996.
6. R. Canetti and M. Fischlin. Universally composable commitments. In Advances in Cryptology - Crypto 2001, volume 2139 of LNCS, pages 19-40. Springer, 2001.
7. R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai. Universally composable two-party and multi-party secure computation. In 34th Annual ACM Symposium on Theory of Computing (STOC), pages 494-503. ACM Press, May 2002.
8. R. Cleve. Limits on the security of coin flips when half the processors are faulty. In 18th Annual ACM Symposium on Theory of Computing (STOC), pages 364-369. ACM Press, 1986.
9. D. Dolev and H. Strong. Authenticated algorithms for Byzantine agreement. SIAM Journal on Computing, 12(4):656-666, 1983.
10. S. Goldwasser and Y. Lindell. Secure multi-party computation without agreement. Journal of Cryptology, 18(3):247-287, 2005. (Pubitemid 40997661)
11. M. Hirt and V. Zikas. Adaptively secure broadcast. In Advances in Cryptology - Eurocrypt 2010, volume 6110 of LNCS, pages 466-485. Springer, 2010.
12. L. Lamport, R. E. Shostak, and M. C. Pease. The Byzantine generals problem. ACM Trans. Programming Language Systems, 4(3):382-401, 1982.
13. M. Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):151-158, 1991.
14. M. Pease, R. E. Shostak, and L. Lamport. Reaching agreement in the presence of faults. J. ACM, 27(2):228-234, 1980.
15. T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology - Crypto '91, volume 576 of LNCS, pages 129-140. Springer, 1992.
16. B. Pfitzmann and M. Waidner. Unconditional Byzantine agreement for any number of faulty processors. In 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 577 of LNCS, pages 339-350. Springer, 1992.