scholarly journals Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets

2020 ◽  
Vol 88 (9) ◽  
pp. 1893-1907
Author(s):  
Ryutaroh Matsumoto
Keyword(s):  
Secret Sharing ◽  
Explicit Construction ◽  
Secret Sharing Schemes ◽  
Secret Sharing Scheme ◽  
Access Structure ◽  
Access Structures ◽  
Sharing Scheme ◽  
Randomized Encoding

Abstract We improve the flexibility in designing access structures of quantum stabilizer-based secret sharing schemes for classical secrets, by introducing message randomization in their encoding procedures. We generalize the Gilbert–Varshamov bound for deterministic encoding to randomized encoding of classical secrets. We also provide an explicit example of a ramp secret sharing scheme with which multiple symbols in its classical secret are revealed to an intermediate set, and justify the necessity of incorporating strong security criterion of conventional secret sharing. Finally, we propose an explicit construction of strongly secure ramp secret sharing scheme by quantum stabilizers, which can support twice as large classical secrets as the McEliece–Sarwate strongly secure ramp secret sharing scheme of the same share size and the access structure.

ON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANK

2000 ◽  
Vol 11 (02) ◽  
pp. 263-281
Author(s):  
HUNG-MIN SUN
Keyword(s):  
Secret Sharing ◽  
Upper Bounds ◽  
Secret Sharing Schemes ◽  
Secret Sharing Scheme ◽  
Access Structure ◽  
Constant Rank ◽  
Computational Resource ◽  
Maximum Cardinality ◽  
Access Structures ◽  
Sharing Scheme

A secret sharing scheme is a method which allows a dealer to share a secret among a set of participants in such a way that only qualified subsets of participants can recover the secret. The collection of subsets of participants that can reconstruct the secret in this way is called access structure. The rank of an access structure is the maximum cardinality of a minimal qualified subset. A secret sharing scheme is perfect if unqualified subsets of participants obtain no information regarding the secret. The dealer's randomness is the number of random bits required by the dealer to setup a secret sharing scheme. The efficiency of the dealer's randomness is the ratio between the amount of the dealer's randomness and the length of the secret. Because random bits are a natural computational resource, it is important to reduce the amount of randomness used by the dealer to setup a secret sharing scheme. In this paper, we propose some decomposition constructions for perfect secret sharing schemes with access structures of constant rank. Compared with the best previous results, our constructions have some improved upper bounds on the dealer's randomness and on the efficiency of the dealer's randomness.

Secret Sharing Schemes from Linear Codes overFp + vFp

2016 ◽  
Vol 27 (05) ◽  
pp. 595-605 ◽  
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.

scholarly journals Secret Sharing Schemes Based on Extension Fields

2018 ◽  
Vol 11 (2) ◽  
pp. 410-416
Author(s):  
Selda Çalkavur
Keyword(s):  
Finite Fields ◽  
Secret Sharing ◽  
Secret Sharing Schemes ◽  
Secret Sharing Scheme ◽  
Access Structure ◽  
Sharing Scheme

A (t, n)−secret sharing scheme is a method of distribution of information among n participants such that t > 1 can reconstruct the secret but t − 1 cannot. There is numerous research about secret sharing schemes. However there is little research on secret sharing schemes based on extension fields. In this paper, we study secret sharing schemes based on extension fields over finite fields. We use two methods to recover the secret. We define the access structure and the accessibility degree for these secret sharing schemes. We also describe our theorems, definitions and a corollary

scholarly journals An Efficient Compartmented Secret Sharing Scheme Based on Linear Homogeneous Recurrence Relations

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Guoai Xu ◽  
Jiangtao Yuan ◽  
Guosheng Xu ◽  
Zhongkai Dang
Keyword(s):  
Secret Sharing ◽  
Recovery Phase ◽  
Threshold Scheme ◽  
Secret Sharing Schemes ◽  
Access Structure ◽  
Recurrence Sequence ◽  
Access Structures ◽  
Sharing Scheme ◽  
Global Threshold ◽  
Multipartite Access Structures

Multipartite secret sharing schemes are those that have multipartite access structures. The set of the participants in those schemes is divided into several parts, and all the participants in the same part play the equivalent role. One type of such access structure is the compartmented access structure, and the other is the hierarchical access structure. We propose an efficient compartmented multisecret sharing scheme based on the linear homogeneous recurrence (LHR) relations. In the construction phase, the shared secrets are hidden in some terms of the linear homogeneous recurrence sequence. In the recovery phase, the shared secrets are obtained by solving those terms in which the shared secrets are hidden. When the global threshold is t , our scheme can reduce the computational complexity of the compartmented secret sharing schemes from the exponential time to polynomial time. The security of the proposed scheme is based on Shamir’s threshold scheme, i.e., our scheme is perfect and ideal. Moreover, it is efficient to share the multisecret and to change the shared secrets in the proposed scheme.

scholarly journals A New Approach to Construct Secret Sharing Schemes Based on Field Extensions

2018 ◽  
Vol 11 (2) ◽  
pp. 468-475
Author(s):  
Fatih Molla ◽  
Selda Çalkavur
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Schemes ◽  
Secret Sharing Scheme ◽  
Access Structure ◽  
Secret Key ◽  
New Approach ◽  
Field Extensions ◽  
Sharing Scheme

Secret sharing has been a subject of study since 1979. It is important that a secret key, passwords, information of the map of a secret place or an important formula must be keptsecret. The main problem is to divide the secret into pieces instead of storing the whole for a secret sharing. A secret sharing scheme is a way of distributing a secret among a nite set of people such that only some distinguished subsets of these subsets can recover the secret. The collection of these special subsets is called the access structure of the scheme.In this paper, we propose a new approach to construct secret sharing schemes based on field extensions.

The Optimal Information Rates of the Graph Access Structures on Seven Participants

2013 ◽  
Vol 859 ◽  
pp. 596-601
Author(s):  
Zhi Hui Li ◽  
Yun Song ◽  
Yong Ming Li
Keyword(s):  
Secret Sharing ◽  
Information Rate ◽  
Secret Sharing Scheme ◽  
Access Structure ◽  
Open Problems ◽  
Information Rates ◽  
Access Structures ◽  
Sharing Scheme ◽  
Optimal Information ◽  
Graph Access

The information rate is an important metric of the performance of a secret-sharing scheme. In this paper, we deal with determining the exact values for the optimal information rates of the six graph access structures and improving the information rate of a graph access structure on seven participants, which remained as open problems in Song's and Wang's paper([1,2]). We prove that the optimal information rate for each of the six graph access structures is equal to 4/7

Sign in / Sign up

Export Citation Format

Share Document