Principles of artificial intelligence
Principles of artificial intelligence
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Perfectly secure message transmission
Journal of the ACM (JACM)
Cryptographic defense against traffic analysis
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient checking of polynomials and proofs and the hardness of approximation problems
Efficient checking of polynomials and proofs and the hardness of approximation problems
Probabilistic checking of proofs and hardness of approximation problems
Probabilistic checking of proofs and hardness of approximation problems
Randomness vs. fault-tolerance
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
P-Complete Approximation Problems
Journal of the ACM (JACM)
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
SIGACT News Complexity Theory Column 12
ACM SIGACT News
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Reliable Communication over Partially Authenticated Networks
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Efficient Anonymous Multicast and Reception (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing)
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Probabilistic checking of proofs; a new characterization of NP
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Maximum Flows and Critical Vertices in AND/OR Graphs
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
Fundamenta Informaticae
Hi-index | 0.00 |
Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended to computations solely based on functions in one input in which redundant hardware or software (servers) are used to compute intermediate and end results. However, almost all practical computation systems consist of components which are based on computations with multiple inputs. Wang, Desmedt, and Burmester have used AND/OR graphs to model this scenario. Roughly speaking, an AND/OR graph is a directed graph with two types of vertices, labeled ∧-vertices and ∨-vertices. In this case, processors which need all their inputs in order to operate could be represented by ∧-vertices, whereas processors which can choose one of their "redundant" inputs could be represented by ∨-vertices. In this paper, using the results for hardness of approximation and optimization problems, we will design dependable computation systems which could defeat as many malicious faults as possible. Specifically, assuming certain approximation hardness result, we will construct k-connected AND/OR graphs which could defeat a ck-active adversary (therefore a ck-passive adversary also) where c 1 is any given constant. This result improves a great deal on the results for the equivalent communication problems.