Perfectly secure message transmission
Journal of the ACM (JACM)
Efficient perfectly secure message transmission in synchronous networks
Information and Computation
On perfectly secure communication over arbitrary networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Towards optimal and efficient perfectly secure message transmission
TCC'07 Proceedings of the 4th conference on Theory of cryptography
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Asymptotically optimal two-round perfectly secure message transmission
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
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
Optimal secure message transmission by public discussion
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Truly efficient 2-round perfectly secure message transmission scheme
IEEE Transactions on Information Theory
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
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
On communication complexity of secure message transmission in directed networks
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
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
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
Human perfectly secure message transmission protocols and their applications
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Hi-index | 0.06 |
In themodel of perfectly securemessage transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe and forge) the messages sent through t out of n channels. The sender wishes to send a secret s to the receiver perfectly privately and perfectly reliably without sharing any key with the receiver. In this paper, we show the first 2-round PSMT for n = 2t + 1 such that not only the transmission rate is O(n) but also the computational costs of the sender and the receiver are both polynomial in n. This means that we solve the open problem raised by Agarwal, Cramer and de Haan at CRYPTO 2006.