Secure Communication in Broadcast Channels: The Answer to Franklin and Wright's Question

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 multi-recipient (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 efficie...

• Type: Conference
• Year: 1999
• Where: EUROCRYPT
• Authors: Yongge Wang, Yvo Desmedt
• Keywords: Cryptology, EUROCRYPT 1999, Network Models, Private Communication, Secure Communication