Add to ORKGIn 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 and give a characterization of almost all ideal JCTASes. Then we give an ideal and almost surely perfect construction that realizes such access structures. We prove the asymptotic perfectness of this construction by the Schwartz-Zippel Lemma
Threshold secret sharing schemes enable a dealer to share a secret among $n$ parties such that only ...
© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...
AbstractThe characterization of ideal access structures and the search for bounds on the optimal inf...
Weighted threshold secret sharing was introduced by Shamir in his seminal work on secret sharing. In...
We present new families of access structures that, similarly to the multilevel and compartmented acc...
The main results of this paper are theorems which provide a solution to the open problem posed by Ta...
Abstract. Secret sharing schemes with general monotone access struc-tures have been widely discussed...
Secret sharing schemes with general monotone access structures have been widely discussed in the lit...
© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...
The main results of this paper are theorems which provide a solution to the open problem posed by Ta...
How to construct an ideal multi-secret sharing scheme for general access structures is difficult. In...
An n-player -secure robust secret sharing scheme is a (t,n)-threshold secret sharing scheme with the...
Abstmct-Given a set of parties {l,.--, n) , an access structure is a monotone collection of subsets...
In this paper we introduce the class of composite access structures for secret sharing. We also prov...
AbstractSecret sharing is an important concept for implementing robust and secure computer systems. ...
Threshold secret sharing schemes enable a dealer to share a secret among $n$ parties such that only ...
© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...
AbstractThe characterization of ideal access structures and the search for bounds on the optimal inf...
Weighted threshold secret sharing was introduced by Shamir in his seminal work on secret sharing. In...
We present new families of access structures that, similarly to the multilevel and compartmented acc...
The main results of this paper are theorems which provide a solution to the open problem posed by Ta...
Abstract. Secret sharing schemes with general monotone access struc-tures have been widely discussed...
Secret sharing schemes with general monotone access structures have been widely discussed in the lit...
© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...
The main results of this paper are theorems which provide a solution to the open problem posed by Ta...
How to construct an ideal multi-secret sharing scheme for general access structures is difficult. In...
An n-player -secure robust secret sharing scheme is a (t,n)-threshold secret sharing scheme with the...
Abstmct-Given a set of parties {l,.--, n) , an access structure is a monotone collection of subsets...
In this paper we introduce the class of composite access structures for secret sharing. We also prov...
AbstractSecret sharing is an important concept for implementing robust and secure computer systems. ...
Threshold secret sharing schemes enable a dealer to share a secret among $n$ parties such that only ...
© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...
AbstractThe characterization of ideal access structures and the search for bounds on the optimal inf...