A secret-sharing scheme enables a dealer to share a secret s among n parties such that
only authorized subsets of parties, specified by a monotone access structure f:{0, 1} n→{0 …

A secret-sharing scheme allows to distribute a secret s among n parties such that only some
predefined “authorized” sets of parties can reconstruct the secret, and all other …

In a secret-sharing scheme, a secret is shared among n parties such that the secret can be
recovered by authorized coalitions, while it should be kept hidden from unauthorized …

We consider 3 related cryptographic primitives, private information retrieval (PIR) protocols,
conditional disclosure of secrets (CDS) protocols, and secret-sharing schemes; these …

A secret-sharing scheme allows to distribute a secret s among n parties such that only some
predefined" authorized" sets of parties can reconstruct the secret s, and all other" …

A secret-sharing scheme enables a dealer, holding a secret string, to distribute shares to
parties such that only pre-defined authorized subsets of parties can reconstruct the secret …

Cyber-threat protection is one of the most challenging research branches of Internet-of-
Things (iot). With the exponential increase of tiny connected devices, the battle between …

There is a huge gap between the upper and lower bounds on the share size of secret-
sharing schemes for arbitrary n-party access structures, and consistent with our current …

Reducing the Share Size of Weighted Threshold Secret Sharing Schemes via Chow
Parameters Approximation | SpringerLink Skip to main content Advertisement Springer …

A major open problem in information-theoretic cryptography is to obtain a super-polynomial
lower bound for the communication complexity of basic cryptographic tasks. This question is …