Perfectly secure message transmission
Journal of the ACM (JACM)
Efficient perfectly secure message transmission in synchronous networks
Information and Computation
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems
Journal of the ACM (JACM)
Communications of the ACM
On perfectly secure communication over arbitrary networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Perfectly Secure Message Transmission Revisited
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Asynchronous Secure Communication Tolerating Mixed Adversaries
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Almost Secure (1-Round, n-Channel) Message Transmission Scheme
Information Theoretic Security
On proactive perfectly secure message transmission
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
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
Optimal message transmission protocols with flexible parameters
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Optimal one round almost perfectly secure message transmission (short paper)
FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
A general construction for 1-round δ-RMT and (0, δ)-SMT
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
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.00 |
Recently Kurosawa and Suzuki considered almost secure (1-phase n-channel) message transmission when n=(2t+1). The authors gave a lower bound on the communication complexity and presented an exponential time algorithm achieving this bound. In this paper we present a polynomial time protocol achieving the same security properties for the same network conditions. Additionally, we introduce and formalize new security parameters to message transmission protocols which we feel are missing and necessary in the literature. We also focus on 2-phase protocols. We present a protocol achieving perfectly secure message transmission of a single message with O(n2) communication complexity in polynomial time. This is an improvement on previous protocols which achieve perfectly secure message transmission of a single message with a communication complexity of O(n3).