Public discussion must be back and forth in secure message transmission

Takeshi Koshiba, Shinya Sawada

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationInformation Security and Cryptology, ICISC 2010 - 13th International Conference, Revised Selected Papers
Pages325-337
Number of pages13
Volume6829 LNCS
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event13th International Conference on Information Security and Cryptology, ICISC 2010 - Seoul, Korea, Republic of
Duration: 2010 Dec 12010 Dec 3

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6829 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th International Conference on Information Security and Cryptology, ICISC 2010
CountryKorea, Republic of
CitySeoul
Period10/12/110/12/3

Fingerprint

Receiver
Optimality
Disjoint
Resources
Necessary
Communication

Keywords

  • public discussion
  • round complexity
  • secure message transmission

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Koshiba, T., & Sawada, S. (2011). Public discussion must be back and forth in secure message transmission. In Information Security and Cryptology, ICISC 2010 - 13th International Conference, Revised Selected Papers (Vol. 6829 LNCS, pp. 325-337). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6829 LNCS). https://doi.org/10.1007/978-3-642-24209-0_22

Public discussion must be back and forth in secure message transmission. / Koshiba, Takeshi; Sawada, Shinya.

Information Security and Cryptology, ICISC 2010 - 13th International Conference, Revised Selected Papers. Vol. 6829 LNCS 2011. p. 325-337 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6829 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Koshiba, T & Sawada, S 2011, Public discussion must be back and forth in secure message transmission. in Information Security and Cryptology, ICISC 2010 - 13th International Conference, Revised Selected Papers. vol. 6829 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6829 LNCS, pp. 325-337, 13th International Conference on Information Security and Cryptology, ICISC 2010, Seoul, Korea, Republic of, 10/12/1. https://doi.org/10.1007/978-3-642-24209-0_22
Koshiba T, Sawada S. Public discussion must be back and forth in secure message transmission. In Information Security and Cryptology, ICISC 2010 - 13th International Conference, Revised Selected Papers. Vol. 6829 LNCS. 2011. p. 325-337. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-24209-0_22
Koshiba, Takeshi ; Sawada, Shinya. / Public discussion must be back and forth in secure message transmission. Information Security and Cryptology, ICISC 2010 - 13th International Conference, Revised Selected Papers. Vol. 6829 LNCS 2011. pp. 325-337 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{c4ec25e215e94f4b8d33b5b95f07d5f0,
title = "Public discussion must be back and forth in secure message transmission",
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.",
keywords = "public discussion, round complexity, secure message transmission",
author = "Takeshi Koshiba and Shinya Sawada",
year = "2011",
doi = "10.1007/978-3-642-24209-0_22",
language = "English",
isbn = "9783642242083",
volume = "6829 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "325--337",
booktitle = "Information Security and Cryptology, ICISC 2010 - 13th International Conference, Revised Selected Papers",

}

TY - GEN

T1 - Public discussion must be back and forth in secure message transmission

AU - Koshiba, Takeshi

AU - Sawada, Shinya

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - public discussion

KW - round complexity

KW - secure message transmission

UR - http://www.scopus.com/inward/record.url?scp=80052809833&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80052809833&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-24209-0_22

DO - 10.1007/978-3-642-24209-0_22

M3 - Conference contribution

SN - 9783642242083

VL - 6829 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 325

EP - 337

BT - Information Security and Cryptology, ICISC 2010 - 13th International Conference, Revised Selected Papers

ER -