Attributed metadata history
Up to 100 retained publisher events per page for 90c615f7e14f15b12dc7a6e457164c017d5367b3a65478a891b6e401a8538a4e. Withdrawals and unavailable references remain attributed to their publishers.
intelligence_src_e53adb99e40ae66258
observed · 2026-10-12 16:25:04 UTC
ePrint Report: The Price of Privacy: Randomness Complexity of Graph-Based Multi-Secret Sharing Piotr Marszalik We study the randomness required to share possibly correlated secret bits among parties connected by a graph. A dealer places shares on the edges so that each party can recover its own secret from its incident shares and learn nothing about the others beyond what its own secret reveals. Anilkumar et al. completely determined the minimum randomness required for three binary secrets. We extend this study to four secrets and obtain results for arbitrary numbers of secrets on general graphs. For four parties on a complete graph, we determine the minimum number of random states for every set of permitted secret combinations: the possible values are one, two, three and four. We also characterize when one random bit suffices on an arbitrary graph.
Fingerprint: 79ca13e5d7b276a188c65a11f23ea6bad936f1f947c50c7e7fdbf372b7e29a40
intelligence_src_e53adb99e40ae66258
observed · 2026-10-12 16:25:03 UTC
available
Fingerprint: 366cb966e32414edc1db353849a1ee8d6b8462b83786e04001881ba6594765ad