ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an nn-party monotone access structure Γ⊆2[n]\Gamma\subseteq 2^{[n]}, let ℓΓ\ell_{\Gamma} be the minimum, over all linear secret-sharing schemes for one-bit secrets realizing Γ\Gamma, of the maximum number of bits in any party's share. Define L(n)=max⁡Γ⊆2[n]ℓΓL(n)=\max_{\Gamma\subseteq 2^{[n]}}\ell_{\Gamma}. Determine the exact or asymptotically optimal growth of L(n)L(n), including the optimal exponential share-size exponent for realizing arbitrary access structures by linear secret-sharing schemes.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.