Linear secret-sharing scheme size problem
Statement
For an -party monotone access structure , let be the minimum, over all linear secret-sharing schemes for one-bit secrets realizing , of the maximum number of bits in any party's share. Define . Determine the exact or asymptotically optimal growth of , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.