2023 - Research.com Computer Science in Canada Leader Award
2011 - Fellow of the Royal Society of Canada Academy of Science
Douglas R. Stinson focuses on Cryptography, Combinatorics, Discrete mathematics, Theoretical computer science and Combinatorial design. His research in Cryptography intersects with topics in Traitor tracing and Key. His Partition study, which is part of a larger body of work in Combinatorics, is frequently linked to Orthogonal array, bridging the gap between disciplines.
The study incorporates disciplines such as Upper and lower bounds, Graph theory, Type and Secret sharing in addition to Discrete mathematics. His Theoretical computer science research is multidisciplinary, incorporating elements of Universal hashing, Hash function, Verifiable secret sharing, Message authentication code and K-independent hashing. Douglas R. Stinson has included themes like Transversal, Authentication and Code in his Combinatorial design study.
His primary areas of investigation include Combinatorics, Discrete mathematics, Theoretical computer science, Cryptography and Computer security. His research in the fields of Steiner system, Combinatorial design and Integer overlaps with other disciplines such as Orthogonal array. His Discrete mathematics study incorporates themes from Scheme, Function, Upper and lower bounds and Type.
His Theoretical computer science research focuses on Hash function and how it relates to Message authentication code. Specifically, his work in Cryptography is concerned with the study of Visual cryptography. His work deals with themes such as Secure multi-party computation and Verifiable secret sharing, which intersect with Secret sharing.
His primary areas of study are Combinatorics, Theoretical computer science, Discrete mathematics, Combinatorial design and Protocol. His Combinatorics study frequently draws connections between related disciplines such as Order. Douglas R. Stinson interconnects One-way function, Secret sharing, Cryptography, Gas meter prover and Cloud storage in the investigation of issues within Theoretical computer science.
His work on Bijection and Characterization as part of general Discrete mathematics study is frequently linked to Nothing and Algebraic manipulation, bridging the gap between disciplines. His Combinatorial design research incorporates elements of Range, Key, Mathematical optimization and Communication complexity. His Protocol research focuses on Event and how it connects with Reliability and Distribution.
The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Cryptography, Combinatorial design and Wireless sensor network. His work on Bijection and Steiner system as part of general Combinatorics research is frequently linked to Nothing and Alphabet, thereby connecting diverse disciplines of science. His Discrete mathematics research is multidisciplinary, relying on both Averaging argument and Cyclic group.
His study brings together the fields of Theoretical computer science and Cryptography. His Combinatorial design research incorporates themes from Range, World Wide Web and Anonymity. His Wireless sensor network study combines topics in areas such as Key, Distributed computing and Base station.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Cryptography: Theory and Practice
Douglas R. Stinson.
(1995)
Advances in Cryptology, Crypto '93
Douglas R. Stinson.
(1994)
Visual Cryptography for General Access Structures
Giuseppe Ateniese;Carlo Blundo;Alfredo De Santis;Douglas R. Stinson.
Electronic Colloquium on Computational Complexity (1996)
Combinatorial Algorithms: Generation, Enumeration, and Search
Donald L. Kreher;Douglas R. Stinson.
(1998)
Combinatorial Designs: Constructions and Analysis
Douglas R. Stinson.
(2003)
A Provably Secure True Random Number Generator with Built-In Tolerance to Active Attacks
B. Sunar;W.J. Martin;D.R. Stinson.
IEEE Transactions on Computers (2007)
Extended capabilities for visual cryptography
Giuseppe Ateniese;Carlo Blundo;Alfredo De Santis;Douglas R. Stinson.
Theoretical Computer Science (2001)
Universal hashing and authentication codes
D. R. Stinson.
Designs, Codes and Cryptography (1994)
An explication of secret sharing schemes
D. R. Stinson.
Designs, Codes and Cryptography (1992)
Combinatorial properties of frameproof and traceability codes
J.N. Staddon;D.R. Stinson;Ruizhong Wei.
IEEE Transactions on Information Theory (2001)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Salerno
Arizona State University
University of Salerno
University of Waterloo
University of Waterloo
Ibaraki University
University of Luxembourg
George Mason University
Google (United States)
Technion – Israel Institute of Technology
EURECOM
University of Basel
Aristotle University of Thessaloniki
SRI International
Cardiff University
Nankai University
University of Brescia
Ghent University
Autonomous University of Yucatán
Helmholtz Centre for Infection Research
Ghent University
University of Nevada, Reno
University of Michigan–Ann Arbor
University of Ferrara
Case Western Reserve University
University of Rhode Island