Initial common secret key sharing using random plaintexts for short-range wireless communications

Yao, Taketsugu; Fukui, Kiyoshi; Nakashima, Jun; Nakai, T.

doi:10.1109/tce.2009.5373765

Cited by 8 publications

(5 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Case 3: 1 = 0, 2 ∈ (0, 1), and 1 − 1 − 2 ∈ (0, 1). In this last case, we have (12) = ( 13) > (11). The only feasible solution to it is 1 = 0, 2 = 0.6, and 1 − 1 − 2 = 0.4.…”

Section: Numerical Examplementioning

confidence: 95%

“…In a different direction, the effect of wireless channel dynamics on the data link layer is utilized to share secrets 10 , 11 , 12 . The idea behind works along this line is as follows: Alice and Bob keep sending each other unicast packets without retry, using which the secret is derived; Eve would eventually lose a packet and be unable to figure out the secret even if she knew exactly the mechanism Alice and Bob use.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Wireless Secret Sharing Game between Two Legitimate Users and an Eavesdropper

Liu¹,

Jiang²

2020

Preprint

View full text Add to dashboard Cite

Wireless secret sharing is crucial to information security in the era of Internet of Things. One method is to utilize the effect of the randomness of the wireless channel in the data link layer to generate the common secret between two legitimate users Alice and Bob. This paper studies this secret sharing mechanism from the perspective of game theory. In particular, we formulate a non-cooperative zero-sum game between the legitimate users and an eavesdropper Eve. In a symmetrical game where Eve has the same probability of successfully receiving a packet from Alice and Bob when the transmission distance is the same, we show that both pure and mixed strategy Nash equilibria exist. In an asymmetric game where Eve has different probabilities of successfully receiving a packet from Alice and Bob, a pure strategy may not exist; in this case, we show how a mixed strategy Nash equilibrium can be found.

show abstract

“…Case 3: 1 = 0, 2 ∈ (0, 1), and 1 − 1 − 2 ∈ (0, 1). In this last case, we have (12) = ( 13) > (11). The only feasible solution to it is 1 = 0, 2 = 0.6, and 1 − 1 − 2 = 0.4.…”

Section: Numerical Examplementioning

confidence: 95%

Section: Introductionmentioning

confidence: 99%

Wireless Secret Sharing Game between Two Legitimate Users and an Eavesdropper

Liu¹,

Jiang²

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…Although using the randomness of the wireless channel state to share secrets is very intuitive, its speed of secret sharing is limited by the speed of the variations of the wireless channel state. In a different approach, the consequences of the randomness of wireless channels in the data link layer, rather than the randomness of the wireless channels itself in the physical layer, is exploited to bypass the complexity of dealing with channel coding [13][14][15]. The idea behind these works is that Eve inevitably will lose some packets sent by Alice and Bob (due to the nature of wireless communications), and she will lose the secrets too, if the secrets are embedded into those packets.…”

Section: Related Work and Motivationsmentioning

confidence: 99%

Optimal secret sharing for wireless information security in the era of Internet of Things

Miao

Jiang

2019

Pers Ubiquit Comput

View full text Add to dashboard Cite

Secret sharing is crucial to information security in wireless communications in the era of Internet of Things. In this paper, we study how to optimally share secrets between two and more users using the effect of wireless channel dynamics on the data link layer. For the two-user case, we formulate an optimization problem whose objective is to minimize the expectation of the probability that an eavesdropper receives all secret sharing packets. Our contributions are as follows: (i) we come up with the secret sharing mechanism that minimizes the aforementioned objective function and (ii) we perform analysis on our approach and derive the worst-case probability of the eavesdropper receiving all secret sharing packets. For the multiuser case, we focus on the scenario that three users within each other's communication range try to establish a common secret. A novel multiuser secret sharing mechanism that allows all three users to contribute toward the common secret is developed and analyzed. Our approach has two nice properties: (i) it is able to reset itself in case of packet transmission error and (ii) its secret sharing efficiency is high when the probability of packet transmission success is not low. Our results are validated via simulations.

show abstract

“…The effect of wireless channel dynamics on the data link layer is utilized to share secrets [34][35][36]. It is based on the fact that packet transmissions over wireless channels are not always reliable [37], and the idea is as follows: Alice and Bob keep sending each other unicast packets without retry, with which the secret is derived; Eve will eventually lose a packet and be unable to extract the secret even if she knows exactly which mechanism Alice and Bob are using.…”

Section: Introductionmentioning

confidence: 99%

Wireless Secret Sharing Game for Internet of Things

Miao

Jiang

2023

Sustainability

View full text Add to dashboard Cite

In the era of Internet of Things (IoT), billions of small but smart wireless devices work together to make our cities more intelligent and sustainable. One challenge is that many IoT devices do not have human interfaces and are very difficult for humans to manage. This creates sustainability and security issues. Enabling automatic secret sharing across heterogeneous devices for cryptography purposes will provide the needed security and sustainability for the underlying IoT infrastructure. Therefore, wireless secret sharing is crucial to the success of smart cities. One secret sharing method is to utilize the effect of the randomness of the wireless channel in the data link layer to generate the common secret between legitimate users. This paper models this secret sharing mechanism from the perspective of game theory. In particular, we formulate a non-cooperative zero-sum game between the legitimate users (Alice and Bob) and an eavesdropper (Eve). Alice and Bob’s strategy is deciding how to exchange packets to protect the secret, and Eve’s strategy is choosing where to stay to better intercept the secret. In a symmetrical game where Eve has the same probability of successfully receiving a packet from Alice and Bob when the transmission distance is the same, we show that both pure and mixed strategy Nash equilibria exist. In an asymmetric game where Eve has different probabilities of successfully receiving a packet from Alice and Bob, a pure strategy may not exist; in this case, we show how a mixed strategy Nash equilibrium can be found. We run simulations to show that our results are better than other approaches.

show abstract

Initial common secret key sharing using random plaintexts for short-range wireless communications

Cited by 8 publications

References 4 publications

Wireless Secret Sharing Game between Two Legitimate Users and an Eavesdropper

Wireless Secret Sharing Game between Two Legitimate Users and an Eavesdropper

Optimal secret sharing for wireless information security in the era of Internet of Things

Wireless Secret Sharing Game for Internet of Things

Contact Info

Product

Resources

About