Name
Papers
Collaborators
DOUGLAS R. STINSON
156
97
Citations 
PageRank 
Referers 
2387
274.83
3265
Referees 
References 
1257
1297
Search Limit
1001000
Title
Citations
PageRank
Year
Rectangular, Range, and Restricted AONTs: Three Generalizations of All-or-Nothing Transforms.00.342021
Block-avoiding point sequencings of directed triple systems10.402020
Block-avoiding point sequencings of arbitrary length in Steiner triple systems00.342020
Bounds for orthogonal arrays with repeated rows.00.342019
Nonsequenceable Steiner triple systems00.342019
On The Equivalence Of Authentication Codes And Robust (2, 2)-Threshold Schemes10.372019
Multi-prover proof of retrievability.10.352018
Ideal ramp schemes and related combinatorial objects.00.342018
A Network Reliability Approach to the Analysis of Combinatorial Repairable Threshold Schemes.00.342018
A Brief Retrospective Look at the Cayley-Purser Public-key Cryptosystem, 19 Years Later.00.342018
Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets.00.342017
Optimal Ramp Schemes and Related Combinatorial Objects.00.342017
Localised Multisecret Sharing.00.342017
Computational results on invertible matrices with the maximum number of invertible 2×2 submatrices.00.342017
A survey and refinement of repairable threshold schemes.00.342017
Multi-prover Proof-of-Retrievability.10.352016
Sequential Secret Sharing as a New Hierarchical Access Structure.10.362015
Extended results on privacy against coalitions of users in user-private information retrieval protocols10.412015
Linear approaches to resilient aggregation in sensor networks.20.372015
Combinatorial Characterizations of Algebraic Manipulation Detection Codes Involving Generalized Difference Families70.782015
Guest Editorial: Special Issue in Honor of Scott A. Vanstone00.342015
A tight bound on the size of certain separating hash families10.372015
Resilient Aggregation in Simple Linear Sensor Networks.00.342014
Efficient Sealed-Bid Auction Protocols Using Verifiable Secret Sharing70.482014
A new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs.10.362014
Is Extracting Data The Same As Possessing Data?00.342013
Practical approaches to varying network size in combinatorial key predistribution schemes.10.352013
On dealer-free dynamic threshold schemes.60.532013
Constructions for retransmission permutation arrays00.342012
A simple combinatorial treatment of constructions and threshold gaps of ramp schemes30.442012
Social secret sharing in cloud computing using a new trust function80.592012
Socio-Rational Secret Sharing as a New Direction in Rational Cryptography.50.402012
Privacy Analysis of Forward and Backward Untraceable RFID Authentication Schemes140.702011
Unconditionally secure signature schemes revisited80.742011
Comments on a sensor network key redistribution technique of Cichon, Golebiewski and Kutylowski.00.342011
Honeycomb arrays00.342010
Practical unconditionally secure two-channel message authentication50.472010
Brief announcement: secret sharing based on the social behaviors of players30.382010
Dealer-Free Dynamic Secret Sharing Schemes with Unconditional Security.00.342009
The effectiveness of receipt-based attacks on ThreeBallot120.692009
A Highly Scalable RFID Authentication Protocol50.442009
Anonymity in Shared Symmetric Key Primitives.20.582009
Unconditionally secure social secret sharing scheme211.172009
A critical analysis and improvement of advanced access content system drive-host authentication00.342009
A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks30.382009
Group testing and batch verification140.632009
Two Attacks On A Sensor Network Key Distribution Scheme Of Cheng And Agrawal70.522008
How To Ensure Forward and Backward Untraceability of RFID Identification Schemes By Using A Robust PRBG.00.342008
A Critical Analysis and Improvement of AACS Drive-Host Authentication10.382008
Combinatorial Designs: Constructions and Analysis726.002008
  • 1
  • 2