Efficient perfectly secure message transmission in synchronous networks
Information and Computation
Perfectly Secure Message Transmission Revisited
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Robust key establishment in sensor networks
ACM SIGMOD Record
On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication
SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
Almost Secure 1-Round Message Transmission Scheme with Polynomial-Time Message Decryption
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Towards optimal and efficient perfectly secure message transmission
TCC'07 Proceedings of the 4th conference on Theory of cryptography
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
Asymptotically optimal two-round perfectly secure message transmission
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
A general construction for 1-round δ-RMT and (0, δ)-SMT
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
In Secure message transmission (SMT) protocols two nodes in a network want to communicate securely, given that some of the nodes in the network are corrupted by an adversary with unlimited computational power. An SMT protocol uses multiple paths between the sender and a receiver to guarantee privacy and reliability of the message transmission. An (ε, δ)-SMT protocol bounds the adversary's success probability of breaking privacy and reliability to ε and δ, respectively. Rate optimal SMT protocols have the smallest transmission rate (amount of communication per one bit of message). Rate optimal protocols have been constructed for a restricted set of parameters. In this paper we use wire virtualization method to construct new optimal protocols for a wide range of parameters using previously known optimal protocols. In particular, we design, for the first time, an optimal 1-round (0, δ)-SMT protocol for n = (2 + c)t, c ≥ 1/t, where n is the number of paths between the sender and the receiver, up to t of which are controlled by the adversary. We also design an optimal 2-round (0, 0)-SMT protocol for n = (2 + c)t, c ≥ 1/t, with communication cost better than the known protocols. The wire virtualization method can be used to construct other protocols with provable properties from component protocols.