8 citations · 14 across the 19 of their papers we have counts for
23 papers
A systematic review of secure coded caching
S. -L. Ng, M. B. Paterson, E. A. Quaglia
In a content delivery network (CDN), resources are strained during peak-time and underutilised in off-peak times when supplying digital content to users. Caching can help balance t…
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…
Near-factorizations of dihedral groups
Donald L. Kreher, Maura B. Paterson, Douglas R. Stinson
We investigate near-factorizations of nonabelian groups, concentrating on dihedral groups. We show that some known constructions of near-factorizations in dihedral groups yield equ…
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…