8 citations · 14 across the 19 of their papers we have counts for
6 papers · 1 filter
A systematic review of secure coded caching
S. -L. Ng, M. B. Paterson, E. A. Quaglia
In a content delivery network (CDN), resources are strained during peak-time and underutilised in off-peak times when supplying digital content to users. Caching can help balance t…
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…
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…
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…
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…