Open Access
MATEC Web of Conferences
Volume 42, 2016
2015 The 3rd International Conference on Control, Mechatronics and Automation (ICCMA 2015)
Article Number 07002
Number of page(s) 4
Section Networks and Communication Engineering
Published online 17 February 2016
  1. L. Lamport, R. Shostak, and M. Pease, “The byzantine generals problem,” ACM Trans. Program. Lang. Syst., vol. 4, no. 3, pp. 382–401, 1982. [CrossRef]
  2. D. Dolev, “The byzantine generals strike again,” Stanford University, 1982.
  3. M. Castro and B. Liskov, Practical byzantine fault tolerance and proactive recovery,” ACM Trans. Comput. Syst., vol. 20, no. 4, pp. 398–461, 2002. [CrossRef]
  4. T. Ho, B. Leong, R. Koetter, M. Medard, M. Effros, and D. Karger, “Byzantine modification detection in multicast networks with random network coding,” Information Theory, IEEE Transactions on, vol. 54, no. 6, pp. 2798–2803, June.2008. [CrossRef]
  5. K. P. Kihlstrom, L. E. Moser, and P. M. Melliarsmith, “The secure ring protocols for securing group communication,” in Proceedings of Hawaii International Conference on System Sciences, 1998, pp. 317–326.
  6. T. Ho, B. Leong, R. Koetter, M. Madard, M. Effros, and D. Karger, “Byzantine modification detection in multicast networks using randomized network coding,” in Proceedings of the 2004 IEEE International Symposium on Information Theory (ISIT), June. 2004.
  7. F. Greve, P. Sens, L. Arantes, and V. Simon, “A failure detector for wireless networks with unknown membership,” in Euro-Par 2011 Parallel Processing. Springer, 2011, pp. 27–38. [CrossRef]
  8. B. Awerbuch, D. Holmer, C. Nita-Rotaru, and H. Rubens, “An on-demand secure routing protocol resilient to byzantine failures,” in Proceedings of the 1st ACM workshop on Wireless security. ACM, 2002, pp. 21–30.
  9. Y. Desmedt, “Unconditionally private and reliable communication in an untrusted network,” in Theory and Practice in Information-Theoretic Security, 2005. IEEE Information Theory Workshop on, Oct 2005, pp. 38–41.
  10. N. Cai and R. Yeung, “Secure network coding,” in Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on, 2002, pp. 323.
  11. Y. Wei, Z. Yu, and Y. Guan, “Efficient weakly secure network coding schemes against wiretapping attacks,” in Network Coding (NetCod), 2010 IEEE International Symposium on, June 2010, pp. 1–6.
  12. Z. Zhang, “Linear network error correction codes in packet networks,” Information Theory, IEEE Transactions on, vol. 54, no. 1, pp. 209–218, Jan. 2008. [CrossRef]
  13. S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, and M. Mdard, “Resilient network coding in the presence of byzantine adversaries,” in Proceedings 26th Annual IEEE Conference on Computer Commun., INFOCOM, 2007, pp. 616–624.
  14. T. D. Chandra and S. Toueg, “Unreliable failure detectors for reliable distributed systems,” J.ACM, vol. 43, no. 2, pp. 225–267, 1996. [CrossRef]
  15. D. Malkhi and M. Reiter, “Unreliable intrusion detection in distributed computations,” in CSFW’97: Proceedings of the 10th IEEE workshop on Computer Security Foundations. Washington, DC, USA: IEEE Computer Society, 1997, p. 116.
  16. A. Doudou, B. Garbinato, R. Guerraoui, and A. Schiper, “Muteness failure detectors: Specification and implementation,” in EDCC-3: Proceedings of the Third European Dependable Computing Conference on Dependable Computing. London, UK: Springer-Verlag, 1999, pp. 71–87. [CrossRef]
  17. K. P. Kihlstrom, L. E. Moser, and P. M. MelliarSmith, “Byzantine fault detectors for solving consensus,” The Computer Journal, vol. 46, p. 2003, 2003. [CrossRef]
  18. F. B. Schneider, “Implementing fault-tolerant services using the state machine approach: A tutorial,” ACM Computing Surveys, vol. 22, pp. 299–319, 1990. [CrossRef]
  19. S. Aiyer, L. Alvisi, A. Clement, M. Dahlin, J.-P. Martin, and C. Porth, Bar fault tolerance for cooperative services,” in 20th Symposium on Operating Systems Principles (SOSP). ACM, 2005, pp. 45–58.
  20. L. Alvisi, D. Malkhi, E. Pierce, and M. Reiter, “Fault detection for byzantine quorum systems,” Parallel and Distributed Systems, IEEE Transactions on, vol. 12, no. 9, pp. 996–1007, sep. 2001. [CrossRef]
  21. D. Denning, “An intrusion-detection model,” Software Engineering, IEEE Transactions on, vol. SE-13, no. 2, pp. 222–232, Feb. 1987. [CrossRef]
  22. S. D. Kamvar, M. T. Schlosser, and H. Garciamolina, “The eigentrust algorithm for reputation management in p2p networks,” in Proceedings of the 12th International World Wide Web Conference (WWW, 2003), 2003.
  23. M. Merideth, A. Iyengar, T. Mikalsen, S. Tai, I. Rouvellou, and P. Narasimhan, “Thema: Byzantine-fault-tolerant middleware for webservice applications,” in Reliable Distributed Systems, 2005. SRDS 2005. 24th IEEE Symposium on, Oct 2005, pp. 131–140.
  24. M. Correia, G. S. Veronese, and L. C. Lung, “Asynchronous byzantine consensus with 2f+1 processes,” in SAC ’10: Proceedings of the 2010 ACM Symposium on Applied Computing. New York, NY, USA: ACM, 2010, pp. 475–480.
  25. G. Liang and N. H. Vaidya, “Byzantine broadcast in point-to-point networks using local linear coding,” in Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, ser. PODC ’12. New York, NY, USA: ACM, 2012, pp. 319–328. [Online]. Available:
  26. A. Haeberlen, P. Kouznetsov, and P. Druschel, “The case for byzantine fault detection,” in Proceedings of the 2nd Conference on Hot Topics in System Dependability - Volume 2, ser. HOTDEP’06. Berkeley, CA, USA: USENIX Association, 2006, pp. 5{5. [Online]. Available:

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.