linear secret sharing schemes
Optimal Linear Secret Sharing Schemes for Graph Access Structures on Six Participants
... of linear secret sharing schemes was improved, establishing the optimal in- formation ratio of linear secret sharing schemes for two of ...of linear ...
16
Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
... any linear secret sharing scheme a secret can be shared using a quadratic amount (in the number of players) of field ...mentioned linear time encodable codes, the question arises ...
18
Security of Linear Secret-Sharing Schemes against Mass Surveillance
... Related Work. Kleptography was introduced by Young and Yung in the 90s to consider undetectable modifications to cryptosystems that deliberately provide trapdoor capabilities [7, 8], as an extension to the existing ...
17
Secret Sharing and Statistical Zero Knowledge
... a linear function of the shares gives us a special kind of secret-sharing scheme called a linear secret-sharing ...Karchmer-Wigderson secret sharing scheme [21] for ...
26
Secret Sharing Schemes for Very Dense Graphs
... of secret-sharing ...general secret-sharing schemes, super-polynomial lower bounds are known for linear secret-sharing schemes, that is, for schemes ...
20
Construction of Arithmetic Secret Sharing Schemes by Using Torsion Limits
... then secret sharing schemes have the property of threshold access struc- ture ...a secret sharing scheme is called ideal if the shares have the same size as secrets ...Shamir’s ...
17
Linear threshold verifiable secret sharing in bilinear groups
... Secret sharing (Shamir, 1979; Blakley and Kabatianskii, 1994) is a significant technique for safeguarding very confidential information such as cryptographic ...a secret sharing scheme, a ...
7
Extending Brickell-Davenport Theorem to Non-Perfect Secret Sharing Schemes
... in secret sharing, as it is demonstrated with some examples in the ...of linear and non-linear secret sharing ...perfect secret sharing schemes that can be ...
16
Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
... a linear secret sharing scheme, the secret value and the shares are vectors over some finite field, and every share is the value of a given linear map on some random ...of linear ...
19
Secret Sharing Schemes Based on Extension Fields
... Secret sharing schemes were constructed by Shamir [11] and Blakley [1] in ...used linear codes for secret sharing and explored the relationship between the access structure and ...
7
A Study on Multisecret-Sharing Schemes Based on Linear Codes
... Secret sharing has been a subject of study since 1979. In the secret sharing schemes there are some participants and a ...a secret. The main principle is to distribute a ...
9
STRONGLY SECURE RAMP SECRET SHARING IN DISTRIBUTED DEDUPLICATION IN SYSTEMS
... ramp secret share schemes with common access ...ramp secret sharing schemes known as partly decryptable ramp secret sharing schemes, in which each non-qualified set ...
5
Unconditionally secure cryptographic protocols from coding-theoretic primitives
... of secret-sharing schemes no longer depends on the dual distance of the underlying code, but is controlled by the rate of the underlying code and by the parameters of a family of linear ...
161
Secret Sharing Schemes Based on Resilient Boolean Maps
... Secret sharing schemes (SSS) were proposed in 1979, independently by Sha- mir [20] and Blakley ...between linear codes and SSS is ob- ...
16
Robust Secret Sharing Schemes Against Local Adversaries
... obtain schemes with close to minimal share size in a model of local adversaries, ...efficient secret sharing scheme that essentially meets our lower bound, therefore improving upon the best known ...
30
On products of linear error correcting codes
... Multiplicative linear secret sharing is a fundamental notion in the area of secure multiparty computation and, since recently, in the area of two-party cryptography as ...a linear function of ...
149
On the Power of Amortization in Secret Sharing: $d$-Uniform Secret Sharing and CDS with Constant Information Rate
... We believe that d-uniform access structures form a good candidate for general separation be- tween amortized and non-amortized information ratio. Unfortunately, proving a general lower- bound against non-linear ...
28
Secret Sharing Schemes with General Access Structures (Full version)
... P reveals nothing about the secret key. Consider that in Scenario 1, different groups of users have independently purchased the access to the database from the net- work center, and the payment of each group is ...
23
Vol 7, No 7 (2017)
... Verifiable secret sharing schemes are important in cloud computing ...threshold secret sharing ...needed. Secret sharing has also been suggested for sensor networks where ...
6
An Explication of Multifarious Secret Sharing Schemes
... Let‟s denote Γ as being a set of subsets of P, and the subsets in Γ as being the subset of participants that should be able to compute the key. Then Γ is denoted as being the access structure and the subsets in Γ are ...
5