×

Adaptively secure broadcast, revisited. (English) Zbl 1321.94060

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on principles of distributed computing, PODC ’11, San Jose, CA, USA, June 06–08, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0719-2). 179-186 (2011).

MSC:

94A60 Cryptography
68M12 Network protocols
68M14 Distributed systems
68M15 Reliability, testing and fault tolerance of networks and computer systems

Citations:

Zbl 1280.94067
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] C. Avin, M. Koucky, and Z. Lotker. How to explore a fast-changing world (cover time of a simple random walk on evloving graphs). In Proc. 35th Coll. on Automata, Lang. and Programming (ICALP), pages 121 132, 2008. · Zbl 1152.68476
[2] A. Bar-Noy and D. Dolev. Consensus algorithms with one-bit messages. Distributed Computing, 4:105 110, 1991. · Zbl 0723.68012
[3] H. Baumann, P. Crescenzi, and P. Fraigniaud. Parsimonious .ooding in dynamic graphs. In Proc. 28th Symp. on Principles of Distributed Computing (PODC), pages 260 269, 2009. · Zbl 1291.68292
[4] A. Casteigts, P. Flocchini, W. Quattrociocchi, and N. Santoro. Time-varying graphs and dynamic networks. CoRR, abs/1012.0009, 2010.
[5] A. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri. Flooding time in edge-markovian dynamic graphs. In Proc. 27th Symp. on Principles of Distributed Computing (PODC), pages 213 222, 2008. · Zbl 1301.05308
[6] A. E. F. Clementi, A. Monti, F. Pasquale, and R. Silvestri. Broadcasting in dynamic radio networks. J. Comput. Syst. Sci., 75(4):213 230, 2009. · Zbl 1159.90327
[7] D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. J. ACM, 40(1):17 47, 1993. · Zbl 0774.68017
[8] C. Dwork and Y. Moses. Knowledge and common knowledge in a Byzantine environment: crash failures. Information and Computation, 88(2):156 186, 1990. · Zbl 0705.68019
[9] C.Dwork, D. Peleg,N.N Pippenger, and E.Upfal.Fault tolerance in networks of bounded degree. In Proc. 8th Symp. on Theory of Computing (STOC), pages 370 379, 1986. · Zbl 0669.68007
[10] R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, MA, 2003. · Zbl 0839.68095
[11] A. Fernández Anta, A. Milani, M. A. Mosteiro, and S. Zaks. Opportunistic information dissemination in mobile ad-hoc networks. In Proc. 24th Conference on Distributed Computing (DISC), pages 374 388, 2010. · Zbl 1290.68014
[12] A. Ferreira. Building a reference combinatorial model for MANETs. IEEE Network Magazine, 18(5):24 29, 2004.
[13] A. Ferreira, A. Goldman, and J. Monteiro. Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs. Wireless Networks, 16(3):627 640, 2010.
[14] J. A. Garay and R. Ostrovsky. Almost-everywhere secure computation. In Proc. 27th EUROCRYPT, pages 307 323, 2008. · Zbl 1149.68377
[15] J. Y. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environment. J. ACM, 37(3):549 587, 1990. · Zbl 0699.68115
[16] F. Kuhn, C. Lenzen, T. Locher, and R. Oshman. Optimal gradient clock synchronization in dynamic networks. In Proc. 29th Symp. on Principles of Distributed Computing (PODC), pages 430 439, 2010. · Zbl 1315.68009
[17] F. Kuhn, T. Locher, and R. Oshman. Gradient clock synchronization in dynamic networks. In Proc. 21st Symp. Paralellism in Algorithms and Architectures (SPAA), pages 270 279, 2009. · Zbl 1253.68060
[18] F. Kuhn, N. Lynch, and R. Oshman. Distributed computation in dynamic networks. In Proc. 42nd Symp. on Theory of Computing (STOC), pages 513 522, 2010. · Zbl 1293.68305
[19] F. Kuhn and R. Oshman. Dynamic networks: models and algorithms. SIGACT News, 42:82 96, March 2011.
[20] T. Mizrahi and Y. Moses. Continuous consensus via common knowledge. Distributed Computing, 20(5):305 321, 2008. · Zbl 1266.68040
[21] Y. Moses and M. R. Tuttle. Programming simultaneous actions using common knowledge. Algorithmica, 3:121 169, 1988. · Zbl 0646.68031
[22] R. O Dell and R. Wattenhofer. Information dissemination in highly dynamic graphs. In Proc. 9th Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pages 104 110, 2005.
[23] M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. J. ACM, 27(2):228 234, 1980. · Zbl 0434.68031
[24] N. Santoro and P. Widmayer. Time is not a healer. In Proc. 6th Symp. on Theoretical Aspects of Computer Science (STACS), pages 304 313. Springer-Verlag, 1989.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.