Reproduce “The Price of Privacy: Randomness Complexity of Graph-Based Multi-Secret Sharing” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Piotr Marszalik
The paper classifies the minimum source support for sharing four correlated binary secrets among four parties. A dealer places one share on each edge, and each party must recover its own bit while its complete view reveals nothing about compatible assignments beyond that bit. On the complete graph K4, a constant nonzero even-weight parity permits one source bit; T6 and C5 require three states, while the full cube requires four. Privacy concerns individual parties, not coalitions.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.