Towards Fault-Tolerant and Secure Agentry
暂无分享,去创建一个
[1] Bowen Alpern,et al. Defining Liveness , 1984, Inf. Process. Lett..
[2] Adi Shamir,et al. How to share a secret , 1979, CACM.
[3] D. E. Bell,et al. Secure Computer Systems : Mathematical Foundations , 2022 .
[4] Fred B. Schneider,et al. Implementing fault-tolerant services using the state machine approach: a tutorial , 1990, CSUR.
[5] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[6] L.,et al. SECURE COMPUTER SYSTEMS : MATHEMATICAL FOUNDATIONS , 2022 .
[7] Leslie Lamport,et al. Distributed Systems: Methods and Tools for Specification, An Advanced Course, April 3-12, 1984 and April 16-25, 1985, Munich, Germany , 1985, Advanced Course: Distributed Systems.
[8] Stanisław Jarecki,et al. Proactive secret sharing and public key cryptosystems , 1995 .
[9] Robbert van Renesse,et al. Cryptographic support for fault-tolerant distributed computing , 1996, EW 7.
[10] Robert S. Swarz,et al. The theory and practice of reliable system design , 1982 .
[11] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.
[12] John McLean,et al. A general theory of composition for trace sets closed under selective interleaving functions , 1994, Proceedings of 1994 IEEE Computer Society Symposium on Research in Security and Privacy.
[13] Robert Wahbe,et al. Efficient software-based fault isolation , 1994, SOSP '93.
[14] T. Anderson,et al. Eecient Software-based Fault Isolation , 1993 .
[15] B SchneiderFred. Implementing fault-tolerant services using the state machine approach: a tutorial , 1990 .