default search action
Douglas Robert Stinson
Douglas R. Stinson
Person information
- affiliation: University of Waterloo, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j193]William J. Martin, Douglas R. Stinson:
Dispersed graph labellings. Australas. J Comb. 88: 109-126 (2024) - [j192]Navid Nasr Esfahani, Douglas R. Stinson:
Rectangular, range, and restricted AONTs: Three generalizations of all-or-nothing transforms. Adv. Math. Commun. 18(1): 26-38 (2024) - [j191]Shannon Veitch, Douglas R. Stinson:
Unconditionally secure non-malleable secret sharing and circular external difference families. Des. Codes Cryptogr. 92(4): 941-956 (2024) - [j190]Joanne Hall, Daniel Horsley, Douglas R. Stinson:
Bounds on data limits for all-to-all comparison from combinatorial designs. Des. Codes Cryptogr. 92(10): 2863-2879 (2024) - [j189]Maura B. Paterson, Douglas R. Stinson:
Circular external difference families, graceful labellings and cyclotomy. Discret. Math. 347(10): 114103 (2024) - [j188]Simon R. Blackburn, Navid Nasr Esfahani, Donald L. Kreher, Douglas R. Stinson:
Constructions and Bounds for Codes With Restricted Overlaps. IEEE Trans. Inf. Theory 70(4): 2479-2490 (2024) - 2023
- [j187]Maura B. Paterson, Douglas R. Stinson:
Splitting authentication codes with perfect secrecy: New results, constructions and connections with algebraic manipulation detection codes. Adv. Math. Commun. 17(6): 1364-1387 (2023) - [j186]Douglas R. Stinson:
Some new results on skew frame starters in cyclic groups. Discret. Math. 346(8): 113476 (2023) - [i83]Shannon Veitch, Douglas R. Stinson:
Unconditionally Secure Non-malleable Secret Sharing and Circular External Difference Families. CoRR abs/2305.09405 (2023) - [i82]Maura B. Paterson, Douglas R. Stinson:
Circular external difference families, graceful labellings and cyclotomy. CoRR abs/2310.02810 (2023) - 2022
- [j185]Michela J. Stinson, Douglas R. Stinson:
An analysis and critique of the scoring method used for sport climbing at the 2020 Tokyo Olympics. Bull. ICA 94: 13-34 (2022) - [i81]Simon R. Blackburn, Navid Nasr Esfahani, Donald L. Kreher, Douglas R. Stinson:
Constructions and bounds for codes with restricted overlaps. CoRR abs/2211.10309 (2022) - 2021
- [j184]Marco Buratti, Douglas Robert Stinson:
New results on modular Golomb rulers, optical orthogonal codes and related structures. Ars Math. Contemp. 20(1): 1-27 (2021) - [j183]Douglas R. Stinson:
A die problem. Bull. ICA 92: 109-113 (2021) - [j182]Navid Nasr Esfahani, Douglas R. Stinson:
On security properties of all-or-nothing transforms. Des. Codes Cryptogr. 89(12): 2857-2867 (2021) - [j181]Douglas R. Stinson:
On partial parallel classes in partial Steiner triple systems. Discret. Math. 344(4): 112279 (2021) - [j180]Maura B. Paterson, Douglas R. Stinson:
On the equivalence of authentication codes and robust (2, 2)-threshold schemes. J. Math. Cryptol. 15(1): 179-196 (2021) - [i80]Maura B. Paterson, Douglas R. Stinson:
Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes. CoRR abs/2104.11076 (2021) - [i79]Navid Nasr Esfahani, Douglas R. Stinson:
Asymmetric All-or-nothing Transforms. CoRR abs/2105.14988 (2021) - [i78]Navid Nasr Esfahani, Douglas R. Stinson:
Rectangular, Range, and Restricted AONTs: Three Generalizations of All-or-Nothing Transforms. CoRR abs/2111.05961 (2021) - [i77]Navid Nasr Esfahani, Douglas R. Stinson:
On Security Properties of All-or-nothing Transforms. IACR Cryptol. ePrint Arch. 2021: 314 (2021) - [i76]Maura B. Paterson, Douglas R. Stinson:
Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes. IACR Cryptol. ePrint Arch. 2021: 534 (2021) - [i75]Navid Nasr Esfahani, Douglas R. Stinson:
Asymmetric All-or-nothing Transforms. IACR Cryptol. ePrint Arch. 2021: 726 (2021) - [i74]Navid Nasr Esfahani, Douglas R. Stinson:
Rectangular, Range, and Restricted AONTs: Three Generalizations of All-or-Nothing Transforms. IACR Cryptol. ePrint Arch. 2021: 1498 (2021) - 2020
- [j179]Douglas R. Stinson, Shannon Veitch:
Block-avoiding point sequencings of arbitrary length in Steiner triple systems. Australas. J Comb. 77: 87-99 (2020) - [j178]Douglas R. Stinson:
Designing progressive dinner parties. Bull. ICA 89: 93-101 (2020) - [j177]Donald L. Kreher, Douglas R. Stinson, Shannon Veitch:
Block-avoiding point sequencings of directed triple systems. Discret. Math. 343(4): 111773 (2020) - [j176]Donald L. Kreher, Douglas R. Stinson, Shannon Veitch:
Block-avoiding point sequencings of Mendelsohn triple systems. Discret. Math. 343(5): 111799 (2020)
2010 – 2019
- 2019
- [j175]Donald L. Kreher, Douglas R. Stinson:
Block-avoiding sequencings of points in Steiner triple systems. Australas. J Comb. 74: 498-509 (2019) - [j174]Bailey Kacsmar, Douglas R. Stinson:
A network reliability approach to the analysis of combinatorial repairable threshold schemes. Adv. Math. Commun. 13(4): 601-612 (2019) - [j173]Douglas R. Stinson:
Bounds for orthogonal arrays with repeated rows. Bull. ICA 85: 60-73 (2019) - [j172]Donald L. Kreher, Douglas R. Stinson:
Nonsequenceable Steiner triple systems. Bull. ICA 86: 64-68 (2019) - [j171]Charles J. Colbourn, Douglas R. Stinson, Shannon Veitch:
Constructions of optimal orthogonal arrays with repeated rows. Discret. Math. 342(9): 2455-2466 (2019) - [c48]Douglas R. Stinson:
Looking Back - My Life as a Mathematician and Cryptographer. SAC 2019: 3-20 - [i73]Douglas R. Stinson, Shannon Veitch:
Block-avoiding point sequencings of arbitrary length in Steiner triple systems. CoRR abs/1907.04416 (2019) - [i72]Maura B. Paterson, Douglas R. Stinson:
On the equivalence of authentication codes and robust (2, 2)-threshold schemes. CoRR abs/1910.05572 (2019) - [i71]Maura B. Paterson, Douglas R. Stinson:
On the equivalence of authentication codes and robust (2, 2)-threshold schemes. IACR Cryptol. ePrint Arch. 2019: 1191 (2019) - 2018
- [j170]Douglas R. Stinson:
A brief retrospective look at the Cayley-Purser public-key cryptosystem, 19 years later. Bull. ICA 83: 84-97 (2018) - [j169]Douglas R. Stinson, Ruizhong Wei:
Combinatorial repairability for threshold schemes. Des. Codes Cryptogr. 86(1): 195-210 (2018) - [j168]Douglas R. Stinson:
Ideal ramp schemes and related combinatorial objects. Discret. Math. 341(2): 299-307 (2018) - [j167]Thalia M. Laing, Douglas R. Stinson:
A survey and refinement of repairable threshold schemes. J. Math. Cryptol. 12(1): 57-81 (2018) - [j166]Maura B. Paterson, Douglas R. Stinson, Jalaj Upadhyay:
Multi-prover proof of retrievability. J. Math. Cryptol. 12(4): 203-220 (2018) - [j165]Navid Nasr Esfahani, Ian Goldberg, Douglas R. Stinson:
Some Results on the Existence of t-All-or-Nothing Transforms Over Arbitrary Alphabets. IEEE Trans. Inf. Theory 64(4): 3136-3143 (2018) - [i70]Douglas R. Stinson:
A Brief Retrospective Look at the Cayley-Purser Public-key Cryptosystem, 19 Years Later. CoRR abs/1803.05004 (2018) - [i69]Bailey Kacsmar, Douglas R. Stinson:
A Network Reliability Approach to the Analysis of Combinatorial Repairable Threshold Schemes. CoRR abs/1811.01766 (2018) - [i68]Douglas R. Stinson:
A Brief Retrospective Look at the Cayley-Purser Public-key Cryptosystem, 19 Years Later. IACR Cryptol. ePrint Arch. 2018: 270 (2018) - 2017
- [j164]Chuan Guo, Douglas R. Stinson:
A tight bound on the size of certain separating hash families. Australas. J Comb. 67: 294-303 (2017) - [j163]Navid Nasr Esfahani, Douglas R. Stinson:
Computational results on invertible matrices with the maximum number of invertible 2×2 submatrices. Australas. J Comb. 69: 130-144 (2017) - [j162]William J. Martin, Douglas R. Stinson:
Some Nonexistence Results for Strong External Difference Families using Character Theory. Bull. ICA 80: 79-92 (2017) - [j161]Thalia M. Laing, Keith M. Martin, Maura B. Paterson, Douglas R. Stinson:
Localised multisecret sharing. Cryptogr. Commun. 9(5): 581-597 (2017) - [i67]Navid Nasr Esfahani, Ian Goldberg, Douglas R. Stinson:
Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets. CoRR abs/1702.06612 (2017) - [i66]Douglas R. Stinson:
Optimal Ramp Schemes and Related Combinatorial Objects. CoRR abs/1705.06247 (2017) - [i65]Navid Nasr Esfahani, Ian Goldberg, Douglas R. Stinson:
Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets. IACR Cryptol. ePrint Arch. 2017: 177 (2017) - [i64]Douglas R. Stinson:
Optimal Ramp Schemes and Related Combinatorial Objects. IACR Cryptol. ePrint Arch. 2017: 428 (2017) - [i63]Thalia M. Laing, Douglas R. Stinson:
A Survey and Refinement of Repairable Threshold Schemes. IACR Cryptol. ePrint Arch. 2017: 1155 (2017) - 2016
- [j160]Maura B. Paterson, Douglas R. Stinson, Yongge Wang:
On encoding symbol degrees of array BP-XOR codes. Cryptogr. Commun. 8(1): 19-32 (2016) - [j159]Paolo D'Arco, Navid Nasr Esfahani, Douglas R. Stinson:
All or Nothing at All. Electron. J. Comb. 23(4): 4 (2016) - [j158]Maura B. Paterson, Douglas R. Stinson:
Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families. Discret. Math. 339(12): 2891-2906 (2016) - [j157]Colleen M. Swanson, Douglas R. Stinson:
Unconditionally secure signature schemes revisited. J. Math. Cryptol. 10(1): 35-67 (2016) - [i62]Maura B. Paterson, Douglas R. Stinson, Jalaj Upadhyay:
Multi-prover Proof-of-Retrievability. CoRR abs/1603.02671 (2016) - [i61]Douglas R. Stinson, Ruizhong Wei:
Combinatorial Repairability for Threshold Schemes. CoRR abs/1609.01240 (2016) - [i60]Maura B. Paterson, Douglas R. Stinson, Jalaj Upadhyay:
Multi-prover Proof-of-Retrievability. IACR Cryptol. ePrint Arch. 2016: 265 (2016) - [i59]Douglas R. Stinson, Ruizhong Wei:
Combinatorial Repairability for Threshold Schemes. IACR Cryptol. ePrint Arch. 2016: 855 (2016) - 2015
- [j156]Colleen M. Swanson, Douglas R. Stinson:
Extended results on privacy against coalitions of users in user-private information retrieval protocols. Cryptogr. Commun. 7(4): 415-437 (2015) - [j155]Ian F. Blake, Alfred Menezes, Douglas R. Stinson:
Guest Editorial: Special Issue in Honor of Scott A. Vanstone. Des. Codes Cryptogr. 77(2-3): 287-299 (2015) - [j154]Chuan Guo, Douglas R. Stinson, Tran van Trung:
On tight bounds for binary frameproof codes. Des. Codes Cryptogr. 77(2-3): 301-319 (2015) - [j153]Mehrdad Nojoumian, Douglas R. Stinson:
Sequential Secret Sharing as a New Hierarchical Access Structure. J. Internet Serv. Inf. Secur. 5(2): 24-32 (2015) - [j152]Maura B. Paterson, Douglas R. Stinson:
Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs. J. Math. Cryptol. 9(4): 215-225 (2015) - [j151]Kevin J. Henry, Douglas R. Stinson:
Linear approaches to resilient aggregation in sensor networks. J. Math. Cryptol. 9(4): 245-272 (2015) - [i58]Maura B. Paterson, Douglas R. Stinson:
Combinatorial Characterizations of Algebraic Manipulation Detection Codes Involving Generalized Difference Families. CoRR abs/1506.02711 (2015) - [i57]Chuan Guo, Douglas R. Stinson:
A tight bound on the size of certain separating hash families. CoRR abs/1510.00293 (2015) - [i56]Paolo D'Arco, Navid Nasr Esfahani, Douglas R. Stinson:
All or Nothing at All. CoRR abs/1510.03655 (2015) - [i55]Mehrdad Nojoumian, Douglas R. Stinson:
Sequential Secret Sharing as a New Hierarchical Access Structure. IACR Cryptol. ePrint Arch. 2015: 403 (2015) - [i54]Thalia M. Laing, Keith M. Martin, Maura B. Paterson, Douglas R. Stinson:
Localised Multisecret Sharing. IACR Cryptol. ePrint Arch. 2015: 922 (2015) - [i53]Paolo D'Arco, Navid Nasr Esfahani, Douglas R. Stinson:
All or Nothing at All. IACR Cryptol. ePrint Arch. 2015: 998 (2015) - 2014
- [j150]Colleen Swanson, Douglas R. Stinson:
Additional Constructions to Solve the Generalized Russian Cards Problem using Combinatorial Designs. Electron. J. Comb. 21(3): 3 (2014) - [j149]Maura B. Paterson, Douglas R. Stinson:
A unified approach to combinatorial key predistribution schemes for sensor networks. Des. Codes Cryptogr. 71(3): 433-457 (2014) - [j148]Colleen Swanson, Douglas R. Stinson:
Combinatorial solutions providing improved security for the generalized Russian cards problem. Des. Codes Cryptogr. 72(2): 345-367 (2014) - [j147]Douglas R. Stinson, Colleen Swanson, Tran van Trung:
A new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs. Discret. Math. 325: 23-31 (2014) - [j146]Douglas R. Stinson, Jalaj Upadhyay:
Is extracting data the same as possessing data? J. Math. Cryptol. 8(2): 189-207 (2014) - [j145]Michelle Kendall, Keith M. Martin, Siaw-Lynn Ng, Maura B. Paterson, Douglas R. Stinson:
Broadcast-Enhanced Key Predistribution Schemes. ACM Trans. Sens. Networks 11(1): 6:1-6:33 (2014) - [c47]Mehrdad Nojoumian, Douglas R. Stinson:
Efficient Sealed-Bid Auction Protocols Using Verifiable Secret Sharing. ISPEC 2014: 302-317 - [i52]Colleen Swanson, Douglas R. Stinson:
Additional Constructions to Solve the Generalized Russian Cards Problem using Combinatorial Designs. CoRR abs/1401.1526 (2014) - [i51]Maura B. Paterson, Douglas R. Stinson:
Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs. CoRR abs/1403.1468 (2014) - [i50]Chuan Guo, Douglas R. Stinson, Tran van Trung:
On tight bounds for binary frameproof codes. CoRR abs/1406.6920 (2014) - [i49]Maura B. Paterson, Douglas R. Stinson:
Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs. IACR Cryptol. ePrint Arch. 2014: 179 (2014) - [i48]Kevin J. Henry, Douglas R. Stinson:
Resilient Aggregation in Simple Linear Sensor Networks. IACR Cryptol. ePrint Arch. 2014: 288 (2014) - 2013
- [j144]Mehrdad Nojoumian, Douglas R. Stinson:
On dealer-free dynamic threshold schemes. Adv. Math. Commun. 7(1): 39-56 (2013) - [j143]Maura B. Paterson, Douglas R. Stinson:
A simple combinatorial treatment of constructions and threshold gaps of ramp schemes. Cryptogr. Commun. 5(4): 229-240 (2013) - [j142]Douglas R. Stinson:
Nonincident points and blocks in designs. Discret. Math. 313(4): 447-452 (2013) - [j141]Maura B. Paterson, Douglas R. Stinson, Jalaj Upadhyay:
A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage. J. Math. Cryptol. 7(3): 183-216 (2013) - [c46]Kevin J. Henry, Maura B. Paterson, Douglas R. Stinson:
Practical Approaches to Varying Network Size in Combinatorial Key Predistribution Schemes. Selected Areas in Cryptography 2013: 89-117 - [i47]Kevin J. Henry, Maura B. Paterson, Douglas R. Stinson:
Practical approaches to varying network size in combinatorial key predistribution schemes. IACR Cryptol. ePrint Arch. 2013: 558 (2013) - [i46]Douglas R. Stinson, Jalaj Upadhyay:
Is extracting data the same as possessing data? IACR Cryptol. ePrint Arch. 2013: 614 (2013) - 2012
- [j140]Colleen Swanson, Douglas R. Stinson:
Extended combinatorial constructions for peer-to-peer user-private information retrieval. Adv. Math. Commun. 6(4): 479-497 (2012) - [j139]Simon R. Blackburn, Douglas R. Stinson, Jalaj Upadhyay:
On the complexity of the herding attack and some related attacks on hash functions. Des. Codes Cryptogr. 64(1-2): 171-193 (2012) - [j138]Jeffrey H. Dinitz, Maura B. Paterson, Douglas R. Stinson, Ruizhong Wei:
Constructions for retransmission permutation arrays. Des. Codes Cryptogr. 65(3): 325-351 (2012) - [c45]Mehrdad Nojoumian, Douglas R. Stinson:
Socio-Rational Secret Sharing as a New Direction in Rational Cryptography. GameSec 2012: 18-37 - [c44]Mehrdad Nojoumian, Douglas R. Stinson:
Social secret sharing in cloud computing using a new trust function. PST 2012: 161-167 - [i45]Colleen Swanson, Douglas R. Stinson:
Combinatorial Solutions Providing Improved Security for the Generalized Russian Cards Problem. CoRR abs/1207.1336 (2012) - [i44]Maura B. Paterson, Douglas R. Stinson, Jalaj Upadhyay:
A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage. CoRR abs/1210.7756 (2012) - [i43]Michelle Kendall, Keith M. Martin, Siaw-Lynn Ng, Maura B. Paterson, Douglas R. Stinson:
Broadcast-enhanced Key Predistribution Schemes. IACR Cryptol. ePrint Arch. 2012: 295 (2012) - [i42]Colleen Swanson, Douglas R. Stinson:
Combinatorial Solutions Providing Improved Security for the Generalized Russian Cards Problem. IACR Cryptol. ePrint Arch. 2012: 376 (2012) - [i41]Maura B. Paterson, Douglas R. Stinson:
A Simplified Combinatorial Treatment of Constructions and Threshold Gaps of Ramp Schemes. IACR Cryptol. ePrint Arch. 2012: 534 (2012) - [i40]Maura B. Paterson, Douglas R. Stinson, Jalaj Upadhyay:
A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage. IACR Cryptol. ePrint Arch. 2012: 611 (2012) - 2011
- [j137]Gregory M. Zaverucha, Douglas R. Stinson:
Short one-time signatures. Adv. Math. Commun. 5(3): 473-488 (2011) - [j136]Keith M. Martin, Maura B. Paterson, Douglas R. Stinson:
Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures. Cryptogr. Commun. 3(2): 65-86 (2011) - [j135]Jiang Wu, Douglas R. Stinson:
Three Improved Algorithms for Multipath Key Establishment in Sensor Networks Using Protocols for Secure Message Transmission. IEEE Trans. Dependable Secur. Comput. 8(6): 929-937 (2011) - [j134]Raphael C.-W. Phan, Jiang Wu, Khaled Ouafi, Douglas R. Stinson:
Privacy Analysis of Forward and Backward Untraceable RFID Authentication Schemes. Wirel. Pers. Commun. 61(1): 69-81 (2011) - [c43]Colleen Swanson, Douglas R. Stinson:
Unconditionally Secure Signature Schemes Revisited. ICITS 2011: 100-116 - [e3]Alex Biryukov, Guang Gong, Douglas R. Stinson:
Selected Areas in Cryptography - 17th International Workshop, SAC 2010, Waterloo, Ontario, Canada, August 12-13, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6544, Springer 2011, ISBN 978-3-642-19573-0 [contents] - [i39]Colleen Swanson, Douglas R. Stinson:
Extended Combinatorial Constructions for Peer-to-peer User-Private Information Retrieva. CoRR abs/1112.2762 (2011) - [i38]Maura B. Paterson, Douglas R. Stinson:
A Unified Approach to Combinatorial Key Predistribution Schemes for Sensor Networks. IACR Cryptol. ePrint Arch. 2011: 76 (2011) - [i37]Colleen Swanson, Douglas R. Stinson:
Unconditionally Secure Signature Schemes Revisited. IACR Cryptol. ePrint Arch. 2011: 104 (2011) - [i36]Douglas R. Stinson:
Comments on a sensor network key redistribution technique of Cichon, Golebiewski and Kutylowski. IACR Cryptol. ePrint Arch. 2011: 259 (2011) - [i35]Colleen Swanson, Douglas R. Stinson:
Extended Combinatorial Constructions for Peer-to-peer User-Private Information Retrieval. IACR Cryptol. ePrint Arch. 2011: 674 (2011) - 2010
- [j133]Simon R. Blackburn, Anastasia Panoui, Maura B. Paterson, Douglas R. Stinson:
Honeycomb Arrays. Electron. J. Comb. 17(1) (2010) - [j132]Maura B. Paterson, Douglas R. Stinson:
Yet Another Hat Game. Electron. J. Comb. 17(1) (2010) - [j131]Atefeh Mashatan, Douglas R. Stinson:
Practical unconditionally secure two-channel message authentication. Des. Codes Cryptogr. 55(2-3): 169-188 (2010) - [j130]Gregory M. Zaverucha, Douglas R. Stinson:
Anonymity in shared symmetric key primitives. Des. Codes Cryptogr. 57(2): 139-160 (2010) - [j129]Mehrdad Nojoumian, Douglas R. Stinson, Morgan Grainger:
Unconditionally secure social secret sharing scheme. IET Inf. Secur. 4(4): 202-211 (2010) - [j128]Ian Goldberg,