Optimal secure message transmission by public discussion

Authors:
Hongsong Shi;Shaoquan Jiang;Reihaneh Safavi-Naini;Mohammed Ashraful Tuhin
Affiliations:
School of Computer Science & Engineering, University of Electronic Science and Technology of China, ChengDu, China and Department of Computer Science, University of Calgary, Calgary, Canada;School of Computer Science & Engineering, University of Electronic Science and Technology of China, ChengDu, China and Department of Computer Science, University of Calgary, Calgary, Canada;Department of Computer Science, University of Calgary, Calgary, Canada;Department of Computer Science, University of Calgary, Calgary, Canada
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Year:
2009

Citing 8
Cited 4

Fault tolerance in networks of bounded degree

SIAM Journal on Computing
Tolerating linear number of faults in networks of bounded degree

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Perfectly secure message transmission

Journal of the ACM (JACM)
Perfectly Secure Message Transmission Revisited

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Optimal secure message transmission by public discussion

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
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
Tight bounds for unconditional authentication protocols in the manual channel and shared key models

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology

Optimal secure message transmission by public discussion

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Secure message transmission by public discussion: a brief survey

IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Public discussion must be back and forth in secure message transmission

ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Secure message transmission with small public discussion

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

Secure message transmission assumes n channels between a sender and a receiver such that up to t channels are under the control of a computationally unlimited adversary. In secure message transmission by public discussion protocol, sender and receiver have access to a public authenticated channel. In this paper we show that if n ≥ t + 1, a secure protocol requires at least 3 rounds of communication and 2 rounds invocation of the public channel. This gives a complete answer to a question raised by Garay and Ostrovsky in Eurocrypt 2008. We also describe a round optimal protocol that has constant transmission rate over the public channel.