A fully dynamic secret sharing scheme

Yuan, Jiangtao; Li, Lixiang

doi:10.1016/j.ins.2019.04.061

Cited by 19 publications

(14 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, the processing time of the proposed scheme is always lower than that of the scheme in literature. 19 Therefore, the proposed key management scheme is more suitable for larger scale satellite networks.…”

Section: Processing Time Analysismentioning

confidence: 99%

Threshold‐based key management scheme for space network

Tong

Liu

Wang

et al. 2021

Int J Communication

View full text Add to dashboard Cite

The data link protocols proposed by the Consultative Committee for Space Data Systems (CCSDS) is widely used in space missions. However, the current space key management schemes are inefficient in scalability, security, and key update. In this work, a threshold-based spatial key management scheme is proposed and applied to the CCSDS telecommunication control (TC) protocol to ensure the security of spatial networks. The threshold-based key management algorithm using LDPC code is designed to generate, distribute, update, and deactivate the master key. The bilinear pairing cryptosystem is used to protect the group key and provide authentication. The security and performance of the proposed scheme are analyzed. Furthermore, the network model, node model, and process model of CCSDS-TC protocol based on the proposed scheme are constructed and simulated on OPNET platform. The result shows that the storage overhead of the proposed scheme is lower than the improved Shamir and ECC-based key management schemes. Its computational overhead is approximately changeless, whereas the network scale is increasing. Furthermore, the proposed scheme only uses binary multiplication, which takes lower computation overhead. Therefore, the proposed scheme has higher security, scalability, and low resource consumption.

show abstract

Section: Processing Time Analysismentioning

confidence: 99%

Threshold‐based key management scheme for space network

Tong

Liu

Wang

et al. 2021

Int J Communication

View full text Add to dashboard Cite

show abstract

“…In this section, we give a brief description of the secret sharing schemes and the LHR relations [29].…”

Section: Preliminarymentioning

confidence: 99%

“…There are two different types multi-secret sharing schemes. The first type is that the secrets are recovered at the same time [9,19,29]. The second type is that for the different importance of different secrets, these secrets are recovered in a different stage [5,15,17,18,21], i.e., the qualified subset can recover only one secret in each stage.…”

mentioning

confidence: 99%

“…It is asserted that the participants are semi-honest and the distributor is trusty in our scheme. The proposed scheme is based on two technologies, the linear homogeneous recurrence (LHR) relations [8,29] and the oneway functions [16,20]. Mashhadi and Dehkordi first introduced the linear homogeneous recurrence (LHR) relations to the threshold secret sharing schemes [8].…”

mentioning

confidence: 99%

“…Mashhadi and Dehkordi first introduced the linear homogeneous recurrence (LHR) relations to the threshold secret sharing schemes [8]. Later, Yuan et al introduced it to dynamic secret sharing scheme [29]. But the participants are assumed to have the equal privilege in these schemes.…”

mentioning

confidence: 99%

See 2 more Smart Citations

A New Multi-stage Secret Sharing Scheme for Hierarchical Access Structure with Existential Quantifier

Yuan

Jia

2021

ITC

Self Cite

View full text Add to dashboard Cite

Multi-stage secret sharing scheme is practical in the case that there is a security system with m ordered checkpoints.It is natural to divide the m checkpoints into m different levels. There are m different secrets, and eachof them with a different importance corresponds to a checkpoint/level. The participants are also divided intom disjoint levels as they do in the hierarchical threshold access structure. Hierarchical threshold access structurewith the existential quantifier ( HTAS∃ ) does not cover the common practice that at least a few numbersof high-ranking participants are required to be involved in any recovery of the secret. The popular schemeswith hierarchical access structure were needed to check many matrices for non-singularity. We propose amulti-stage secret sharing scheme for HTAS∃ , and the tools are based on the linear homogeneous recurrencerelations (LHRRs) and one-way functions. We give the HTAS∃ a modification, so that this hierarchical accessstructure can satisfy the common practice. In our scheme, if the participants are divided into m levels, thereusually has m secrets. But before the (j − 1)-th secret is recovered, the j-th secret cannot be recovered. Ourscheme is a computational secure. The proposed scheme requires a share for each participant and the shareis as long as each secret. Our scheme has high efficiency by comparing with the state-of-the-art hierarchicalsecret sharing schemes.

show abstract

Verifiable Secret Key Sharing Scheme Based on Threshold Cryptosystem

Zhao,

Chen,

2024

Lecture Notes on Data Engineering and Communications Technologies

View full text Add to dashboard Cite

A fully dynamic secret sharing scheme

Cited by 19 publications

References 12 publications

Threshold‐based key management scheme for space network

Threshold‐based key management scheme for space network

A New Multi-stage Secret Sharing Scheme for Hierarchical Access Structure with Existential Quantifier

Verifiable Secret Key Sharing Scheme Based on Threshold Cryptosystem

Contact Info

Product

Resources

About