• Publications
  • Influence
Cryptography - theory and practice
  • D. Stinson
  • Computer Science
  • Discrete mathematics and its applications series
  • 1995
TLDR
From the Publisher: The object of the book is to produce a general, comprehensive textbook that treats all the essential core areas of cryptography. Expand
  • 3,492
  • 224
Visual Cryptography for General Access Structures
TLDR
We analyze the structure of visual cryptography schemes and we prove bounds on the size of the shares distributed to the participants in the scheme. Expand
  • 678
  • 59
  • PDF
A Provably Secure True Random Number Generator with Built-In Tolerance to Active Attacks
TLDR
We propose a general model which, under mild assumptions, will generate provably random bits with some tolerance to adversarial manipulation and running in the megabit-per-second range. Expand
  • 501
  • 51
  • PDF
Combinatorial designs: constructions and analysis
  • D. Stinson
  • Mathematics, Computer Science
  • SIGA
  • 17 October 2003
TLDR
Introduction to BIBDs.- Symmetric BIBD.- Difference sets and automorphisms.- Hadamard matrices and designs.- Resolvable B IBDs.- Steiner triple systems.- Mutually orthogonal Latin squares.- Pairwise balanced designs.- t-designs.- Orthogonal arrays and codes. Expand
  • 394
  • 44
Combinatorial properties of frameproof and traceability codes
TLDR
We present two scenarios to motivate the problems we consider. Expand
  • 316
  • 43
A combinatorial approach to key predistribution for distributed sensor networks
  • J. Lee, D. Stinson
  • Computer Science
  • IEEE Wireless Communications and Networking…
  • 2005
TLDR
We discuss the use of combinatorial set systems in the design of deterministic key predistribution schemes that relate to the connectivity and resilience of the resulting distributed sensor networks. Expand
  • 194
  • 37
  • PDF
Extended capabilities for visual cryptography
TLDR
An extended visual cryptography scheme (EVCS), for an access structure (ΓQual,ΓForb) on a set of n participants, is a technique to encode n images in such a way that when we stack together the transparencies associated to participants in any set X∈Γ Qual we get the secret message with no trace of the original images, but any X∋Forb has no information on the shared image. Expand
  • 434
  • 31
Decomposition constructions for secret-sharing schemes
  • D. Stinson
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 1994
TLDR
The paper describes a very powerful decomposition construction for perfect secret-sharing schemes for graphs of maximum degree d. Expand
  • 192
  • 28
An explication of secret sharing schemes
  • D. Stinson
  • Mathematics, Computer Science
  • Des. Codes Cryptogr.
  • 1 December 1992
TLDR
This paper is an explication of secret sharing schemes, emphasizing combinatorial construction methods. Expand
  • 399
  • 27
  • PDF
Deterministic Key Predistribution Schemes for Distributed Sensor Networks
  • J. Lee, D. Stinson
  • Mathematics, Computer Science
  • Selected Areas in Cryptography
  • 9 August 2004
TLDR
We present two key predistribution schemes (KPSs) for DSNs, ID-based one-way function scheme (IOS) and deterministic multiple space Blom's scheme (DMBS). Expand
  • 227
  • 23
...
1
2
3
4
5
...