Secret sharing scheme realizing general access structure

A leakproof secret sharing scheme based on environment sensing is proposed, in which the shadows of participants and the shared secret are leakproof, and can be used repeatedly. The counterfeit shadows of the participants and the authentication information of the shared secret can be changed dynamically basing on environment sensing. So the scheme is secure even against a mobile adversary. Besides, through introducing the concept of adversary structure and the transformation of access structure to adversary structure, the secret sharing on general access structure is realized. Compared to the existing schemes, our scheme is more secure and more flexible in practice. Our scheme is particularly suitable for the system which needs to run long time in the open, such as the wireless sensor network and the multi-robots, the property of leakproof based on environment sensing can improve the efficiency and security of these systems effectively.

Download Full-text

A Probabilistic Secret Sharing Scheme for a Compartmented Access Structure

Information and Communications Security - Lecture Notes in Computer Science ◽

10.1007/978-3-642-25243-3_11 ◽

2011 ◽

pp. 136-142 ◽

Cited By ~ 3

Author(s):

Yuyin Yu ◽

Mingsheng Wang

Keyword(s):

Secret Sharing ◽

Secret Sharing Scheme ◽

Access Structure ◽

Sharing Scheme

Download Full-text

New multi-secret sharing scheme based on superincreasing sequence for level-ordered access structure

International Journal of Communication Networks and Distributed Systems ◽

10.1504/ijcnds.2020.107462 ◽

2020 ◽

Vol 24 (4) ◽

pp. 357

Author(s):

Abdul Basit ◽

Patibandla Chanakya ◽

V. Ch. Venkaiah ◽

Salman Abdul Moiz

Keyword(s):

Secret Sharing ◽

Secret Sharing Scheme ◽

Access Structure ◽

Sharing Scheme ◽

Multi Secret Sharing

Download Full-text

Secret Sharing Schemes from Linear Codes overFp + vFp

International Journal of Foundations of Computer Science ◽

10.1142/s0129054116500180 ◽

2016 ◽

Vol 27 (05) ◽

pp. 595-605 ◽

Cited By ~ 3

Author(s):

Xianfang Wang ◽

Jian Gao ◽

Fang-Wei Fu

Keyword(s):

Secret Sharing ◽

Linear Code ◽

Linear Codes ◽

Difficult Problem ◽

Secret Sharing Schemes ◽

Secret Sharing Scheme ◽

Access Structure ◽

Chain Ring ◽

Sharing Scheme

In principle, every linear code can be used to construct a secret sharing scheme. However, determining the access structure of the scheme is a very difficult problem. In this paper, we study MacDonald codes over the finite non-chain ring [Formula: see text], where p is a prime and [Formula: see text]. We provide a method to construct a class of two-weight linear codes over the ring. Then, we determine the access structure of secret sharing schemes based on these codes.

Download Full-text

Some Multisecret-Sharing Schemes over Finite Fields

Mathematics ◽

10.3390/math8050654 ◽

2020 ◽

Vol 8 (5) ◽

pp. 654 ◽

Cited By ~ 1

Author(s):

Selda Çalkavur ◽

Patrick Solé

Keyword(s):

Finite Fields ◽

Secret Sharing ◽

Reconstruction Algorithm ◽

Digital Signatures ◽

Secret Sharing Scheme ◽

Access Structure ◽

Private Key ◽

Sharing Scheme

A secret sharing scheme is a method of assigning shares for a secret to some participants such that only some distinguished subsets of these subsets can recover the secret while other subsets cannot. Such schemes can be used for sharing a private key, for digital signatures or sharing the key that can be used to decrypt the content of a file. There are many methods for secret sharing. One of them was developed by Blakley. In this work, we construct a multisecret-sharing scheme over finite fields. The reconstruction algorithm is based on Blakley’s method. We determine the access structure and obtain a perfect and ideal scheme.

Download Full-text