M. Correia, L. C. Lung, N. F. Neves, and P. Ver ssimo. Efficient Byzantine-resilient reliable multicast on a hybrid failure model. In Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems, pages 2--11, October 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Low Complexity Byzantine-Resilient Consensus - Correia, Neves, Lung.. (2003) (1 citation) Self-citation (Correia Lung Neves Ssimo) (Correct)
No context found.
M. Correia, L. C. Lung, N. F. Neves, and P. Ver ssimo. Efficient Byzantine-resilient reliable multicast on a hybrid failure model. In Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems, pages 2--11, October 2002.
Low Complexity Byzantine-Resilient Consensus - Correia, Neves, Lung, Verissimo (2003) (1 citation) Self-citation (Correia Lung Neves Ssimo) (Correct)
No context found.
M. Correia, L. C. Lung, N. F. Neves, and P. Ver ssimo. Efficient Byzantine-resilient reliable multicast on a hybrid failure model. In Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems, pages 2--11, October 2002.
Wormhole-Aware Byzantine Protocols - Neves, Correia, Verissimo Self-citation (Correia Neves) (Correct)
No context found.
M. Correia, L. C. Lung, N. F. Neves, and P. Verssimo. Efficient Byzantine-resilient reliable multicast on a hybrid failure model. In Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems, pages 2--11, October 2002.
Low Complexity Byzantine-Resilient Consensus - Correia, Neves, Lung, Verissimo (2003) (1 citation) Self-citation (Correia Lung Neves Ssimo) (Correct)
No context found.
M. Correia, L. C. Lung, N. F. Neves, and P. Ver ssimo. Efficient Byzantine-resilient reliable multicast on a hybrid failure model. In Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems, pages 2--11, October 2002.
How to Tolerate Half Less One Byzantine Nodes in.. - Correia, Neves.. (2004) Self-citation (Correia Neves Ssimo) (Correct)
No context found.
M. Correia, L. C. Lung, N. F. Neves, and P. Ver ssimo. Efficient Byzantine-resilient reliable multicast on a hybrid failure model. In Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems, pages 2--11, October 2002.
How to Tolerate Half Less One Byzantine Nodes in.. - Correia, Neves.. (2004) Self-citation (Correia Neves Ssimo) (Correct)
No context found.
M. Correia, L. C. Lung, N. F. Neves, and P. Ver ssimo. Efficient Byzantine-resilient reliable multicast on a hybrid failure model. In Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems, pages 2--11, Oct. 2002.
Wormhole-Aware Byzantine Protocols - Neves, Correia, Verissimo Self-citation (Correia Neves) (Correct)
No context found.
M. Correia, L. C. Lung, N. F. Neves, and P. Verssimo. Efficient Byzantine-resilient reliable multicast on a hybrid failure model. In Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems, pages 2--11, October 2002.
Low Complexity Byzantine-Resilient Consensus - Correia, Neves, Lung, Verissimo (2003) (1 citation) Self-citation (Correia Lung Neves Ssimo) (Correct)
No context found.
M. Correia, L. C. Lung, N. F. Neves, and P. Ver ssimo. Efficient Byzantine-resilient reliable multicast on a hybrid failure model. In Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems, pages 2--11, October 2002.
Intrusion-Tolerant Architectures: Concepts and Design - Veríssimo, Neves.. Self-citation (Correia Neves) (Correct)
....can be found in [13] 8.2.2 A Wormhole Aware Protocol This section presents an IT protocol based on the TTCB wormhole 4. This protocol illustrates the approach based on hybrid failure assumptions: most of the system is 4The protocol is a simplified version of the protocol presented in [ 12]. 38 assumed to fail in an arbitrary way, while the wormhole is assumed to be secure, i.e, to fail only by crashing. The system is also assumed to be asynchronous, except for the TTCB which is synchronous. The protocol is a reliable multicast, a classical problem in distributed systems. Each ....
....Od 1 times. This hash code is used by the recipients to ensure the integrity and authenticity of the message. When they get a correct copy of the message they multicast it d 1 times. The pseudo code is pretty much straightforward so we do not describe it with detail and refer the reader to [12]. Figure 15 illustrates the behavior of the protocol. The horizontal lines represent the execution of processes through time. The thicker line represents the TTCB as a whole, even though, each process calls a separate local TTCB in its host (this representation is used for simplicity) The sender ....
[Article contains additional citation context not shown here]
Correia, M., Lung, L.C., Neves, N.F., Verissimo, P.: Efficient Byzantine-resilient reliable multicast on a hybrid failure model. In: Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems. (2002) 2-11
Byzantine Failures and Security: Arbitrary is not (always) Random - Gärtner (2003) (Correct)
No context found.
Correia, M., Lung, L. C., Neves, N. F., und Ver ssimo, P.: Efficient Byzantine-resilient reliable multicast on a hybrid failure model. In: Proc. 21st Symposium on Reliable Distributed Systems. Suita, Japan. Oct. 2002.
Byzantine Failures and Security: Arbitrary is not (always) Random - Gärtner, al. (2003) (Correct)
No context found.
Correia, M., Lung, L. C., Neves, N. F., und Ver ssimo, P.: Efficient Byzantine-resilient reliable multicast on a hybrid failure model. In: Proc. 21st Symposium on Reliable Distributed Systems. Suita, Japan. Oct. 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC