8 citations · 14 across the 19 of their papers we have counts for
12 papers · 1 filter
An introduction to local differential privacy protocols using block designs
Maura B. Paterson, Douglas R. Stinson
The design of protocols for local differential privacy (or LDP) has been a topic of considerable research interest in recent years. LDP protocols utilise the randomised encoding of…
Daniel Litt's Probability Puzzle
Maura B. Paterson, Douglas R. Stinson
In this expository note, we discuss a ``balls-and-urns'' probability puzzle posed by Daniel Litt.
Strong External Difference Families and Classification of -valuations
Donald L. Kreher, Maura B. Paterson, Douglas R. Stinson
One method of constructing -SEDFs (i.e., strong external difference families) in makes use of -valuations of complete bipartite graphs $K_{…
Circular external difference families, graceful labellings and cyclotomy
Maura B. Paterson, Douglas R. Stinson
(Strong) circular external difference families (which we denote as CEDFs and SCEDFs) can be used to construct nonmalleable threshold schemes. They are a variation of (strong) exter…
Characterising bimodal collections of sets in finite groups
Sophie Huczynska, Maura B. Paterson
A collection of disjoint subsets of a finite abelian group is said to have the \emph{bimodal} property if, for any non-zero group element , eit…
Weighted external difference families and R-optimal AMD codes
Sophie Huczynska, Maura B. Paterson
In this paper, we provide a mathematical framework for characterizing AMD codes that are R-optimal. We introduce a new combinatorial object, the reciprocally-weighted external diff…