33 citations · 78 across the 45 of their papers we have counts for
10 papers · 1 filter
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…
Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes
Maura B. Paterson, Douglas R. Stinson
A splitting BIBD is a type of combinatorial design that can be used to construct splitting authentication codes with good properties. In this paper we show that a design-theoretic…
On the equivalence of authentication codes and robust (2,2)-threshold schemes
Maura B. Paterson, Douglas R. Stinson
In this paper, we show a "direct" equivalence between certain authentication codes and robust secret sharing schemes. It was previously known that authentication codes and robust s…
A Brief Retrospective Look at the Cayley-Purser Public-key Cryptosystem, 19 Years Later
Douglas R. Stinson
The purpose of this paper is to describe and analyze the Cayley-Purser algorithm, which is a public-key cryptosystem proposed by Flannery in 1999. I will present two attacks on it,…
Optimal Ramp Schemes and Related Combinatorial Objects
Douglas R. Stinson
In 1996, Jackson and Martin proved that a strong ideal ramp scheme is equivalent to an orthogonal array. However, there was no good characterization of ideal ramp schemes that are…
Multi-prover Proof-of-Retrievability
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…