intelligence_src_e53adb99e40ae66258
- Source-provided label
- Publisher RSS metadata
- Evidence class
- mentioned in report
- Confidence
- Not reported
- Observed
- Oct 08, 2026 20:36 UTC
- Retrieved
- Oct 13, 2026 04:25 UTC
The Price of Privacy: Randomness Complexity of Graph-Based Multi-Secret Sharing
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.
Reference details
- Source category
- research-report
- First reported
- Oct 08, 2026 20:36 UTC
- Last reported
- Oct 08, 2026 20:36 UTC
- Catalog updated
- Oct 13, 2026 04:25 UTC
- Record ID
90c615f7e14f15b12dc7a6e457164c017d5367b3a65478a891b6e401a8538a4e
Published indicators
Network indicators are visibly defanged. This page does not make them clickable or send them to another service.
No validated file hashes or network indicators are stored for this record.
Source observations
This record contains metadata and attribution only. It does not host, download, unpack, render, or execute malware samples.
Feed collection status
Sources represented on this page. Publication and observation dates describe the content; successful batch dates describe local collection. A recent batch does not certify complete coverage or current provider availability.
1 sources: 0 stale, 0 needing attention, 0 paused, 0 unverified.
Review source update dates and status
- intelligence_src_e53adb99e40ae66258Recent successful batchLast successful batch: Last attempt:
Stale means older than twice the recorded collection interval, with a minimum of one hour; without an interval, the threshold is 24 hours. Cached content remains available while a feed is stale, paused, or unverified.