搜索结果: 1-10 共查到“linear secret-sharing”相关记录10条 . 查询时间(0.128 秒)
On the Local Leakage Resilience of Linear Secret Sharing Schemes
Secret Sharing leakage resilience information theory
font style='font-size:12px;'>
2019/6/5
We consider the following basic question: to what extent are standard secret sharing schemes and protocols for secure multiparty computation that build on them resilient to leakage? We focus on a simp...
Optimal Linear Secret Sharing Schemes for Graph Access Structures on Six Participants
Secret sharing Optimal information ratio Decomposition techniques
font style='font-size:12px;'>
2017/12/25
We review the problem of finding the optimal information ratios of graph access structures on six participants. Study of such access structures were initiated by van Dijk [Des. Codes Cryptogr. 15 (199...
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures
Secret-sharing share size monotone span program
font style='font-size:12px;'>
2017/9/28
A secret-sharing scheme realizes the forbidden graph access structure determined by a graph G=(V,E)G=(V,E) if a pair of vertices can reconstruct the secret if and only if it is an edge in GG. Secret-s...
Security of Linear Secret-Sharing Schemes against Mass Surveillance
linear secret-sharing algorithm-substitution attack mass surveillance
font style='font-size:12px;'>
2015/12/29
Following the line of work presented recently by Bellare, Paterson
and Rogaway, we formalize and investigate the resistance of linear
secret-sharing schemes to mass surveillance. This primitive is w...
Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
Linear Secret Sharing Schemes Linear Time Sharing Robust Secret Sharing
font style='font-size:12px;'>
2015/12/21
A linear near-threshold secret sharing scheme with both linear time sharing and reconstruction
algorithms and large secrets (i.e. secrets of size Ω(n)). Thus, the computational overhead per
sh...
Lower Bounds on the Information Ratio of Linear Secret Sharing Schemes
cryptographic protocols secet sharing linear secret sharing schemes
font style='font-size:12px;'>
2013/2/21
Superpolynomial lower bounds on the average information ratio of linear secret sharing scheme are presented in this note for the first time. The previously known superpolynomial lower bounds applied o...
The Optimal Linear Secret Sharing Scheme for Any Given Access Structure
cryptographic protocols
font style='font-size:12px;'>
2012/3/29
Any linear code can be used to construct a linear secret sharing scheme. In this paper, it is shown how to decide optimal linear codes (i.e., with the biggest information rate) realizing a given acces...
On Efficiently Transferring the Linear Secret-Sharing Scheme Matrix in Ciphertext-Policy Attribute-Based Encryption
public-key cryptography attribute based encryption ciphertext policy access structure linear secret sharing scheme monotone span program
font style='font-size:12px;'>
2010/7/14
Ciphertext-Policy Attribute-Based Encryption(CP-ABE) is a system for realizing complex access control on encrypted data, in which attributes are used to describe a user's credentials and a party encry...
Multi-Party Computation from any Linear Secret Sharing Scheme Secure against Adaptive Adversary: The Zero-Error Case
Multi-Party Computation Linear Secret Sharing Scheme Secure Zero-Error Case
font style='font-size:12px;'>
2009/4/7
We use a general treatment of both information-theoretic and cryptographic settings for
Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our
goal is to study theM...
On codes, matroids and secure multi-party computation from linear secret sharing schemes
Multi-party computation multiplicative linear secret sharing schemes efficient error correction.
font style='font-size:12px;'>
2009/3/27
Error correcting codes and matroids have been widely used in the study of ordinary secret
sharing schemes. In this paper, we study the connections between codes, matroids, and a special
class of sec...