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
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Perfectly secure message transmission
Journal of the ACM (JACM)
Robust sharing of secrets when the dealer is honest or cheating
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
Fault-tolerant Computation in the Full Information Model
SIAM Journal on Computing
Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing)
Communications in unknown networks: Preserving the secret of topology
Theoretical Computer Science
Revisiting colored networks and privacy preserving censorship
CRITIS'06 Proceedings of the First international conference on Critical Information Infrastructures Security
Communications in unknown networks: preserving the secret of topology
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Secure communication in multicast graphs
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
| Hi-index | 0.00 |
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have initiated the study of secure communication and secure computation in multirecipient (broadcast) models. A "broadcast channel" (such as ethernet) enables one processor to send the same message--simultaneously and privately-- to a fixed subset of processors. In their Eurocrypt '98 paper, Franklin and Wright have shown that if there are n broadcast lines between a sender and a receiver and there are at most t malicious (Byzantine style) processors, then the condition n t is necessary and sufficient for achieving efficient probabilisticly reliable and probabilisticly private communication. They also showed that if n ⌈3t/2⌉ then there is an efficient protocol to achieve probabilisticly reliable and perfectly private communication. And they left open the question whether there exists an efficient protocol to achieve probabilisticly reliable and perfectly private communication when ⌈3t/2⌉ ≥ n t. In this paper, by using a different authentication scheme, we will answer this question affirmatively and study related problems.