Abstract
In the perfectly secure message transmission (PSMT) problem, two synchronized non-faulty players (or processors), the Sender S and the Receiver R are connected by n wires (each of which facilitates 2-way communication); S has an ℓ-bit message that he wishes to send to R; after exchanging messages in phases R should correctly obtain S’s message, while an adversary listening on and actively controlling any set of t (or less) wires should have no information about S’s message.
We measure the quality of a protocol for securely transmitting an ℓ-bit message using the following parameters: the number of wires n, the number of phases r and the total number of bits transmitted b. The optima for n and r are respectively 2t+1 and 2. We prove that any 2-phase reliable message transmission protocol, and hence any secure protocol, over n wires out of which at most t are faulty is required to transmit at least \(b = \left(\frac{n\ell}{n-2t}\right)\) bits. While no known protocol is simultaneously optimal in both communication and phase complexity, we present one such optimum protocol for the case n=2t+1 when the size of message is large enough, viz., ℓ = Ω(tlog t) bits; that is, our optimal protocol has n=2t+1, r=2 and b=O(nℓ) bits. Note that privacy is for free, if the message is large enough.
We also demonstrate how randomness can effectively improve the phase complexity. Specifically, while the (worst-case) lower bound on r is 2, we design an efficient optimally tolerant protocol for PSMT that terminates in a single phase with arbitrarily high probability.
Finally, we consider the case when the adversary is mobile, that is, he could corrupt a different set of t wires in different phases. Again, the optima for n and r are respectively 2t+1 and 2; However we show that \(b \geq \left(\frac{n\ell}{n-2t}\right)\) bits irrespective of r. We present the first protocol that is (asymptotically) optimum in b for n=2t+1. Our protocol has a phase complexity of O(t).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computation. In: 20th ACM STOC, pp. 1–10 (1988)
Desmedt, Y., Wang, Y.: Perfectly secure message transmission revisited. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 502–517. Springer, Heidelberg (2002)
Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. JACM 40(1), 17–47 (1993)
Edmonds, J.: Paths, trees and flowers. Canadian Jl. of Math. 17, 449–467 (1965)
Franklin, M., Wright, R.N.: Secure communication in minimal connectivity models. Journal of Cryptology 13(1), 9–30 (2000)
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: 19th ACM STOC, pp. 218–229 (1987)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North Holland Publishing Company, Amsterdam (1978)
Menger, K.: Zur allgemeinen kurventheorie. Fundamenta Mathematicae 10, 96–115 (1927)
Micali, S., Vazirani, V.: An O(\(\sqrt{|V|}\) |E|) algorithm for maximum matching in general graphs. In: 21st IEEE FOCS, pp. 17–27 (1980)
Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks. In: 10th ACM PODC, pp. 51–61 (1991)
Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. JACM 36, 335–348 (1989)
Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: 21st ACM STOC, May 1989, pp. 73–85 (1989)
Sayeed, H., Abu-Amara, H.: Efficient perfectly secure message transmission in synchronous networks. Information and Computation 126(1), 53–61 (1996)
Srinathan, K., Vinod, V., Pandu Rangan, C.: Brief announcement: Efficient perfectly secure communication over synchronous networks. In: 22nd ACM PODC, p. 252 (2003)
Yao, A.C.: Protocols for secure computations. In: 23rd IEEE FOCS, pp. 160–164 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Srinathan, K., Narayanan, A., Rangan, C.P. (2004). Optimal Perfectly Secure Message Transmission. In: Franklin, M. (eds) Advances in Cryptology – CRYPTO 2004. CRYPTO 2004. Lecture Notes in Computer Science, vol 3152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28628-8_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-28628-8_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22668-0
Online ISBN: 978-3-540-28628-8
eBook Packages: Springer Book Archive