Christopher Williamson

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2026

Secret Sharing at the Shannon Ceiling

Christopher Williamson

For every $n \geq 9$ that is a multiple of 3, we construct an explicit access structure on $n$ participants. In every perfect secret-sharing scheme realising this access structure,…

cs.CC2026

Symmetric Bounded Indistinguishability: Hypergeometric Smoothing and Hahn Polynomials

Christopher Williamson

A pair of probability distributions over ${0, 1}^{n}$ is said to be $(k, δ)$ -wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $δ$ . Prev…