Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Introduction to algorithms
Journal of the ACM (JACM)
Perfectly secure message transmission
Journal of the ACM (JACM)
Secure hypergraphs: privacy from partial broadcast
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On perfectly secure communication over arbitrary networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
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
Perfectly Secure Message Transmission Revisited
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing)
Is hierarchical public-key certification the next target for hackers?
Communications of the ACM - Interactive immersion in 3D graphics
Secure Hypergraphs: Privacy from Partial Broadcast
SIAM Journal on Discrete Mathematics
Efficient reliable communication over partially authenticated networks
Distributed Computing - Special issue: PODC 02
Secure communication in broadcast channels: the answer to Franklin and Wright's question
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient zero-knowledge proofs for some practical graph problems
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Radio networks with reliable communication
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Exploring Multi-Path Communication in Hybrid Mobile Ad Hoc Networks
International Journal of Ambient Computing and Intelligence
Hi-index | 0.00 |
Reliable networks are obviously an important aspect of critical information infrastructures. Dolev-Dwork-Waarts-Yung linked research on reliable point-to-point networks with privacy and authenticity. In their threat model the adversary can only take over a number of nodes bounded by a threshold k. Hirt-Maurer introduced the concept of an adversary structure (i.e. the complement of an access structure). Kumar-Goundan-Srinathan-Rangan and Desmedt-Wang-Burmester generalized Dolev-Dwork-Waarts-Yung scenarios to the case of a general adversary structure. Burmester-Desmedt introduced a special adversary structure, now called a color based adversary structure. Their argument in favor of their model is that using automated attacks (such as worms), a vulnerability can be exploited on all computers in the network running the same platform (color). In their model the adversary can control all nodes that use up to k different platforms (or colors). We will demonstrate one of the limitations of their model. Although the family of color based adversary structures has a trivial representation which size grows polynomial in the size of the graph, we will demonstrate in this paper that deciding reliability issues and security issues are co-NP-complete. In most societies censorship is common. Indeed, for centuries it has often been viewed by authorities as an essential security tool. We apply the computational complexity result to study censorship. Authorities may require network designers to demonstrate the capability to censor the internet. We present a zero-knowledge interactive proof for the case of a color based adversary structure.