Proactive resilience revisited: The delicate balance between resisting intrusions and remaining available

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2006, Pages 71-80

  Sousa, Paulo ^a   Neves, Nuno Ferreira ^a   Veríssimo, Paulo ^a   Sanders, William H ^b  

^a UNIVERSITY OF LISBON   (Portugal)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARCHITECTURAL HYBRIDIZATION; ASYNCHRONOUS SYSTEMS; DISTRIBUTED INTRUSION-TOLERANT SYSTEMS; PROACTIVE RESILIENCE;

COMPUTER SIMULATION; COMPUTER SYSTEM RECOVERY; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANCE; MODEL CHECKING; SOFTWARE ARCHITECTURE;

INTRUSION DETECTION;

EID: 38949167734     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SRDS.2006.37     Document Type: Conference Paper

References (15)

1. G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. J. of the ACM, 32(4): 824-840, 1985.
2. C. Cachin, K. Kursawe, A. Lysyanskaya, and R. Strobl. Asynchronous verifiable secret sharing and proactive cryptosystems. In CCS '02: Proc. of the 9th ACM Conf. on Computer and Comm. Security, pages 88-97, 2002.
3. R. Canetti and T. Rabin. Fast asynchronous Byzantine agreement with optimal resilience. In Proc. of the 25th Annual ACM Symp. on Theory of Computing, pages 42-51, 1993.
4. M. Castro and B. Liskov. Practical Byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems, 20(4):398-461, 2002.
5. D. D. Deavours, G. Clark, T. Courtney, D. Daly, S. Derisavi, J. M. Doyle, W. H. Sanders, and P. G. Webster. The Möbius framework and its implementation. IEEE Transactions on Software Engineering, 28(10):956-969, 2002.
6. D. Malkhi and M. Reiter. Byzantine quorum systems. In STOC '97: Proc. of the 29th Annual ACM Symp. on Theory of Computing, pages 569-578, 1997.
7. M. Marsh and F. B. Schneider. CODEX: A robust and secure secret distribution system. IEEE Trans. Dependable Sec. Comput., 1(1):34-47, 2004.
8. N. F. Neves, M. Correia, and P. Veríssimo. Solving vector consensus with a wormhole. IEEE Transactions on Parallel and Distributed Systems, 16(12):1120-1131, 2005.
9. R. Ostrovsky and M. Yung. How to withstand mobile virus attacks (extended abstract). In Proc. of the 10th ACM Symp. on Principles of Distributed Computing, pages 51-59, 1991.
10. W. H. Sanders and J. F. Meyer. Stochastic activity networks: Formal definitions and concepts. In E. Brinksma, H. Hermanns, and J.-P. Katoen, editors, European Educational Forum: School on Formal Methods and Performance Analysis, volume 2090 of LNCS, pages 315-343. Springer, 2000.
11. P. Sousa, N. F. Neves, and P. Veríssimo. How resilient are distributed f fault/intrusion-tolerant systems? In Proc. of the Int. Conf. on Dependable Systems and Networks, pages 98-107, 2005.
12. P. Sousa, N. F. Neves, and P. Veríssimo. Proactive resilience through architectural hybridization. In Proc. of the 2006 ACM Symp. on Applied Computing, pages 686-690, 2006.
13. P. Veríssimo. Travelling through wormholes: A new look at distributed systems models. SIGACTNews, 37(1):66-81, 2006.
14. L. Zhou, F. Schneider, and R. van Renesse. COCA: A secure distributed on-line certification authority. ACM Transactions on Computer Systems, 20(4):329-368, 2002.
15. L. Zhou, F. B. Schneider, and R. V. Renesse. Apss: Proactive secret sharing in asynchronous systems. ACM Trans. Inf. Syst. Secur., 8(3):259-286, 2005.