33 citations · 78 across the 45 of their papers we have counts for
4 papers · 1 filter
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…
Bounds on data limits for all-to-all comparison from combinatorial designs
Joanne Hall, Daniel Horsley, Douglas R. Stinson
In situations where every item in a data set must be compared with every other item in the set, it may be desirable to store the data across a number of machines in such a way that…
Unconditionally Secure Non-malleable Secret Sharing and Circular External Difference Families
Shannon Veitch, Douglas R. Stinson
Various notions of non-malleable secret sharing schemes have been considered. In this paper, we review the existing work on non-malleable secret sharing and suggest a novel game-ba…
Dispersed graph labellings
William J. Martin, Douglas R. Stinson
A -dispersed labelling of a graph on vertices is a labelling of the vertices of by the integers such that for . $…