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

Miao, Lei; Jiang, Dingde

doi:10.1007/s00779-019-01226-z

Cited by 5 publications

(7 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, the random distribution problem in service orientation under ubiquitous computing environment is studied, and the method to solve the np-complete problem is proposed. Meanwhile, the application conditions and the proof process of the solution are given [7,8]. Sensor physical devices such as the various functions of abstraction and combination then packaged into different services, according to different service design standard unified management and integrated distribution platform; at the same time, they point out that such a serviceoriented design can more quickly and easily build a variety of new applications for users [9].…”

Section: Introductionmentioning

confidence: 99%

Load Balancing Optimization of In-Memory Database for Massive Information Processing of Internet of Things (IoTs)

Wei

2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Based on the analysis of the key technologies of the Internet of Things service platform architecture, a load balancing optimization scheme of in-memory database based on the massive information processing of the Internet of Things service platform is proposed. This scheme firstly proposes a system model that can satisfy the mass sensor information processing under the open platform environment and designs several functional unit modules of the system. By combining these functional units, the service can be configured for thousands of services and tenants. This paper presents an adaptive strategy selection method, which can automatically select the optimization strategy by dividing the position and querying the selection rate to improve the efficiency of the adaptive index algorithm. The index structure is initialized by parallel sorting algorithm, and the query statement is executed and the index structure is optimized by thread level parallel and radix sort methods. An elastic pipeline technique is proposed, which includes an elastic iterator model and a dynamic scheduler. The elastic iterator model is an upgrade of the traditional iterator model, adding the characteristics of dynamic multicore execution. In the process of query processing, dynamic scheduler monitors the load of each node in real time and dynamically adjusts the parallelism, so as to realize the load balance of in-memory database and maximize the utilization of hardware resources. The elastic pipeline realizes the isolation of parallelism from query compilation to avoid inappropriate parallelism allocation caused by missing and insufficient information during query compilation.

show abstract

Section: Introductionmentioning

confidence: 99%

Load Balancing Optimization of In-Memory Database for Massive Information Processing of Internet of Things (IoTs)

Wei

2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Case 1: 1 ∈ (0, 1), 2 ∈ (0, 1), and 1 − 1 − 2 = 0. It yields that (11) = ( 12) > (13). There are two solutions that ensure 1 , 2 , and 1 − 1 − 2 are not all positive and less than 1.…”

Section: Numerical Examplementioning

confidence: 99%

“…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. More details of this approach can be found in our previous work 13 where we discuss optimal secret sharing between Alice and Bob with the presence of Eve. Specifically, we assume in 13 that Eve's location is random, and only Alice and Bob can choose how to generate the secret; we show that when the probability of successfully transmitting a packet is monotonically decreasing with the transmission distance and Eve's location is uniformly distributed, the optimal strategy for Alice and Bob to minimize the probability that Eve figures out the secret is to generate half of the secret from each one of them.…”

Section: Introductionmentioning

confidence: 99%

Wireless Secret Sharing Game between Two Legitimate Users and an Eavesdropper

Liu¹,

Jiang²

2020

Preprint

Self Cite

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

“…Rabiah [42,43] extended the work in [34] further for IoT devices by adding authentication: one master key and an initial session key are provided to all nodes at startup, and the subsequent session keys change over time. Our previous work in [44] discussed optimal secret sharing between Alice and Bob with the presence of Eve. In particular, we assumed that Eve's location is random, and only Alice and Bob can choose how to generate the secret; we showed that when the probability of successfully transmitting a packet is monotonically decreasing with the transmission distance and Eve's location is uniformly distributed, the optimal strategy for Alice and Bob to successfully share the secret is to generate half of the packets from each one of them.…”

Section: Introductionmentioning

confidence: 99%

Wireless Secret Sharing Game for Internet of Things

Miao

Jiang

2023

Sustainability

Self Cite

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

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

Cited by 5 publications

References 14 publications

Load Balancing Optimization of In-Memory Database for Massive Information Processing of Internet of Things (IoTs)

Load Balancing Optimization of In-Memory Database for Massive Information Processing of Internet of Things (IoTs)

Wireless Secret Sharing Game between Two Legitimate Users and an Eavesdropper

Wireless Secret Sharing Game for Internet of Things

Contact Info

Product

Resources

About