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.
1 stories, newest first · one card per story
The paper bounds randomness needed to share correlated secrets on graphs, including all four-party cases.
Today 1.6K readers · 2.5K views · 779 reads · all time 189K views