scholarly journals A Probabilistic Secret Sharing Scheme for a Compartmented Access Structure

Author(s):  
Yuyin Yu ◽  
Mingsheng Wang
2016 ◽  
Vol 27 (05) ◽  
pp. 595-605 ◽  
Author(s):  
Xianfang Wang ◽  
Jian Gao ◽  
Fang-Wei Fu

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.


Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 654 ◽  
Author(s):  
Selda Çalkavur ◽  
Patrick Solé

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.


Kerntechnik ◽  
2015 ◽  
Vol 80 (2) ◽  
pp. 150-160 ◽  
Author(s):  
P. Thiyagarajan ◽  
Prasanth Kumar Thandra ◽  
J. Rajan ◽  
S. A. V. Satyamurthy ◽  
G. Aghila

Sign in / Sign up

Export Citation Format

Share Document