On Optimal Secure Message Transmission by Public Discussion

Shi, Hongsong; Jiang, Shaoquan; Tuhin, Mohammed Ashraful Alam

doi:10.1109/tit.2010.2090251

Cited by 12 publications

(26 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [16], it was shown that the minimum round complexity of an SMT-PD protocol is three, and PD must be invoked in at least two rounds. Since an (ǫ, δ)-SMT [ow−s] -PD is an SMT-PD with extra restrictions, the same bounds also hold for them.…”

Section: Comparison With Known Resultsmentioning

confidence: 99%

“…We showed the relationship between AWTP PD and (ǫ, δ)-SMT [ow−s] -PD protocols in which wires are used by Alice only, and gave the construction of an optimal (ǫ, δ)-SMT [ow−s] -PD protocol with minimum number of message rounds. A three-round protocol SMT-PD (two-way wires) with the same rate had been constructed in [16]. Our construction shows that assuming one-way communication over wires does not affect the number of message rounds of the optimal protocols.…”

Section: Resultsmentioning

confidence: 99%

“…Our construction also has two steps: a key establishment, followed by encrypting the message and sending it over the public discussion channel. This is also the approach in [9] (Protocol I) and [16]. The model of adversarial wiretap in [14,15] extends wiretap II to include active (jamming) adversarial noise.…”

Section: Related Workmentioning

confidence: 98%

“…In Section 6 we compare these results with the known bounds and constructions of SMT-PD. The message round lower bound for (ǫ, δ)-SMT [ow−s] -PD also lower bounds the message round complexity of general SMT-PD (two-way communication over wires) and so can be compared with the round complexity bounds in [9,16]. Similarly the construction of (ǫ, δ)-SMT [ow−s] -PD can be compared with those in [9].…”

Section: Relation With Smt-pdmentioning

confidence: 99%

See 3 more Smart Citations

Adversarial wiretap channel with public discussion

Wang

2015

2015 IEEE Conference on Communications and Network Security (CNS)

Self Cite

View full text Add to dashboard Cite

Wyner's elegant model of wiretap channel exploits noise in the communication channel to provide perfect secrecy against a computationally unlimited eavesdropper without requiring a shared key. We consider an adversarial model of wiretap channel proposed in [18,19] where the adversary is active: it selects a fraction ρr of the transmitted codeword to eavesdrop and a fraction ρw of the codeword to corrupt by "adding" adversarial error. It was shown that this model also captures network adversaries in the setting of 1-round Secure Message Transmission [8]. It was proved that secure communication (1-round) is possible if and only if ρr + ρw < 1. In this paper we show that by allowing communicants to have access to a public discussion channel (authentic communication without secrecy) secure communication becomes possible even if ρr + ρw > 1. We formalize the model of AWTP PD protocol and for two efficiency measures, information rate and message round complexity derive tight bounds. We also construct a rate optimal protocol family with minimum number of message rounds. We show application of these results to Secure Message Transmission with Public Discussion (SMT-PD), and in particular show a new lower bound on transmission rate of these protocols together with a new construction of an optimal SMT-PD protocol.Alice and Bob are connected by N node disjoint paths, a subset of which is controlled by a computationally unlimited adversary and the goal is to provide secrecy and reliability for the communication. The adversary in AWTP channel is more general (powerful) than the widely studied threshold SMT adversary and can choose different subsets for eavesdropping and corruption.Motivation It was proved [18] that perfect secrecy and reliability for AWTP in 1round communication is possible if and only if, ρ r + ρ w < 1. We consider a scenario where in addition to the AWTP channel, a public discussion channel denoted by PD, is available to the communicants. We call this model AWTP with public discussion (or AWTP PD for short). Our goal is to see if the use of this extra resource can make secure communication possible when ρ r + ρ w > 1 (for example ρ r = ρ w = 0.9). Public discussion channels had been considered in wiretap and SMT models, both. In wiretap setting it was shown [11,2] that a public discussion channel substantially expands the range of scenarios in which secure communication is possible. In particular secure communication becomes possible even if the eavesdroper channel is less noisy than the main channel. A similar result holds for SMT. Access to a public discussion channel in SMT was considered by Garay et.al. [9] who showed that secure message tranmission will be possible when N ≥ t + 1 while without a PD , N ≥ 2t + 1. We allow communicants to interact over the PD but assume communication over the AWTP channel is one-way and from Alice to Bob. This restriction is to simplify our analysis and as we will show, will still allow us to construct protocols that are optimal.The assumption is also natural in setting...

show abstract

Section: Comparison With Known Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 98%

Section: Relation With Smt-pdmentioning

confidence: 99%

See 2 more Smart Citations

Adversarial wiretap channel with public discussion

Wang

2015

2015 IEEE Conference on Communications and Network Security (CNS)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Garay and Ostrovsky [18] introduced the model of SMT by Public Discussion (SMT-PD), which allows transmission over an authentic and reliable public channel in addition to the n channels. Shi et al [36] further studied SMT-PD and constructed a round-optimal perfect SMT-PD. In the context of network coding, similar but more general problems have been studied, and some schemes [39] can be seen as SMT protocols.…”

Section: Introductionmentioning

confidence: 99%

Perfectly Secure Message Transmission Against Rational Timid Adversaries

Fujita

Yasunaga

Koshiba

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Secure Message Transmission (SMT) is a two-party cryptographic protocol by which the sender can securely and reliably transmit messages to the receiver using multiple channels. An adversary for SMT can corrupt a subset of the channels and make eavesdropping and tampering over the channels. In this work, we introduce a game-theoretic security model for SMT in which adversaries have some preferences for the protocol execution. We define rational "timid" adversaries who prefer to violate the security requirements, but do not prefer the tampering to be detected. Such adversaries could arise since they may fear losing their corrupted channels for which they needed some cost or risks. First, we consider the basic setting in which a single adversary attacks the protocol. We show that, even if all but one of the channels are corrupted, we can construct perfect SMT protocols against rational adversaries. In the traditional cryptographic setting, perfect SMT can be constructed only when the adversary corrupts a minority of the channels. Our results demonstrate a way of circumventing the cryptographic impossibility results by a game-theoretic approach. Next, we study the setting in which all the channels can be corrupted by multiple adversaries who do not cooperate. Since we cannot hope for any security if a single adversary corrupts all the channels or multiple adversaries cooperate maliciously, the scenario can arise from a gametheoretic model. We present several perfect SMT protocols, including a non-interactive protocol based on the idea of cheater-identifiable secret sharing. We also study the scenario in which both malicious and rational adversaries exist.

show abstract

Perfectly Secure Message Transmission Against Independent Rational Adversaries

Yasunaga

Koshiba

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

On Optimal Secure Message Transmission by Public Discussion

Cited by 12 publications

References 25 publications

Adversarial wiretap channel with public discussion

Adversarial wiretap channel with public discussion

Perfectly Secure Message Transmission Against Rational Timid Adversaries

Perfectly Secure Message Transmission Against Independent Rational Adversaries

Contact Info

Product

Resources

About