How to Share Secret Efficiently over Networks

Security and Communication Networks

Song

2019

Self Cite

Securing data transferred over a WSN is required to protect data from being compromised by attackers. Sensors in the WSN must share keys that are utilized to protect data transmitted between sensor nodes. There are several approaches introduced in the literature for key establishment in WSNs. Designing a key distribution/establishment scheme in WSNs is a challenging task due to the limited resources of sensor nodes. Polynomial-based key distribution schemes have been proposed in WSNs to provide a lightweight solution for resource-constraint devices. More importantly, polynomial-based schemes guarantee that a pairwise key exists between two sensors in the WSNs. However, one problem associated with all polynomial-based approaches in WSNs is that they are vulnerable to sensor capture attacks. Specifically, the attacker can compromise the security of the entire network by capturing a fixed number of sensors. In this paper, we propose a novel polynomial-based scheme with a probabilistic security feature that effectively reduces the security risk of sensor-captured attacks and requires minimal memory and computation overhead. Furthermore, our design can be extended to provide hierarchical key management to support data aggregation in WSNs.

Section: Theorem 1 If the Attacker Captures K Ch Tokens The Attackementioning

confidence: 96%

Section: Token Generationmentioning

confidence: 99%

Section: (A) Unicast Communication Keysmentioning

confidence: 99%

See 1 more Smart Citation

Hierarchical Key Management Scheme with Probabilistic Security in a Wireless Sensor Network (WSN)

Albakri

Security and Communication Networks

Song

2019

Self Cite

“…But this approach will significantly increase the complexity of secret sharing process. Harn et al have proposed secret sharing schemes based on bivariate polynomials [8,9]. One unique property of this approach is that shares generated by a dealer can serve for two purposes, that are, (a) to reconstruct the secret; and (b) to establish secret communication keys for shareholders.…”

Section: Introductionmentioning

confidence: 99%

A novel threshold changeable secret sharing scheme

Hsu

Xia

2021

Front. Comput. Sci.

Self Cite

A (t, n) threshold secret sharing scheme is a fundamental tool in many security applications such as cloud computing and multiparty computing. In conventional threshold secret sharing schemes, like Shamir's scheme based on a univariate polynomial, additional communication key share scheme is needed for shareholders to protect the secrecy of their shares if secret reconstruction is performed over a network. In the secret reconstruction, the threshold changeable secret sharing (TCSS) allows the threshold to be a dynamic value so that if some shares have been compromised in a given time, it needs more shares to reconstruct the secret. Recently, a new secret sharing scheme based on a bivariate polynomial is proposed in which shares generated initially by a dealer can be used not only to reconstruct the secret but also to protect the secrecy of shares when the secret reconstruction is performed over a network. In this paper, we further extend this scheme to enable it to be a TCSS without any modification. Our proposed TCSS is dealer-free and non-interactive. Shares generated by a dealer in our scheme can serve for three purposes, (a) to reconstruct a secret; (b) to protect the secrecy of shares if secret reconstruction is performed over a network; and (c) to enable the threshold changeable property.

“…Secret sharing (SS) schemes have been widely used in secure computer communications systems [1][2][3][4][5][6][7][8]. Blakley [9] and Shamir [10] independently introduced the concept of the secret sharing in 1979.…”

Section: Introductionmentioning

confidence: 99%

A New Efficient and Secure Secret Reconstruction Scheme (SSRS) with Verifiable Shares Based on a Symmetric Bivariate Polynomial

Hsu

Mobile Information Systems

et al. 2020

Self Cite

Secret sharing (SS) schemes have been widely used in secure computer communications systems. Recently, a new type of SS scheme, called the secure secret reconstruction scheme (SSRS), was proposed, which ensures that the secret can only be recovered by participants who present valid shares. In other words, if any outside adversary participated in the secret reconstruction without knowing any valid share, the secret cannot be recovered by anyone including the adversary. However, the proposed SSRS can only prevent an active attacker from obtaining the recovered secret, but cannot prevent a passive attacker from obtaining the secret since exchange information among participants is unprotected. In this paper, based on bivariate polynomials, we propose a novel design for the SSRS that can prevent both active and passive attackers. Furthermore, we propose a verification scheme which can verify all shares at once, i.e., it allows all shareholders to efficiently verify that their shares obtained from the dealer are generated consistently without revealing their shares and the secret. The proposed scheme is really attractive for efficient and secure secret reconstruction in communications systems.