Public discussion must be back and forth in secure message transmission

Authors:
Takeshi Koshiba;Shinya Sawada
Affiliations:
Division of Mathematics, Electronics and Informatics, Graduate School of Science and Engineering, Saitama University, Sakura, Saitama, Japan;Division of Mathematics, Electronics and Informatics, Graduate School of Science and Engineering, Saitama University, Sakura, Saitama, Japan
Venue:
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Year:
2010

Citing 18
Cited 0

Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Fault tolerance in networks of bounded degree

SIAM Journal on Computing
Verifiable secret sharing and multiparty protocols with honest majority

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Perfectly secure message transmission

Journal of the ACM (JACM)
Tolerating a linear number of faults in networks of bounded degree

Information and Computation
Efficient perfectly secure message transmission in synchronous networks

Information and Computation
Fast consensus in networks of bounded degree

Distributed Computing
Almost Secure 1-Round Message Transmission Scheme with Polynomial-Time Message Decryption

ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
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
Towards optimal and efficient perfectly secure message transmission

TCC'07 Proceedings of the 4th conference on Theory of cryptography
Probabilistic perfectly reliable and secure message transmission - possibility, feasibility and optimality

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
Improved fault tolerance and secure computation on sparse networks

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Secure message transmission with small public discussion

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Asymptotically optimal two-round perfectly secure message transmission

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Perfectly Secure Message Transmission Revisited

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Secure message transmission (SMT) is a two-party protocol between a sender and a receiver over a network in which the sender and the receiver are connected by n disjoint channels and t out of n channels can be controlled by an adaptive adversary with unlimited computational resources. If a public discussion channel is available to the sender and the receiver to communicate with each other then a secure and reliable communication is possible even when n ≥ t + 1. The round complexity is one of the important measures for the efficiency for SMT. In this paper, we revisit the optimality and the impossibility for SMT with public discussion and discuss the limitation of SMT with the "unidirectional" public channel, where either the sender or the receiver can invoke the public channel, and show that the "bidirectional" public channel is necessary for SMT.