The Price of Privacy: Randomness Complexity of Graph-Based Multi-Secret Sharing 5ZYWF6HAXJ

URI	`m2://res/5ZYWF6HAXJ`
Kind	preprint
Creators	Piotr Marszalik
Date	2026-10-07
MSC	05-XX
Subjects	arxiv cs.IT, arxiv cs.CR, arxiv math.IT
Scope	in

Expressions

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

Item	Kind	Where	Source
Signed $K_4$ alternatives	statement	lemma 10	arxiv
Local switching form	statement	lemma 2	arxiv
Three-state collapse outside $\cU,\cQ$	statement	proposition 12	arxiv
Support values on minimal obstructions	statement	theorem 14	arxiv
Uniformization	statement	lemma 9	arxiv
Exact one-bit characterization	statement	theorem 3	arxiv
Zero randomness	statement	proposition 1	arxiv
Local-view/forced-edge normal form	statement	theorem 13	arxiv
Exact binary $K_4$ classification	statement	theorem 7	arxiv
Four-state upper bound	statement	proposition 6	arxiv
Uniform local flip	statement	lemma 16	arxiv
Heredity	statement	lemma 8	arxiv
M969CA8CC3	definition	definition scheme	arxiv
Heavy--light structure of a flip	statement	lemma 17	arxiv
$K_4$ one-bit criterion	statement	theorem 4	arxiv
Uniform $\Z_3$ scheme	statement	theorem 5	arxiv
Deleting a constant helper	statement	lemma 15	arxiv
Minimal one-bit obstructions	statement	theorem 11	arxiv