33 citations · 78 across the 45 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.IT2014
On tight bounds for binary frameproof codes
Chuan Guo, Douglas R. Stinson, Tran van Trung
In this paper, we study -frameproof codes, which are equivalent to -separating hash families. Our main results concern binary codes, which are defined over an alphabet…
cs.CR2014
Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs
Maura B. Paterson, Douglas R. Stinson
We study a method for key predistribution in a network of users where pairwise keys are computed by hashing users' IDs along with secret information that has been (pre)distribu…
cs.CR2014
Additional Constructions to Solve the Generalized Russian Cards Problem using Combinatorial Designs
Colleen M. Swanson, Douglas R. Stinson
In the generalized Russian cards problem, we have a card deck of cards and three participants, Alice, Bob, and Cathy, dealt , , and cards, respectively. Once the…