33 citations · 78 across the 45 of their papers we have counts for
4 papers · 1 filter
All or Nothing at All
Paolo D'Arco, Navid Nasr Esfahani, Douglas R. Stinson
We continue a study of unconditionally secure all-or-nothing transforms (AONT) begun in \cite{St}. An AONT is a bijective mapping that constructs s outputs from s inputs. We consid…
A tight bound on the size of certain separating hash families
Chuan Guo, Douglas R. Stinson
In this paper, we present a new lower bound on the size of separating hash families of type {w_1^{q-1},w_2} where w_1 < w_2. Our result extends the paper by Guo et al. on binary fr…
Combinatorial Characterizations of Algebraic Manipulation Detection Codes Involving Generalized Difference Families
Maura B. Paterson, Douglas R. Stinson
This paper provides a mathematical analysis of optimal algebraic manipulation detection (AMD) codes. We prove several lower bounds on the success probability of an adversary and we…
On Partial Sums in Cyclic Groups
D. S. Archdeacon, J. H. Dinitz, A. Mattern +1
We are interested in ordering the elements of a subset A of the non-zero integers modulo n in such a way that all the partial sums are distinct. We conjecture that this can always…