Models for dependable computation with multiple inputs and some hardness results

Fundamenta Informaticae

Volumn 42, Issue 1, 2000, Pages 61-73

  Wang, Yongge ^c   Desmedt, Yvo ^a   Burmester, Mike ^b  

^a Florida State University   (United States)

^b UNIVERSITY OF LONDON   (United Kingdom)

^c NONE

Author keywords

Complexity theory; Dependable computation; NP hardness

Indexed keywords

EID: 0039768535     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-2000-42103     Document Type: Article

References (20)

1. Beimel A. and Franklin, M.: Reliable communication over partially authenticated networks. In: Proceedings of the WDAG '97, Lecture Notes in Computer Science 1320, Springer Verlag, 1997, 245-259.
2. Burmester M. and Desmedt, Y. and Wang, Y.: Using approximation hardness to achieve dependable computation. In: Proceedings of Second International Conference on Randomization and Approximation Techniques in Computer Science, Lecture Notes in Computer Science 1518, Springer Verlag, 1998, 172-186.
3. Dolev, D.: The Byzantine generals strike again. J. of Algorithms, 3, 1982, 14-30.
4. Dolev, D. and Dwork, C. and Waarts, O. and Yung, M.: Perfectly secure message transmission. J. of the ACM, 40(1), 1993, 17-47.
5. Ford, L. and Fulkerson, D: Flows in Networks. Princeton, NJ: Princeton University Press, 1962.
6. Fortune, S. and Hopcroft, J. and Wyllie, J.: The directed subgraph homeomorphism problem. Theoret. Comput. Sci., 10, 1980, 111-121.
7. Garey, M. and Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W. H. Freeman and Company, 1979.
8. Hadzilacos, V.: Issues of Fault Tolerance in Concurrent Computations. PhD thesis, Harvard University, Cambridge, MA, 1984.
9. Information Systems Trustworthiness - Interim Report. Computer Science and Telecommunications Board Commission on Physical Sciences, Mathematics, and Applications National Research Council. April 1997.
10. Korte, B. and Lovasz, L. and Prömel, H. and Schrijver A. (Eds.): Paths, Flows, and VLSI Layout. Springer-Verlag, 1990.
11. Lamport, L. and Shostak, R. and Pease M.: The Byzantine generals problem. J. of the ACM, 32(2), 1982, 374-382.
12. Neumann, P.: Are dependable systems feasible? Commun. of the ACM, 36(2), 1993, 146.
13. Nicola, V. and Nakayama, M. and Heidelberger, P. and Goyal, A.: Fast simulation of highly dependable systems with general failure and repair processes. IEEE Transactions on Computers, 42(12), 1993, 1440-1452.
14. Nilsson, N.: Principles of Artificial Intelligence. Tioga, 1980.
15. Perl, Y. and Shiloach, Y.: Finding two disjoint paths between two pairs of vertices in a graph. J. of the ACM, 25(1), 1978, 1-9.
16. Riecken, D.: Intelligent agents. Commun. of the ACM, 37(7), 1994, 19-21.
17. Reiter, M. and Stubblebine, S.: Path independence for authentication in large-scale systems. In: Proceedings of the 4th ACM Conference on Computer and Communication Security, ACM Press, 1997.
18. Robertson, N. and Seymour, P: Graph minors XIII: The disjoint paths problem. J. Comb. Theory, Ser. B, 63(1), 1995, 65-110.
19. Schneider, F.: Towards fault-tolerant and secure agentry. In: Proceedings of the WDAG '97, Lecture Notes in Computer Science 1320, Springer Verlag, 1997, 1-14.
20. Wagner, D. and Weihe, K.: A linear time algorithm for multicommodity flow in planar graphs. Proc. First European Symposium on Algorithms, 1993, 384-395.