Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
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
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
On perfectly secure communication over arbitrary networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Perfectly Secure Message Transmission Revisited
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Is hierarchical public-key certification the next target for hackers?
Communications of the ACM - Interactive immersion in 3D graphics
Truly efficient 2-round perfectly secure message transmission scheme
IEEE Transactions on Information Theory
On secure multi-party computation in black-box groups
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Truly efficient 2-round perfectly secure message transmission scheme
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Cryptanalysis of secure message transmission protocols with feedback
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Edge-colored graphs with applications to homogeneous faults
Information Processing Letters
Cryptography and Communications
Homogeneous faults, colored edge graphs, and cover free families
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Revisiting colored networks and privacy preserving censorship
CRITIS'06 Proceedings of the First international conference on Critical Information Infrastructures Security
Round-efficient perfectly secure message transmission scheme against general adversary
Designs, Codes and Cryptography
Secure communication in multicast graphs
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
| Hi-index | 0.06 |
Problems of unconditionally secure communication have been studied extensively in network models. Dolev-Dwork-Waarts-Yung considered the Byzantine threats model, in which the adversary can only take over a number of nodes bounded by a threshold. They studied two cases: all communication links (edges in the graph) are two-way communication, all communication links are one-way communication, and there is no feedback. The node sets that the adversary can take over was generalized by Hirt-Maurer to an adversary structure. At PODC 2002, Kumar-Goundan-Srinathan-Rangan generalized Dolev-Dwork-Waarts-Yung's first scenario to the case of a general adversary structure. In this paper we generalize Dolev-Dwork-Waarts-Yung's second scenario to the case of a general adversary structure. As in Dolev-Dwork-Waarts-Yung, our work relies on the use of secret sharing.