The Price of Privacy: Randomness Complexity of Graph-Based Multi-Secret Sharing
The paper bounds randomness needed to share correlated secrets on graphs, including all four-party cases.
3 stories, newest first · one card per story
The paper bounds randomness needed to share correlated secrets on graphs, including all four-party cases.
GATE introduces a graph-tearing message passing framework that jointly designs subproblems and communication for decentralized optimization over agent clusters.
Researchers formulate private information retrieval under arbitrary graph-based privacy requirements, deriving capacity bounds and introducing pyramid storage graphs.
Today 1.6K readers · 2.4K views · 775 reads · all time 189K views