搜索结果: 1-15 共查到“密码学 Access Structures”相关记录21条 . 查询时间(0.062 秒)
Continuously Non-Malleable Secret Sharing for General Access Structures
Secret sharing Non-malleability Leakage resilience
2019/6/3
We study leakage-resilient continuously non-malleable secret sharing, as recently intro- duced by Faonio and Venturi (CRYPTO 2019). In this setting, an attacker can continuously tamper and leak from a...
Secret-Sharing Schemes for General and Uniform Access Structures
secret sharing conditional disclosure of secrets protocols private simultaneous messages protocols
2019/3/4
A secret-sharing scheme allows some authorized sets of parties to reconstruct a secret; the collection of authorized sets is called the access structure. For over 30 years, it was known that any (mono...
Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures
Non-malleable secret sharing Leakage-resilient secret sharing Non-malleable extractors
2018/12/3
In this work we present a collection of compilers that take secret sharing schemes for an arbitrary access structures as input and produce either leakage-resilient or non-malleable secret sharing sche...
Asymptotically Ideal CRT-based Secret Sharing Schemes for Multilevel and Compartmented Access Structures
cryptographic protocols secret sharing
2018/11/8
Multilevel and compartmented access structures are two important classes of access structures where participants are grouped into levels/compartments with different degrees of trust and privileges. Th...
Non-Malleable Secret Sharing for General Access Structures
Non-Malleable Codes Secret Sharing
2018/8/20
Goyal and Kumar (STOC'18) recently introduced the notion of non-malleable secret sharing. Very roughly, the guarantee they seek is the following: the adversary may potentially tamper with all of the s...
Optimal Linear Secret Sharing Schemes for Graph Access Structures on Six Participants
Secret sharing Optimal information ratio Decomposition techniques
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
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...
Efficient Construction of Visual Cryptographic Scheme for Compartmented Access Structures
Compartmented access structure monotone access structure
2016/12/7
In this paper, we consider a special type of secret sharing scheme known as Visual Cryptographic
Scheme (VCS) in which the secret reconstruction is done visually without any
mathematical computation...
Bounds on the Information Ratios of Secret Sharing Schemes for Close Access Structures
foundations secret sharing
2016/7/28
The information ratio of a secret sharing scheme ΣΣ measures the size of the largest share of the scheme, and is denoted by σ(Σ)σ(Σ). The optimal information ratio of an access structure ΓΓ is the inf...
Secret Sharing Schemes with General Access Structures (Full version)
Secret sharing schemes general access structures information tion rate
2015/12/21
Secret sharing schemes with general monotone access structures
have been widely discussed in the literature. But in some scenarios,
non-monotone access structures may have more practical significanc...
In this paper, we introduce the notion of a joint compartmented threshold access structure (JCTAS). We study the necessary conditions for the existence of an ideal and perfect secret sharing scheme an...
On the Access Structures of Hyperelliptic Secret Sharing
secret sharing access structure algebraic-geometric code hyperelliptic
2012/3/27
In this paper we partially determine the access structures of algebraic geometric secret sharing schemes from one point algebraic geometric codes associated with a hyperelliptic curve of any genus. Ou...
Complexity of universal access structures
secret sharing complexity entropy method harmonic series
2011/7/25
An important parameter in a secret sharing scheme is the number of minimal qualified sets.
Complexity of universal access structures
foundations / secret sharing complexity entropy method
2012/3/27
An important parameter in a secret sharing scheme is the number of minimal qualified sets. Given this number, the universal access structure is the richest possible structure, namely the one in which ...
A Simple Scheme for Hierarchical Threshold Access Structures
secret sharing multipartite access structures hierarchical threshold access structures
2009/8/18
This basic idea of (t,n) secret sharing due to Shamir and
Blakley, is generalized by Simmons to compartmented and hierarchical
access structures. While research on the area goes on with description
...