2 citations · 3 across the 4 of their papers we have counts for
4 papers
A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage
Maura B. Paterson, Douglas R. Stinson, Jalaj Upadhyay
There has been considerable recent interest in "cloud storage" wherein a user asks a server to store a large file. One issue is whether the user can verify that the server is actua…
Combinatorial Solutions Providing Improved Security for the Generalized Russian Cards Problem
Colleen M. Swanson, Douglas R. Stinson
We present the first formal mathematical presentation of the generalized Russian cards problem, and provide rigorous security definitions that capture both basic and extended versi…
Packing Costas Arrays
J. H. Dinitz, P. R. J. Ostergard, D. R. Stinson
A Costas latin square of order n is a set of n disjoint Costas arrays of the same order. Costas latin squares are studied here from a construction as well as a classification point…
Honeycomb arrays
Simon R. Blackburn, Anastasia Panoui, Maura B. Paterson +1
A honeycomb array is an analogue of a Costas array in the hexagonal grid; they were first studied by Golomb and Taylor in 1984. A recent result of Blackburn, Etzion, Martin and Pat…