Doug Stinson | Academic Influence

Doug Stinson's AcademicInfluence.com Rankings

Doug Stinson

Computer Science

#2360

World Rank

#2464

Historical Rank

computer-science Degrees

Doug Stinson

Mathematics

#3181

World Rank

#4752

Historical Rank

Measure Theory

#450

World Rank

#645

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Doug Stinson's Degrees

Masters Mathematics University of Manitoba
Bachelors Mathematics University of Manitoba

Similar Degrees You Can Earn

Best Online Bachelor's in Math Ranked

Why Is Doug Stinson Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Douglas Robert Stinson is a Canadian mathematician and cryptographer, currently a Professor Emeritus at the University of Waterloo. Stinson received his B.Math from the University of Waterloo in 1978, his M.Sc. from Ohio State University in 1980, and his Ph.D. from the University of Waterloo in 1981. He was at the University of Manitoba from 1981 to 1989, and the University of Nebraska-Lincoln from 1990 to 1998. In 2011 he was named as a Fellow of the Royal Society of Canada.

(See a Problem?)

Doug Stinson's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Cryptography - theory and practice (1995) (3689)
Visual Cryptography for General Access Structures (1996) (731)
Advances in Cryptology — CRYPTO’ 93 (2001) (625)
A Provably Secure True Random Number Generator with Built-In Tolerance to Active Attacks (2007) (573)
Contemporary design theory : a collection of surveys (1992) (570)
Combinatorial algorithms: generation, enumeration, and search (1998) (487)
Extended capabilities for visual cryptography (2001) (473)
Combinatorial designs: constructions and analysis (2003) (457)
An explication of secret sharing schemes (1992) (406)
Universal hashing and authentication codes (1991) (405)
Combinatorial properties of frameproof and traceability codes (2001) (343)
Cryptography: Theory and Practice,Second Edition (2002) (325)
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes (1998) (298)
On the Contrast in Visual Cryptography Schemes (1999) (294)
Deterministic Key Predistribution Schemes for Distributed Sensor Networks (2004) (233)
Cryptography: Theory and Practice, Third Edition (2005) (228)
Contrast Optimal Threshold Visual Cryptography Schemes (2003) (214)
A combinatorial approach to key predistribution for distributed sensor networks (2005) (210)
On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs (2008) (210)
Decomposition constructions for secret-sharing schemes (1994) (193)
On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption (1997) (189)
Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels (2002) (172)
Some Observations on the Theory of Cryptographic Hash Functions (2006) (149)
Constructions and Bounds for Visual Cryptography (1996) (143)
Graph decompositions and secret sharing schemes (1992) (139)
The Oberwolfach problem and factors of uniform odd length cycles (1989) (133)
Secure frameproof codes, key distribution patterns, group testing algorithms and related structures (2000) (130)
Some New Results on Key Distribution Patterns and Broadcast Encryption (1998) (126)
Surveys in Combinatorics, 1999: Applications of Combinatorial Designs to Communications, Cryptography, and Networking (1999) (125)
New Approaches to Designing Public Key Cryptosystems Using One-Way Functions and Trapdoors in Finite Groups (2002) (123)
Frames for Kirkman triple systems (1987) (116)
Some improved bounds on the information rate of perfect secret sharing schemes (1990) (114)
The Detection of Cheaters in Threshold Schemes (1990) (112)
Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution (1996) (109)
Some New Bounds for Cover-Free Families (2000) (106)
On the Connections Between Universal Hashing, Combinatorial Designs and Error-Correcting Codes (1995) (102)
Something About All or Nothing (Transforms) (2001) (101)
A Combinatorial Approach to Threshold Schemes (1987) (99)
Provably Secure Distributed Schnorr Signatures and a (t, n) Threshold Scheme for Implicit Certificates (2001) (99)
Key Preassigned Traceability Schemes for Broadcast Encryption (1998) (97)
A New Characterization of Semi-bent and Bent Functions on Finite Fields* (2006) (93)
New constructions for perfect hash families and related structures using combinatorial designs and codes (2000) (92)
Generalized cover-free families (2004) (92)
Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets (1999) (91)
Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures (1999) (86)
New combinatorial designs and their applications to authentication codes and secret sharing schemes (2004) (79)
CORR 99-01 Applications of Combinatorial Designs to Communications , Cryptography , and Networking (1999) (77)
A unified approach to combinatorial key predistribution schemes for sensor networks (2014) (74)
The combinatorics of authentication and secrecy codes (2005) (73)
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem (2002) (72)
Some recursive constructions for perfect hash families (1996) (72)
Elliptic Curve Pseudorandom Sequence Generators (1999) (70)
Combinatorial Characterizations of Authentication Codes II (1992) (70)
Hill-Climbing Algerithms for the Construction of Combinatorial Designs (1985) (65)
Minimality and other properties of the width-w nonadjacent form (2005) (65)
Combinatorial batch codes (2009) (65)
A Short Proof of the Nonexistence of a Pair of Orthogonal Latin Squares of Order Six (1984) (63)
Combinatorial characterizations of authentication codes (1991) (61)
Frames with Block Size Four (1992) (61)
Steiner pentagon systems (1984) (61)
On generalized separating hash families (2008) (60)
Cryptography : Theory and Practice -3/E. (2014) (59)
Universal hash families and the leftover hash lemma, and applications to cryptography and computing (2010) (59)
New General Lower Bounds on the Information Rate of Secret Sharing Schemes (1992) (58)
Three characterizations of non-binary correlation-immune and resilient functions (1995) (57)
Multicollision Attacks on Some Generalized Sequential Hash Functions (2007) (55)
Combinatorial Techniques for Universal Hashing (1994) (54)
Unconditionally secure social secret sharing scheme (2010) (53)
Resilient functions and large sets of orthogonal arrays (51)
Generalized Beimel-Chor Schemes for Broadcast Encryption and Interactive Key Distribution (1998) (51)
Some results on quadrilaterals in Steiner triple systems (1992) (49)
On the Dealer's Randomness Required in Secret Sharing Schemes (1994) (49)
Hanani triple systems (1993) (47)
On sets of three mols with holes (1985) (47)
Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds (1996) (47)
Key predistribution for homogeneous wireless sensor networks with group deployment of nodes (2010) (45)
A survey of Kirkman triple systems and related designs (1991) (44)
Mols with holes (1983) (44)
Universal Hashing and Multiple Authentication (1996) (44)
Privacy Analysis of Forward and Backward Untraceable RFID Authentication Schemes (2011) (43)
On the complexity of the herding attack and some related attacks on hash functions (2012) (43)
On combinatorial designs with subdesigns (1989) (43)
Socio-Rational Secret Sharing as a New Direction in Rational Cryptography (2012) (42)
Bounds for Resilient Functions and Orthogonal Arrays (1994) (42)
The spectrum of nested Steiner triple systems (1985) (42)
An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions (1995) (42)
Almost k -Wise Independent Sample Spaces and Their Cryptologic Applications (2001) (41)
New Minimal Weight Representations for Left-to-Right Window Methods (2005) (41)
On Unconditionally Secure Robust Distributed Key Distribution Centers (2002) (40)
Some NP-complete problems for hypergraph degree sequences (1986) (40)
Some constructions and bounds for authentication codes (2004) (39)
A Note on a Conjecture Concerning Symmetric Resilient Functions (1993) (39)
Frameproof and IPP Codes (2001) (39)
Visual cryptography and threshold schemes (1999) (38)
Unconditionally secure signature schemes revisited (2011) (38)
On resolvable group-divisible designs with block size 3 (1987) (36)
The Existence of Howell Designs of Even Side (1984) (35)
Group Testing and Batch Verification (2009) (35)
Some new perfect one-factorizations from starters in finite fields (1989) (34)
On the existence of MOLS with equal-sized holes (1987) (34)
A bound on the size of separating hash families (2008) (34)
On dealer-free dynamic threshold schemes (2013) (34)
Recent results on combinatorial constructions for threshold schemes (1990) (34)
Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes (2002) (33)
Threshold schemes from combinatorial de - signs (1989) (33)
Anonymous Secret Sharing Schemes (1997) (32)
An application of covering designs: determining the maximum consistent set of shares in a threshold scheme (1999) (32)
Sequentially Perfect and Uniform One-Factorizations of the Complete Graph (2005) (32)
Some Observations on Parallel Algorithms for Fast Exponentiation in GF(2^n) (1990) (32)
Social secret sharing in cloud computing using a new trust function (2012) (32)
Efficient Sealed-Bid Auction Protocols Using Verifiable Secret Sharing (2014) (32)
Combinatorial designs and cryptography (1993) (31)
The Spectrum of Room Cubes (1981) (30)
A construction for authentication/secrecy codes from certain combinatorial designs (1987) (30)
A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares (1987) (30)
Combinatorial Characterizations of Algebraic Manipulation Detection Codes Involving Generalized Difference Families (2015) (30)
On Partial Sums in Cyclic Groups (2015) (29)
Common intersection designs (2006) (29)
How to improve security and reduce hardware demands of the WIPR RFID protocol (2009) (29)
On Unconditionally Secure Distributed Oblivious Transfer (2007) (28)
The computational complexity of recognizing critical sets (1984) (28)
Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families (2008) (28)
On the spectrum of resolvable orthogonal arrays invariant under the Klein group K4 (1983) (27)
The spectrum of skew Room squares (1981) (27)
On strong starters in cyclic groups (1985) (27)
Authentication Codes with Multiple Arbiters (Extended Abstract) (1988) (27)
Some Results on the Existence of Squares (1980) (27)
Cryptography: Theory and Practice (Discrete Mathematics and Its Applications) (2017) (26)
The existence of simple S3(3, 4, v) (1989) (26)
A new family of Gold-like sequences (2002) (26)
On the existence of Kirkman triple systems containing Kirkman subsystems (1988) (26)
Finite linear spaces and projective planes (1983) (26)
Non-interactive two-channel message authentication based on hybrid-collision resistant hash functions (2007) (25)
A Fast Algorithm for Finding Strong Starters (1981) (25)
Metering Schemes for General Access Structures (2000) (24)
Edge-coloured designs with block size four (1988) (24)
The equivalence of certain equidistant binary codes and symmetric bibds (1984) (24)
A Kirkman square of order 51 and block size 3 (1985) (24)
Small group-divisible designs with block size four (1997) (23)
Alternative Digit Sets for Nonadjacent Representations (2003) (23)
Nesting of cycle systems of odd length (1989) (23)
Combinatorial solutions providing improved security for the generalized Russian cards problem (2012) (23)
A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets (1999) (23)
Fault Tolerant and DistributedBroadcast Encryption (2003) (23)
On bit-serial multiplication and dual bases in GF(2m) (1991) (22)
A Construction for Authentication/secrecy Codes from 3-homogeneous Permutation Groups (1990) (22)
The Lovász Local Lemma and Its Applications to some Combinatorial Arrays (2004) (22)
A general construction for group-divisible designs (1981) (22)
Orthogonal packings inPG(5, 2) (1986) (22)
Further results on large sets of disjoint group-divisible designs (1992) (21)
An Application of Ramp Schemes to Broadcast Encryption (1999) (21)
Efficient metering schemes with pricing (2001) (20)
Some small large sets of t-designs (1991) (20)
Some Nonexistence Results for Strong External Difference Families using Character Theory (2016) (20)
An efficient and secure two-flow zero-knowledge identification protocol (2007) (20)
The Effectiveness of Receipt-Based Attacks on ThreeBallot (2009) (19)
New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes (1998) (19)
A perfect one-factorization for K36 (1988) (19)
Selected Areas in Cryptography - 17th International Workshop, SAC 2010, Waterloo, Ontario, Canada, August 12-13, 2010, Revised Selected Papers (2011) (18)
Pairwise balanced designs with block sizes 6t + 1 (1987) (18)
All or Nothing at All (2015) (18)
New Results on Unconditionally Secure Distributed Oblivious Transfer (2002) (18)
Some New Row-Complete Latin Squares (1980) (18)
Short one-time signatures (2011) (18)
A Highly Scalable RFID Authentication Protocol (2009) (17)
On the enumeration of one-factorizations of complete graphs containing prescribed automorphism groups (1988) (17)
The Existence of Howell Designs of Odd Side (1982) (17)
284457 Steiner triple systems of order 19 contain a subsystem of order 9 (1986) (16)
An Efficient Identification Protocol and the Knowledge-of-Exponent Assumption (2007) (16)
2000000 Steiner triple systems of order 19 (1985) (16)
A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage (2012) (16)
Unconditionally Secure First-Price Auction Protocols Using a Multicomponent Commitment Scheme (2010) (16)
Sequential Secret Sharing as a New Hierarchical Access Structure (2015) (15)
Three Improved Algorithms for Multipath Key Establishment in Sensor Networks Using Protocols for Secure Message Transmission (2011) (15)
Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures (2011) (15)
Multicollision Attacks on Generalized Hash Functions (2004) (15)
Dynamic Multi-threshold Metering Schemes (2000) (15)
Evaluation of Security Level of Cryptography : ECDSA Signature Scheme (2001) (14)
Interactive two-channel message authentication based on Interactive-Collision Resistant hash functions (2009) (14)
Supplement to Steiner Triple Systems of Order 19 with Nontrivial Automorphism Group (1992) (14)
Some Results on the Existence of $t$ -All-or-Nothing Transforms Over Arbitrary Alphabets (2017) (14)
On tight bounds for binary frameproof codes (2014) (13)
Multi-prover proof of retrievability (2016) (13)
Two-fold triple systems without repeated blocks (1983) (13)
Practical Approaches to Varying Network Size in Combinatorial Key Predistribution Schemes (2013) (13)
Quorum Systems Constructed from Combinatorial Designs (2001) (13)
On Decomposing Graphs into Isomorphic Uniform 2-Factors (1985) (13)
Extended combinatorial constructions for peer-to-peer user-private information retrieval (2011) (13)
On the existence of three MOLS with equal-sized holes (1991) (13)
Two attacks on a sensor network key distribution scheme of Cheng and Agrawal (2008) (13)
Multiple Key Distribution Maintaining User Anonymity via Broadcast Channels (1995) (13)
Brief announcement: secret sharing based on the social behaviors of players (2010) (13)
Broadcast-Enhanced Key Predistribution Schemes (2014) (12)
Slope packings and coverings, and generic algorithms for the discrete logarithm problem (2001) (12)
An Innnite Class of Counterexamples to a Conjecture concerning Non-linear Resilient Functions (1995) (12)
Practical unconditionally secure two-channel message authentication (2010) (12)
A Simple Analysis of the Error Probability of Two-Point Based Sampling (1996) (11)
On The Security of The ElGamal Encryption Scheme and Damgard's Variant (2008) (11)
On the low hamming weight discrete logarithm problem for nonadjacent representations (2005) (11)
Computational results on invertible matrices with the maximum number of invertible 2×2 submatrices (2017) (11)
Resilient Aggregation in Simple Linear Sensor Networks (2014) (11)
A new proof of the Doyen-Wilson theorem (1989) (11)
An Inequality About Factors of Multivariate Polynomials (2006) (10)
Some Perfect One-Factorizations of K14 (1987) (10)
Additional Constructions to Solve the Generalized Russian Cards Problem using Combinatorial Designs (2014) (10)
Properties and constraints of cheating-immune secret sharing schemes (2006) (10)
Key Refreshing in Wireless Sensor Networks (2008) (10)
A simple combinatorial treatment of constructions and threshold gaps of ramp schemes (2013) (10)
The non-existence of certain finite linear spaces (1983) (9)
Combinatorial characterizations of authentication codes II (1996) (9)
Combinatorial repairability for threshold schemes (2016) (9)
Minimum node degree and κ-connectivity for key predistribution schemes and distributed sensor networks (2008) (9)
Some Results on Nonlinear Zigzag FunctionsD (1997) (9)
A New Message Recognition Protocol for Ad Hoc Pervasive Networks (2008) (9)
Exact Covering Configurations and Steiner Systems (1982) (9)
Secure Network Discovery in Wireless Sensor Networks Using Combinatorial Key Pre-distribution (2011) (9)
Block-avoiding sequencings of points in Steiner triple systems (2019) (9)
Yet Another Hat Game (2010) (8)
Extended results on privacy against coalitions of users in user-private information retrieval protocols (2015) (8)
The existence of howell designs of siden+1 and order 2n (1981) (8)
Some results concerning frames, Room squares, and subsquares (1981) (8)
Towards the Spectrum of Room Squares with Subsquares (1993) (8)
Pairwise Balanced Designs with Block Sizes Three and Four (1991) (8)
Ideal ramp schemes and related combinatorial objects (2018) (8)
Evaluation of Security Level of Cryptography: MY-ELLTY Signature Scheme (2001) (8)
Spanning sets and scattering sets in Steiner triple systems (1991) (8)
Generalized Zig-zag Functions and Oblivious Transfer Reductions (2001) (8)
Selected Areas in Cryptography: 7th Annual International Workshop, SAC 2000, Waterloo, Ontario, Canada, August 14-15, 2000. Proceedings (2001) (8)
Almost k-wise Independent Sample Spaces and Their Cryptologic Applications (1997) (8)
On the Spectra of Certain Classes of Room Frames (1994) (8)
Block-avoiding point sequencings of directed triple systems (2019) (7)
Nonsequenceable Steiner triple systems (2019) (7)
Multicollision Attacks on a Class of Hash Functions (2004) (7)
Nonincident points and blocks in designs (2013) (7)
A new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs (2013) (7)
Perfect hash families from transversal designs (2007) (7)
Putting Dots in Triangles (2009) (7)
Orthogonal Arrays of Strength Three from Regular 3-Wise Balanced Designs (2002) (7)
On encoding symbol degrees of array BP-XOR codes (2015) (7)
New results on modular Golomb rulers, optical orthogonal codes and related structures (2020) (6)
Some Designs Used in Constructing Skew Room Squares (1980) (6)
On the existence of certain SOLS with Holes (1994) (6)
Advances in Cryptology - CRYPTO '90, 10th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1990, Proceedings (1991) (6)
New Bounds for Generalized Separating Hash Families (2007) (6)
Pseudo-random Number Generation (2005) (6)
Linear approaches to resilient aggregation in sensor networks (2015) (6)
More Thwarts in Transversal Designs (1996) (6)
Block-avoiding point sequencings of arbitrary length in Steiner triple systems (2019) (6)
Tree-Based Key Distribution Patterns (2005) (6)
Generalized mix functions and orthogonal equitable rectangles (2007) (6)
Constructions and bounds for (m, t)-splitting systems (2007) (6)
Applications of Orthogonal Arrays to Computer Science (2006) (6)
An even side analogue of Room squares (1984) (6)
Small embeddings for partial cycle systems of odd length (1990) (6)
Fault-tolerant routings with minimum optical index (2006) (6)
A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks (2009) (5)
Honeycomb Arrays (2009) (5)
Block-avoiding point sequencings of Mendelsohn triple systems (2019) (5)
Attack on a concast signature scheme (2004) (5)
Problem 26 (1982) (5)
Anonymity in shared symmetric key primitives (2010) (5)
How To Ensure Forward and Backward Untraceability of RFID Identification Schemes By Using A Robust PRBG (2008) (5)
Room squares and subsquares (1983) (5)
Pairwise balanced designs with odd block sizes exceeding five (1990) (5)
Winning the Lottery (1996) (5)
Cryptography (Discrete Mathematics and Its Applications) (2005) (5)
Mathematics for Cryptography (2016) (5)
A survey and refinement of repairable threshold schemes (2018) (5)
On message recognition protocols: recoverability and explicit confirmation (2010) (5)
On security properties of all-or-nothing transforms (2021) (5)
Constructions for retransmission permutation arrays (2012) (4)
Localised multisecret sharing (2017) (4)
A Zero-Knowledge Identification and Key Agreement Protocol (2007) (4)
On the number of blocks in a perfect covering of upsilon points (1990) (4)
Steiner Triple Systems of Order 19 Contain a Subsystem of Order 9 By (2010) (4)
A skew room square of order 129 (1991) (4)
VISUAL CRYPTOGRAPHY& THRESHOLD SCHEMES (1998) (4)
On resolvable Golomb rulers, symmetric configurations and progressive dinner parties (2020) (4)
Backtracking Algorithms (2020) (4)
A New Family of Gold-like Sequen (2002) (4)
Selected Areas in Cryptography 7th International Workshop, SAC 2010, Revised Selected Papers (2011) (3)
An efficient identification protocol secure against concurrent-reset attacks (2009) (3)
Some Observations on All-Or-Nothing Transforms (1998) (3)
On the maximum number of fixed points in automorphisms of prime order of 2-(v,k,1) designs (1997) (3)
Hash families: recursive constructions and applications to cryptography (1996) (3)
On orthogonal generalized equitable rectangles (2009) (3)
Dealer-Free Threshold Changeability in Secret Sharing Schemes (2009) (3)
On the equivalence of authentication codes and robust (2, 2)-threshold schemes (2019) (3)
Designing progressive dinner parties (2020) (3)
Fault‐tolerant routings with minimum optical index (2006) (3)
Room squares with holes of sides 3, 5, and 7 (1983) (2)
Pair-packings and projective planes (1984) (2)
Orthogonal and strong frame starters, revisited (2022) (2)
The construction of nested cycle systems (1990) (2)
Unconditionally secure chaffing and winnowing with short authentication tags (2007) (2)
Authorship Proof for Textual Document (2008) (2)
Graphs Which are not Leaves of Maximal Partial Triple Systems (1987) (2)
Secrecy and Authentication Codes (2006) (2)
Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes (2021) (2)
A few more balanced Room squares (1985) (2)
A Few More Room Frames (2017) (2)
A tight bound on the size of certain separating hash families (2015) (2)
Comments on a sensor network key redistribution technique of Cichon, Golebiewski and Kutylowski (2011) (2)
Public-Key Cryptography and Discrete Logarithms (2005) (2)
A Problem Concerning Nonincident Points and Lines in Projective Planes (2011) (2)
Solution of an Optimization Problem Arising in the Analysis of Combinatorial Key Predistribution Schemes for Sensor Networks (2016) (2)
A Critical Analysis and Improvement of AACS Drive-Host Authentication (2008) (2)
Cryptanalysis of the Sakazaki-Okamoto-Mambo ID-based Key Distribution System over Elliptic Curves (2001) (2)
Recognition in Ad Hoc Pervasive Networks (2008) (2)
Bounds for orthogonal arrays with repeated rows (2018) (2)
A Network Reliability Approach to the Analysis of Combinatorial Repairable Threshold Schemes (2018) (2)
Asymmetric All-or-nothing Transforms (2021) (2)
Packing Costas Arrays (2011) (2)
Nesting directed cycle systems of even length (1992) (2)
An analysis and critique of the scoring method used for sport climbing at the 2020 Tokyo Olympics (2021) (2)
On partial parallel classes in partial Steiner triple systems (2020) (2)
Eecient Metering Schemes with Pricing (2000) (2)
Good sequencings for small directed triple systems (2019) (2)
Is extracting data the same as possessing data? (2013) (2)
Constructions of optimal orthogonal arrays with repeated rows (2018) (2)
A Short Proof of the Non-existence of Certain Cryptographic Functions (1997) (2)
Evaluation of Security Level of Cryptography: ESIGN Identification Scheme (2001) (1)
Concerning the spectrum of perpendicular arrays of triple systems (1986) (1)
CORR 2000-49 New approaches to designing public key cryptosystems using one-way functions and trapdoors in nite groups (2000) (1)
Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography (2000) (1)
Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs (2014) (1)
Key Preassigned Traceability Schemes for Broadcast Encryption (extended Abstract) (1998) (1)
Hash Functions and Message Authentication (2018) (1)
On the maximum number of different ordered pairs of symbols in sets of latin squares (2005) (1)
Divide-and-Conquer Algorithms (2021) (1)
On Symmetric Designs and Binary 3-Frameproof Codes (2015) (1)
A unified approach to combinatorial key predistribution schemes for sensor networks (2012) (1)
Combinatorial Algorithms (2020) (1)
Signature Schemes (2018) (1)
Threshold and Ramp Schemes (2006) (1)
Some results on query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval protocols (2007) (1)
A Problem Concerning Nonincident Points and Blocks in Steiner Triple Systems (2011) (1)
Designs constructed from maximal arcs (1991) (1)
Looking Back - My Life as a Mathematician and Cryptographer (2019) (1)
Hiding Medical Information of Patient through Image by Recursive Visual Cryptography (2017) (1)
Proceedings of the 13th annual international cryptology conference on Advances in cryptology (1993) (1)
On nonisomorphic Room squares (1983) (1)
C O ] 1 3 M ar 2 01 8 A polynomial ideal associated to any t-( v , k , λ ) design ∗ (2018) (1)
Other Combinatorial Designs (2006) (1)
Good sequencings for small Mendelsohn triple systems (2019) (1)
Identification Schemes and Entity Authentication (2005) (0)
Data Structures (2021) (0)
Introduction to Cryptography (2018) (0)
Classical Cryptography (2018) (0)
Bounds for resilient functions and orthogonalarraysExtended (1994) (0)
Greedy Algorithms (2021) (0)
Combinatorial repairability for threshold schemes (2017) (0)
The RSA Cryptosystem and Factoring Integers (2005) (0)
Combinatorial Aspects of Key Distribution for Sensor Networks (2013) (0)
CORR 99-57 Threshold Visual Cryptography Schemes with Speci ed Whiteness Levels of Reconstructed Pixels (2000) (0)
A Parallelization of Miller's n^log n Isomorphism Technique (1992) (0)
A brief retrospective look at the Cayley-Purser public-key cryptosystem, 19 years later (2018) (0)
On tight bounds for binary frameproof codes (2015) (0)
Constructions and bounds for codes with restricted overlaps (2022) (0)
Key Distribution (2018) (0)
Some new results on skew frame starters in cyclic groups (2022) (0)
EMBEDDING CYCLE SYSTEMS OF BVEN LENGTH (2018) (0)
Dispersed graph labellings (2023) (0)
A coding theory foundation for (2012) (0)
Constructions for retransmission permutation arrays (2012) (0)
Block Ciphers and Stream Ciphers (2018) (0)
Research ProblemProblem 26 : Posed by D.R. Stinson (1982) (0)
A critical analysis and improvement of advanced access content system drive-host authentication (2009) (0)
.2 Two-point Based Sampling (0)
Douglas R Stinson Cryptography Theory And Practice Third Edition Chapman Hall Crc 2006 (2020) (0)
MOL ! SWITHH (2001) (0)
A New Family of Gold-like Sequences (Extended Abstract) (2002) (0)
Localised multisecret sharing (2016) (0)
Constructions and Bounds for Unconditionally Secure Commitment Schemes (2000) (0)
Introduction and Mathematical Background (2021) (0)
On maximum parallel classes in packings (2022) (0)
Generating Elementary Combinatorial Objects (2020) (0)
Techniques for Designing and Analyzing Algorithms (2021) (0)
Near-self-complementary designs and a method of mixed sums (1978) (0)
An optimization problem for combinatorial key predistribution (2015) (0)
Structures and Algorithms (2020) (0)
Basis Reduction (2020) (0)
VARIG'S NEW ORDER / (1994) (0)
Block Ciphers and the Advanced Encryption Standard (2005) (0)
Shannon’s Theory, Perfect Secrecy, and the One-Time Pad (2018) (0)
More Topics in Combinatorial Generation (2020) (0)
A Singular Direct Product for Bicolorable Steiner Triple Systems (2010) (0)
ElGamal Based Signature Scheme (2010) (0)
A simple combinatorial treatment of constructions and threshold gaps of ramp schemes (2013) (0)
CORR 2000-18 dynamic Multi-Threshold Metering Schemes (2000) (0)
Public-key Infrastructure (2005) (0)
Optimal Ramp Schemes and Related Combinatorial Objects (2017) (0)
CORR 2000-06 EÆcient Metering Schemes with Pricing (2000) (0)
C O ] 5 S ep 2 01 6 Combinatorial Repairability for Threshold Schemes ∗ (2018) (0)
In the Frame (2022) (0)
Algorithm Analysis and Reductions (2021) (0)
Combinatorial solutions providing improved security for the generalized Russian cards problem (2012) (0)
Combinatorial Designs and Cryptography, Revisited (2019) (0)
On the complexity of the herding attack and some related attacks on hash functions (2011) (0)
Rectangular, Range, and Restricted AONTs: Three Generalizations of All-or-Nothing Transforms (2021) (0)
Secret Sharing Schemes (2005) (0)
Computing Isomorphism (2020) (0)
Proceedings of the 17th international conference on Selected areas in cryptography (2010) (0)
CORR 2001-12 Frameproof and IPP Codes (2001) (0)
An Era of Stability and Economic Growth Leads to a Boom in Peruvian Higher Education. (1996) (0)
Miscellaneous Topics (2018) (0)
Preface: In Honour of Ronald C. Mullin (2002) (0)
Groups and Symmetry (2020) (0)
On encoding symbol degrees of array BP-XOR codes (2015) (0)
Heuristic Search (2020) (0)
Extended results on privacy against coalitions of users in user-private information retrieval protocols (2015) (0)
Correlation-immune and Resilient Functions (2006) (0)
Key Agreement Schemes (2005) (0)
Dynamic Programming Algorithms (2021) (0)
On resolvable Golomb rulers, symmetric configurations and progressive dinner parties (2021) (0)
Intractability and Undecidability (2021) (0)
Sequen es with Low Cross (2007) (0)
Some bounds arising from a polynomial ideal associated to any $t$-design (2020) (0)
CONCERNING THE SPECTRUM OF PERPENDICULAR A R R A Y S OF TRIPLE SYSTEMS (2002) (0)
Dealer-Free Dynamic Secret Sharing Schemes with Unconditional Security (2009) (0)
Post-Quantum Cryptography (2018) (0)
Guest Editorial: Special Issue in Honor of Scott A. Vanstone (2015) (0)
Cryptographic Hash Functions (2005) (0)

This paper list is powered by the following services:

Other Resources About Doug Stinson

en.wikipedia.org

What Schools Are Affiliated With Doug Stinson?

Doug Stinson is affiliated with the following schools:

Image Attributions

Image Source for Doug Stinson