Perfectly secure message transmission
Journal of the ACM (JACM)
Efficient perfectly secure message transmission in synchronous networks
Information and Computation
Communications of the ACM
Perfectly Secure Message Transmission Revisited
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Perfectly reliable and secure message transmission tolerating mobile adversary
International Journal of Applied Cryptography
On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Truly efficient 2-round perfectly secure message transmission scheme
IEEE Transactions on Information Theory
Towards optimal and efficient perfectly secure message transmission
TCC'07 Proceedings of the 4th conference on Theory of cryptography
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Almost-everywhere secure computation
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
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
International Journal of Applied Cryptography
Optimal message transmission protocols with flexible parameters
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Secure message transmission in asynchronous networks
Journal of Parallel and Distributed Computing
Secure message transmission by public discussion: a brief survey
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Public discussion must be back and forth in secure message transmission
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Constant phase bit optimal protocols for perfectly reliable and secure message transmission
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Round-efficient perfectly secure message transmission scheme against general adversary
Designs, Codes and Cryptography
Secure message transmission with small public discussion
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Optimal one round almost perfectly secure message transmission (short paper)
FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
Secure message transmission in asynchronous directed graphs
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
On the communication complexity of reliable and secure message transmission in asynchronous networks
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Hi-index | 0.06 |
The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (${\mathcal{S}}$) and receiver (${\mathcal{R}}$) that are connected by a synchronous network of n≥2t+1 noiseless 2-way communication channels. Their goal is to communicate privately and reliably, despite the presence of an adversary that may actively corrupt at most t of those channels. These properties should hold information theoretically and without error. We propose an asymptotically optimal solution for this problem. The proposed protocol consists of two communication rounds, and a total of O(ℓn) bits are exchanged in order to transmit a message of ℓ bits. Earlier, at CRYPTO 2004, an equally optimal solution has been claimed. However, we give a counter-example showing that their result is not perfectly reliable. The flaw seems to be fundamental and non-trivial to repair. Our approach is overall entirely different, yet it also makes essential use of their neat communication efficient technique for reliably transmitting conflict graphs. What distinguishes our approach from previous ones is a technique that allows to identify all actively corrupted channels, initially trading it off against privacy. A perfectly secure and reliable secret key is then distilled by privacy amplification.