Recent Talks by Doug Stinson
Here are some research talks, in the form of .pdf files.
Combinatorial batch codes
Multicollision attacks on iterated hash functions
Putting dots in triangles
Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
Some new results and conjectures on Costas and honeycomb arrays
Retransmission permutation arrays
A unified approach to combinatorial key predistribution schemes for sensor networks
User-private information retrieval
Nonincident points and blocks in designs
New results and generalizations of the "Russian cards problem"
A coding theory approach to unconditionally secure proof-of-retrievability schemes for cloud storage
Combinatorial aspects of key distribution in wireless sensor networks
Techniques for key predistribution in networks
New results on binary frameproof codes
On partial sums in cyclic groups
All or nothing at all
Some recent results on all-or-nothing transforms, or "All or nothing at all"
Optimal ramp schemes and related combinatorial objects
Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets, or "All or nothing at all"
Optimal algebraic manipulation detection codes and difference families
A Brief Retrospective Look at the Cayley-Purser Public-key Cryptosystem, 19 Years Later
Combinatorial techniques for repairing shares in threshold schemes
A combinatorial design method for repairing shares in threshold schemes
Block-avoiding sequencings of points in Steiner triple systems
Constructions of optimal orthogonal arrays with repeated rows