default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDouglas 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
- 2025
[j194]Douglas R. Stinson:
Weak and strong nestings of BIBDs. Australas. J Comb. 91: 148-176 (2025)- 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, Atefeh Mashatan, Douglas R. Stinson:
On message recognition protocols: recoverability and explicit confirmation. Int. J. Appl. Cryptogr. 2(2): 100-120 (2010) - [j127]Keith M. Martin, Maura B. Paterson, Douglas R. Stinson:
Key predistribution for homogeneous wireless sensor networks with group deployment of nodes. ACM Trans. Sens. Networks 7(2): 11:1-11:27 (2010) - [c42]Mehrdad Nojoumian, Douglas R. Stinson:
Unconditionally Secure First-Price Auction Protocols Using a Multicomponent Commitment Scheme. ICICS 2010: 266-280 - [c41]Mehrdad Nojoumian, Douglas R. Stinson:
Brief announcement: secret sharing based on the social behaviors of players. PODC 2010: 239-240 - [i34]Simon R. Blackburn, Douglas R. Stinson, Jalaj Upadhyay:
On the Complexity of the Herding Attack and Some Related Attacks on Hash Functions. IACR Cryptol. ePrint Arch. 2010: 30 (2010) - [i33]Gregory M. Zaverucha, Douglas R. Stinson:
Short One-Time Signatures. IACR Cryptol. ePrint Arch. 2010: 446 (2010)
2000 – 2009
- 2009
- [j126]Maura B. Paterson, Douglas R. Stinson, Ruizhong Wei:
Combinatorial batch codes. Adv. Math. Commun. 3(1): 13-27 (2009) - [j125]Haitao Cao, Jeffrey H. Dinitz, Donald L. Kreher, Douglas R. Stinson, Ruizhong Wei:
On orthogonal generalized equitable rectangles. Des. Codes Cryptogr. 51(3): 225-230 (2009) - [j124]Jiayuan Sui, Douglas R. Stinson:
A critical analysis and improvement of advanced access content system drive-host authentication. Int. J. Appl. Cryptogr. 1(3): 169-180 (2009) - [j123]Atefeh Mashatan, Douglas R. Stinson:
Interactive two-channel message authentication based on Interactive-Collision Resistant hash functions. Int. J. Inf. Sec. 8(1): 49-60 (2009) - [j122]Jiang Wu, Douglas R. Stinson:
An efficient identification protocol secure against concurrent-reset attacks. J. Math. Cryptol. 3(4): 339-352 (2009) - [j121]Kevin J. Henry, Douglas R. Stinson, Jiayuan Sui:
The effectiveness of receipt-based attacks on ThreeBallot. IEEE Trans. Inf. Forensics Secur. 4(4): 699-707 (2009) - [c40]Jiang Wu, Douglas R. Stinson:
A Highly Scalable RFID Authentication Protocol. ACISP 2009: 360-376 - [c39]Ian Goldberg, Atefeh Mashatan, Douglas R. Stinson:
A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks. ACNS 2009: 219-237 - [c38]Gregory M. Zaverucha, Douglas R. Stinson:
Group Testing and Batch Verification. ICITS 2009: 140-157 - [i32]Simon R. Blackburn, Maura B. Paterson, Douglas R. Stinson:
Putting Dots in Triangles. CoRR abs/0910.4325 (2009) - [i31]Gregory M. Zaverucha, Douglas R. Stinson:
Anonymity in Shared Symmetric Key Primitives. IACR Cryptol. ePrint Arch. 2009: 57 (2009) - [i30]Gregory M. Zaverucha, Douglas R. Stinson:
Group Testing and Batch Verification. IACR Cryptol. ePrint Arch. 2009: 240 (2009) - [i29]Jiang Wu, Douglas R. Stinson:
Three Improved Algorithms for Multi-path Key Establishment in Sensor Networks Using Protocols for Secure Message Transmission. IACR Cryptol. ePrint Arch. 2009: 413 (2009) - [i28]Keith M. Martin, Maura B. Paterson, Douglas R. Stinson:
Error Decodable Secret Sharing and One-Round Perfectly Secure Message Transmission for General Adversary Structures. IACR Cryptol. ePrint Arch. 2009: 487 (2009) - 2008
- [j120]Douglas R. Stinson, Ruizhong Wei, Kejun Chen:
On generalized separating hash families. J. Comb. Theory A 115(1): 105-120 (2008) - [j119]Simon R. Blackburn, Tuvi Etzion, Douglas R. Stinson, Gregory M. Zaverucha:
A bound on the size of separating hash families. J. Comb. Theory A 115(7): 1246-1256 (2008) - [j118]Maura B. Paterson, Douglas R. Stinson:
Two attacks on a sensor network key distribution scheme of Cheng and Agrawal. J. Math. Cryptol. 2(4): 393-403 (2008) - [j117]Douglas R. Stinson:
Combinatorial designs: constructions and analysis. SIGACT News 39(4): 17-21 (2008) - [j116]Jooyoung Lee, Douglas R. Stinson:
On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs. ACM Trans. Inf. Syst. Secur. 11(2): 1:1-1:35 (2008) - [j115]Douglas R. Stinson, Gregory M. Zaverucha:
Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families. IEEE Trans. Inf. Theory 54(6): 2508-2514 (2008) - [c37]Jiayuan Sui, Douglas R. Stinson:
A Critical Analysis and Improvement of AACS Drive-Host Authentication. ACISP 2008: 37-52 - [c36]Atefeh Mashatan, Douglas R. Stinson:
A New Message Recognition Protocol for Ad Hoc Pervasive Networks. CANS 2008: 378-394 - [c35]Simon R. Blackburn, Keith M. Martin, Maura B. Paterson, Douglas R. Stinson:
Key Refreshing in Wireless Sensor Networks. ICITS 2008: 156-170 - [c34]Jiang Wu, Douglas R. Stinson:
Authorship Proof for Textual Document. Information Hiding 2008: 209-223 - [c33]Jiang Wu, Douglas R. Stinson:
Minimum node degree and kappa-connectivity for key predistribution schemes and distributed sensor networks. WISEC 2008: 119-124 - [i27]Jiang Wu, Douglas R. Stinson:
On The Security of The ElGamal Encryption Scheme and Damgard's Variant. IACR Cryptol. ePrint Arch. 2008: 200 (2008) - [i26]Jiang Wu, Douglas R. Stinson:
How To Ensure Forward and Backward Untraceability of RFID Identification Schemes By Using A Robust PRBG. IACR Cryptol. ePrint Arch. 2008: 201 (2008) - [i25]Atefeh Mashatan, Douglas R. Stinson:
Recognition in Ad Hoc Pervasive Networks. IACR Cryptol. ePrint Arch. 2008: 239 (2008) - [i24]Atefeh Mashatan, Douglas R. Stinson:
A New Message Recognition Protocol for Ad Hoc Pervasive Networks. IACR Cryptol. ePrint Arch. 2008: 294 (2008) - [i23]Maura B. Paterson, Douglas R. Stinson, Ruizhong Wei:
Combinatorial batch codes. IACR Cryptol. ePrint Arch. 2008: 306 (2008) - [i22]Maura B. Paterson, Douglas R. Stinson:
Two attacks on a sensor network key distribution scheme of Cheng and Agrawal. IACR Cryptol. ePrint Arch. 2008: 326 (2008) - [i21]Keith M. Martin, Maura B. Paterson, Douglas R. Stinson:
Key Predistribution for Homogeneous Wireless Sensor Networks with Group Deployment of Nodes. IACR Cryptol. ePrint Arch. 2008: 412 (2008) - 2007
- [j114]Jeffrey H. Dinitz, Alan C. H. Ling, Douglas R. Stinson:
Perfect hash families from transversal designs. Australas. J Comb. 37: 233-242 (2007) - [j113]Douglas R. Stinson:
Unconditionally secure chaffing and winnowing with short authentication tags. Adv. Math. Commun. 1(2): 269-280 (2007) - [j112]Douglas R. Stinson:
Generalized mix functions and orthogonal equitable rectangles. Des. Codes Cryptogr. 45(3): 347-357 (2007) - [j111]D. Deng, Douglas R. Stinson, Pak Ching Li, G. H. John van Rees, Ruizhong Wei:
Constructions and bounds for (m, t)-splitting systems. Discret. Math. 307(1): 18-37 (2007) - [j110]Atefeh Mashatan, Douglas R. Stinson:
Non-interactive two-channel message authentication based on hybrid-collision resistant hash functions. IET Inf. Secur. 1(3): 111-118 (2007) - [j109]Douglas R. Stinson, Ruizhong Wei:
Some results on query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval protocols. J. Math. Cryptol. 1(1): 33-46 (2007) - [j108]Douglas R. Stinson, Jiang Wu:
An efficient and secure two-flow zero-knowledge identification protocol. J. Math. Cryptol. 1(3): 201-220 (2007) - [j107]Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Douglas R. Stinson:
On Unconditionally Secure Distributed Oblivious Transfer. J. Cryptol. 20(3): 323-373 (2007) - [j106]Berk Sunar, William J. Martin, Douglas R. Stinson:
A Provably Secure True Random Number Generator with Built-In Tolerance to Active Attacks. IEEE Trans. Computers 56(1): 109-119 (2007) - [j105]Mridul Nandi, Douglas R. Stinson:
Multicollision Attacks on Some Generalized Sequential Hash Functions. IEEE Trans. Inf. Theory 53(2): 759-767 (2007) - [i20]Atefeh Mashatan, Douglas R. Stinson:
Interactive two-channel message authentication based on interactive-collision Resistant hash functions. IACR Cryptol. ePrint Arch. 2007: 12 (2007) - [i19]Jiang Wu, Douglas R. Stinson:
Authorship Proof for Textual Document. IACR Cryptol. ePrint Arch. 2007: 42 (2007) - [i18]Douglas R. Stinson, Jiang Wu:
A Zero-Knowledge Identification and Key Agreement Protocol. IACR Cryptol. ePrint Arch. 2007: 116 (2007) - [i17]Douglas R. Stinson:
Generalized mix functions and orthogonal equitable rectangles. IACR Cryptol. ePrint Arch. 2007: 226 (2007) - [i16]Kevin J. Henry, Douglas R. Stinson, Jiayuan Sui:
The Effectiveness of Receipt-Based Attacks on ThreeBallot. IACR Cryptol. ePrint Arch. 2007: 287 (2007) - [i15]Simon R. Blackburn, Tuvi Etzion, Douglas R. Stinson, Gregory M. Zaverucha:
A Bound on the Size of Separating Hash Families. IACR Cryptol. ePrint Arch. 2007: 304 (2007) - [i14]Jiayuan Sui, Douglas R. Stinson:
A Critical Analysis and Improvement of AACS Drive-Host Authentication. IACR Cryptol. ePrint Arch. 2007: 420 (2007) - [i13]Jiang Wu, Douglas R. Stinson:
An Efficient Identification Protocol and the Knowledge-of-Exponent Assumption. IACR Cryptol. ePrint Arch. 2007: 479 (2007) - 2006
- [j104]James A. Muir, Douglas R. Stinson:
On the low hamming weight discrete logarithm problem for nonadjacent representations. Appl. Algebra Eng. Commun. Comput. 16(6): 461-472 (2006) - [j103]Paolo D'Arco, Wataru Kishimoto, Douglas R. Stinson:
Properties and constraints of cheating-immune secret sharing schemes. Discret. Appl. Math. 154(2): 219-233 (2006) - [j102]Douglas R. Stinson:
Some Observations on the Theory of Cryptographic Hash Functions. Des. Codes Cryptogr. 38(2): 259-277 (2006) - [j101]Khoongming Khoo, Guang Gong, Douglas R. Stinson:
A New Characterization of Semi-bent and Bent Functions on Finite Fields*. Des. Codes Cryptogr. 38(2): 279-295 (2006) - [j100]James A. Muir, Douglas R. Stinson:
Minimality and other properties of the width-w nonadjacent form. Math. Comput. 75(253): 369-384 (2006) - [j99]Jeffrey H. Dinitz, Alan C. H. Ling, Douglas R. Stinson:
Fault-tolerant routings with minimum optical index. Networks 48(1): 47-55 (2006) - [j98]Wakaha Ogata, Kaoru Kurosawa, Douglas R. Stinson:
Optimum Secret Sharing Scheme Secure against Cheating. SIAM J. Discret. Math. 20(1): 79-95 (2006) - [i12]Mridul Nandi, Douglas R. Stinson:
Multicollision Attacks on some Generalized Sequential Hash Functions. IACR Cryptol. ePrint Arch. 2006: 55 (2006) - [i11]Douglas R. Stinson:
Unconditionally secure chaffing and winnowing with short authentication tags. IACR Cryptol. ePrint Arch. 2006: 189 (2006) - [i10]Atefeh Mashatan, Douglas R. Stinson:
Noninteractive two-channel message authentication based on hybrid-collision resistant hash functions. IACR Cryptol. ePrint Arch. 2006: 302 (2006) - [i9]Douglas R. Stinson, Jiang Wu:
An Efficient and Secure Two-flow Zero-Knowledge Identification Protocol. IACR Cryptol. ePrint Arch. 2006: 337 (2006) - 2005
- [j97]Jeffrey H. Dinitz, Peter Dukes, Douglas R. Stinson:
Sequentially Perfect and Uniform One-Factorizations of the Complete Graph. Electron. J. Comb. 12 (2005) - [j96]James A. Muir, Douglas R. Stinson:
Alternative Digit Sets for Nonadjacent Representations. SIAM J. Discret. Math. 19(1): 165-191 (2005) - [c32]James A. Muir, Douglas R. Stinson:
New Minimal Weight Representations for Left-to-Right Window Methods. CT-RSA 2005: 366-383 - [c31]Jooyoung Lee, Douglas R. Stinson:
Tree-Based Key Distribution Patterns. Selected Areas in Cryptography 2005: 189-204 - [c30]Jooyoung Lee, Douglas R. Stinson:
A combinatorial approach to key predistribution for distributed sensor networks. WCNC 2005: 1200-1205 - 2004
- [b2]Douglas R. Stinson:
Combinatorial designs - constructions and analysis. Springer 2004, ISBN 978-0-387-95487-5, pp. I-XVI, 1-300 - [j95]D. Deng, Douglas R. Stinson, Ruizhong Wei:
The Lovász Local Lemma and Its Applications to some Combinatorial Arrays. Des. Codes Cryptogr. 32(1-3): 121-134 (2004) - [j94]Wakaha Ogata, Kaoru Kurosawa, Douglas R. Stinson, Hajime Saido:
New combinatorial designs and their applications to authentication codes and secret sharing schemes. Discret. Math. 279(1-3): 383-405 (2004) - [j93]Douglas R. Stinson, Ruizhong Wei:
Generalized cover-free families. Discret. Math. 279(1-3): 463-477 (2004) - [j92]Douglas R. Stinson:
Attack on a concast signature scheme. Inf. Process. Lett. 91(1): 39-41 (2004) - [c29]Jooyoung Lee, Douglas R. Stinson:
Deterministic Key Predistribution Schemes for Distributed Sensor Networks. Selected Areas in Cryptography 2004: 294-307 - [i8]Mridul Nandi, Douglas R. Stinson:
Multicollision Attacks on Generalized Hash Functions. IACR Cryptol. ePrint Arch. 2004: 330 (2004) - 2003
- [j91]Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Douglas R. Stinson:
Contrast Optimal Threshold Visual Cryptography Schemes. SIAM J. Discret. Math. 16(2): 224-261 (2003) - [c28]Paolo D'Arco, Douglas R. Stinson:
Fault Tolerant and DistributedBroadcast Encryption. CT-RSA 2003: 263-280 - [c27]James A. Muir, Douglas R. Stinson:
Alternative Digit Sets for Nonadjacent Representations. Selected Areas in Cryptography 2003: 306-319 - 2002
- [j90]Philip A. Eisen, Douglas R. Stinson:
Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels. Des. Codes Cryptogr. 25(1): 15-61 (2002) - [j89]Charles J. Colbourn, Douglas R. Stinson, G. H. John van Rees:
Preface: In Honour of Ronald C. Mullin. Des. Codes Cryptogr. 26(1-3): 5-6 (2002) - [j88]Carlo Blundo, Barbara Masucci, Douglas R. Stinson, Ruizhong Wei:
Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes. Des. Codes Cryptogr. 26(1-3): 97-110 (2002) - [j87]Spyros S. Magliveras, Douglas R. Stinson, Tran van Trung:
New Approaches to Designing Public Key Cryptosystems Using One-Way Functions and Trapdoors in Finite Groups. J. Cryptol. 15(4): 285-297 (2002) - [j86]Douglas R. Stinson:
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. Math. Comput. 71(237): 379-391 (2002) - [c26]Paolo D'Arco, Douglas R. Stinson:
On Unconditionally Secure Robust Distributed Key Distribution Centers. ASIACRYPT 2002: 346-363 - [c25]Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Douglas R. Stinson:
New Results on Unconditionally Secure Distributed Oblivious Transfer. Selected Areas in Cryptography 2002: 291-309 - 2001
- [j85]Douglas R. Stinson:
Something About All or Nothing (Transforms). Des. Codes Cryptogr. 22(2): 133-138 (2001) - [j84]Charles J. Colbourn, Jeffrey H. Dinitz, Douglas R. Stinson:
Quorum Systems Constructed from Combinatorial Designs. Inf. Comput. 169(2): 160-173 (2001) - [j83]Kaoru Kurosawa, Thomas Johansson, Douglas R. Stinson:
Almost k-Wise Independent Sample Spaces and Their Cryptologic Applications. J. Cryptol. 14(4): 231-253 (2001) - [j82]Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson:
Extended capabilities for visual cryptography. Theor. Comput. Sci. 250(1-2): 143-161 (2001) - [j81]Jessica Staddon, Douglas R. Stinson, Ruizhong Wei:
Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inf. Theory 47(3): 1042-1049 (2001) - [j80]Barbara Masucci, Douglas R. Stinson:
Efficient metering schemes with pricing. IEEE Trans. Inf. Theory 47(7): 2835-2844 (2001) - [c24]Douglas R. Stinson, Reto Strobl:
Provably Secure Distributed Schnorr Signatures and a (t, n) Threshold Scheme for Implicit Certificates. ACISP 2001: 417-434 - [c23]Palash Sarkar, Douglas R. Stinson:
Frameproof and IPP Codes. INDOCRYPT 2001: 117-126 - [c22]Paolo D'Arco, Douglas R. Stinson:
Generalized Zig-zag Functions and Oblivious Transfer Reductions. Selected Areas in Cryptography 2001: 87-102 - [e2]Douglas R. Stinson, Stafford E. Tavares:
Selected Areas in Cryptography, 7th Annual International Workshop, SAC 2000, Waterloo, Ontario, Canada, August 14-15, 2000, Proceedings. Lecture Notes in Computer Science 2012, Springer 2001, ISBN 3-540-42069-X [contents] - [i7]Douglas R. Stinson:
Some observations on the theory of cryptographic hash functions. IACR Cryptol. ePrint Arch. 2001: 20 (2001) - [i6]M. A. Chateauneuf, Alan C. H. Ling, Douglas R. Stinson:
Slope packings and coverings, and generic algorithms for the discrete logarithm problem. IACR Cryptol. ePrint Arch. 2001: 94 (2001) - 2000
- [j79]Douglas R. Stinson, Ruizhong Wei, Lie Zhu:
Some New Bounds for Cover-Free Families. J. Comb. Theory A 90(1): 224-234 (2000) - [c21]Barbara Masucci, Douglas R. Stinson:
Metering Schemes for General Access Structures. ESORICS 2000: 72-87 - [c20]Carlo Blundo, Annalisa De Bonis, Barbara Masucci, Douglas R. Stinson:
Dynamic Multi-threshold Metering Schemes. Selected Areas in Cryptography 2000: 130-143 - [i5]Jessica Staddon, Douglas R. Stinson, Ruizhong Wei:
Combinatorial Properties of Frameproof and Traceability Codes. IACR Cryptol. ePrint Arch. 2000: 4 (2000) - [i4]Carlo Blundo, Barbara Masucci, Douglas R. Stinson, Ruizhong Wei:
Constructions and Bounds for Unconditionally Secure Commitment Schemes. IACR Cryptol. ePrint Arch. 2000: 43 (2000)
1990 – 1999
- 1999
- [j78]Rolf S. Rees, Douglas R. Stinson, Ruizhong Wei, G. H. John van Rees:
An application of covering designs: determining the maximum consistent set of shares in a threshold scheme. Ars Comb. 53 (1999) - [j77]Douglas R. Stinson, Ruizhong Wei:
An Application of Ramp Schemes to Broadcast Encryption. Inf. Process. Lett. 69(3): 131-135 (1999) - [j76]Carlo Blundo, Alfredo De Santis, Douglas R. Stinson:
On the Contrast in Visual Cryptography Schemes. J. Cryptol. 12(4): 261-289 (1999) - [j75]Donald L. Kreher, Douglas R. Stinson:
Combinatorial algorithms: generation, enumeration, and search. SIGACT News 30(1): 33-35 (1999) - [c19]Guang Gong, Thomas A. Berson, Douglas R. Stinson:
Elliptic Curve Pseudorandom Sequence Generators. Selected Areas in Cryptography 1999: 34-48 - [c18]Douglas R. Stinson, Ruizhong Wei:
Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures. Selected Areas in Cryptography 1999: 200-214 - 1998
- [j74]Douglas R. Stinson, Tran van Trung:
Some New Results on Key Distribution Patterns and Broadcast Encryption. Des. Codes Cryptogr. 14(3): 261-279 (1998) - [j73]Kaoru Kurosawa, Koji Okada, Hajime Saido, Douglas R. Stinson:
New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes. Des. Codes Cryptogr. 15(1): 87-100 (1998) - [j72]Douglas R. Stinson, Ruizhong Wei:
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes. SIAM J. Discret. Math. 11(1): 41-53 (1998) - [j71]Carlo Blundo, Luiz A. Frota Mattos, Douglas R. Stinson:
Generalized Beimel-Chor Schemes for Broadcast Encryption and Interactive Key Distribution. Theor. Comput. Sci. 200(1-2): 313-334 (1998) - [c17]Douglas R. Stinson, Ruizhong Wei:
Key Preassigned Traceability Schemes for Broadcast Encryption. Selected Areas in Cryptography 1998: 144-156 - 1997
- [j70]Carlo Blundo, Douglas R. Stinson:
Anonymous Secret Sharing Schemes. Discret. Appl. Math. 77(1): 13-28 (1997) - [j69]Carlo Blundo, Antonio Giorgio Gaggia, Douglas R. Stinson:
On the Dealer's Randomness Required in Secret Sharing Schemes. Des. Codes Cryptogr. 11(3): 235-259 (1997) - [j68]Douglas R. Stinson:
On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption. Des. Codes Cryptogr. 12(3): 215-243 (1997) - [c16]Kaoru Kurosawa, Thomas Johansson, Douglas R. Stinson:
Almost k-wise Independent Sample Spaces and Their Cryptologic Applications. EUROCRYPT 1997: 409-421 - 1996
- [j67]Rolf S. Rees, Douglas R. Stinson:
Combinatorial Characterizations of Authentication Codes II. Des. Codes Cryptogr. 7(3): 239-259 (1996) - [j66]Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson:
Visual Cryptography for General Access Structures. Inf. Comput. 129(2): 86-106 (1996) - [j65]K. Gopalakrishnan, Douglas R. Stinson:
A Simple Analysis of the Error Probability of Two-Point Based Sampling. Inf. Process. Lett. 60(2): 91-96 (1996) - [j64]Jürgen Bierbrauer, K. Gopalakrishnan, Douglas R. Stinson:
Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds. SIAM J. Discret. Math. 9(3): 424-452 (1996) - [c15]Mustafa Atici, Douglas R. Stinson:
Universal Hashing and Multiple Authentication. CRYPTO 1996: 16-30 - [c14]Carlo Blundo, Luiz A. Frota Mattos, Douglas R. Stinson:
Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution. CRYPTO 1996: 387-400 - [c13]Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson:
Constructions and Bounds for Visual Cryptography. ICALP 1996: 416-428 - [i3]Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson:
Visual Cryptography for General Access Structures. Electron. Colloquium Comput. Complex. TR96 (1996) - [i2]Carlo Blundo, Alfredo De Santis, Douglas R. Stinson:
On the Contrast in Visual Cryptography Schemes. IACR Cryptol. ePrint Arch. 1996: 13 (1996) - 1995
- [b1]Douglas R. Stinson:
Cryptography - theory and practice. Discrete mathematics and its applications series, CRC Press 1995, ISBN 978-0-8493-8521-6 - [j63]K. Gopalakrishnan, Douglas R. Stinson:
Three Characterizations of Non-binary Correlation-Immune and Resilient Functions. Des. Codes Cryptogr. 5(3): 241-251 (1995) - [j62]Carlo Blundo, Luiz A. Frota Mattos, Douglas R. Stinson:
Multiple Key Distribution Maintaining User Anonymity via Broadcast Channels. J. Comput. Secur. 3(4): 309-322 (1995) - [j61]Carlo Blundo, Alfredo De Santis, Douglas R. Stinson, Ugo Vaccaro:
Graph Decompositions and Secret Sharing Schemes. J. Cryptol. 8(1): 39-64 (1995) - [j60]Douglas R. Stinson, James L. Massey:
An Infinite Class of Counterexamples to a Conjecture Concerning Nonlinear Resilient Functions. J. Cryptol. 8(3): 167-173 (1995) - [i1]Douglas R. Stinson:
On the Connections Between Universal Hashing, Combinatorial Designs and Error-Correcting Codes. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j59]Jeffrey H. Dinitz, Douglas R. Stinson, Lie Zhu:
On the Spectra of Certain Classes of Room Frames. Electron. J. Comb. 1 (1994) - [j58]Douglas R. Stinson:
Universal Hashing and Authentication Codes. Des. Codes Cryptogr. 4(4): 369-380 (1994) - [j57]Douglas R. Stinson:
Combinatorial Techniques for Universal Hashing. J. Comput. Syst. Sci. 48(2): 337-346 (1994) - [j56]Douglas R. Stinson:
Decomposition constructions for secret-sharing schemes. IEEE Trans. Inf. Theory 40(1): 118-125 (1994) - [c12]Jürgen Bierbrauer, K. Gopalakrishnan, Douglas R. Stinson:
Bounds for Resilient Functions and Orthogonal Arrays. CRYPTO 1994: 247-256 - [c11]Carlo Blundo, Antonio Giorgio Gaggia, Douglas R. Stinson:
On the Dealer's Randomness Required in Secret Sharing Schemes. EUROCRYPT 1994: 35-46 - [e1]Douglas R. Stinson:
Advances in Cryptology - CRYPTO '93, 13th Annual International Cryptology Conference, Santa Barbara, California, USA, August 22-26, 1993, Proceedings. Lecture Notes in Computer Science 773, Springer 1994, ISBN 3-540-57766-1 [contents] - 1993
- [j55]K. Gopalakrishnan, Dean G. Hoffman, Douglas R. Stinson:
A Note on a Conjecture Concerning Symmetric Resilient Functions. Inf. Process. Lett. 47(3): 139-143 (1993) - [j54]Douglas R. Stinson, Lie Zhu:
Towards the Spectrum of Room Squares with Subsquares. J. Comb. Theory A 63(1): 129-142 (1993) - 1992
- [j53]Douglas R. Stinson:
Combinatorial Characterizations of Authentication Codes. Des. Codes Cryptogr. 2(2): 175-187 (1992) - [j52]Douglas R. Stinson:
An Explication of Secret Sharing Schemes. Des. Codes Cryptogr. 2(4): 357-390 (1992) - [j51]Douglas R. Stinson, Y. J. Wei:
Some results on quadrilaterals in Steiner triple systems. Discret. Math. 105(1-3): 207-219 (1992) - [j50]D. Chen, Charles C. Lindner, Douglas R. Stinson:
Further results on large sets of disjoint group-divisible designs. Discret. Math. 110(1-3): 35-42 (1992) - [j49]Christopher A. Rodger, Douglas R. Stinson:
Nesting directed cycle systems of even length. Eur. J. Comb. 13(3): 213-218 (1992) - [j48]Charles J. Colbourn, Douglas R. Stinson, Luc Teirlinck:
A Parallelization of Miller's n^log n Isomorphism Technique. Inf. Process. Lett. 42(4): 223-228 (1992) - [j47]Ernest F. Brickell, Douglas R. Stinson:
Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes. J. Cryptol. 5(3): 153-166 (1992) - [c10]Douglas R. Stinson:
New General Lower Bounds on the Information Rate of Secret Sharing Schemes. CRYPTO 1992: 168-182 - [c9]Carlo Blundo, Alfredo De Santis, Douglas R. Stinson, Ugo Vaccaro:
Graph Decompositions and Secret Sharing Schemes. EUROCRYPT 1992: 1-24 - 1991
- [j46]Earl S. Kramer, Spyros S. Magliveras, Douglas R. Stinson:
Some small large sets of t-designs. Australas. J Comb. 3: 191-206 (1991) - [j45]Douglas R. Stinson, Lie Zhu:
On the existence of three MOLS with equal-sized holes. Australas. J Comb. 4: 33-48 (1991) - [j44]Douglas R. Stinson:
A survey of Kirkman triple systems and related designs. Discret. Math. 92(1-3): 371-393 (1991) - [j43]Douglas R. Stinson:
Designs constructed from maximal arcs. Discret. Math. 97(1-3): 387-393 (1991) - [j42]Charles J. Colbourn, Jeffrey H. Dinitz, Douglas R. Stinson:
Spanning sets and scattering sets in Steiner triple systems. J. Comb. Theory A 57(1): 46-59 (1991) - [j41]Ernest F. Brickell, Douglas R. Stinson:
The Detection of Cheaters in Threshold Schemes. SIAM J. Discret. Math. 4(4): 502-510 (1991) - [j40]Douglas R. Stinson:
On bit-serial multiplication and dual bases in GF(2m). IEEE Trans. Inf. Theory 37(6): 1733-1736 (1991) - [c8]Douglas R. Stinson:
Combinatorial Characterizations of Authentication Codes. CRYPTO 1991: 62-73 - [c7]Douglas R. Stinson:
Universal Hashing and Authentication Codes. CRYPTO 1991: 74-85 - 1990
- [j39]D. Chen, Douglas R. Stinson:
Recent results on combinatorial constructions for threshold schemes. Australas. J Comb. 1: 29-48 (1990) - [j38]Charles C. Lindner, Christopher A. Rodger, Douglas R. Stinson:
Small embeddings for partial cycle systems of odd length. Discret. Math. 80(3): 273-280 (1990) - [j37]Rolf S. Rees, Douglas R. Stinson:
On the number of blocks in a perfect covering of upsilon points. Discret. Math. 83(1): 81-93 (1990) - [j36]Ronald C. Mullin, Douglas R. Stinson:
Pairwise balanced designs with odd block sizes exceeding five. Discret. Math. 84(1): 47-62 (1990) - [j35]Douglas R. Stinson, Luc Teirlinck:
A Construction for Authentication/secrecy Codes from 3-homogeneous Permutation Groups. Eur. J. Comb. 11(1): 73-79 (1990) - [j34]Douglas R. Stinson:
The Combinatorics of Authentication and Secrecy Codes. J. Cryptol. 2(1): 23-49 (1990) - [j33]Douglas R. Stinson:
Some Observations on Parallel Algorithms for Fast Exponentiation in GF(2^n). SIAM J. Comput. 19(4): 711-717 (1990) - [c6]Ernest F. Brickell, Douglas R. Stinson:
Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes. CRYPTO 1990: 242-252
1980 – 1989
- 1989
- [j32]Charles C. Lindner, Christopher A. Rodger, Douglas R. Stinson:
Nesting of cycle systems of odd length. Discret. Math. 77(1-3): 191-203 (1989) - [j31]Kevin T. Phelps, Douglas R. Stinson, Scott A. Vanstone:
The existence of simple S3(3, 4, v). Discret. Math. 77(1-3): 255-258 (1989) - [j30]Rolf S. Rees, Douglas R. Stinson:
On combinatorial designs with subdesigns. Discret. Math. 77(1-3): 259-279 (1989) - [j29]Brian Alspach, Paul J. Schellenberg, Douglas R. Stinson, David G. Wagner:
The Oberwolfach problem and factors of uniform odd length cycles. J. Comb. Theory A 52(1): 20-43 (1989) - [j28]Jeffrey H. Dinitz, Douglas R. Stinson:
Some new perfect one-factorizations from starters in finite fields. J. Graph Theory 13(4): 405-415 (1989) - 1988
- [j27]E. Seah, Douglas R. Stinson:
A perfect one-factorization for K36. Discret. Math. 70(2): 199-202 (1988) - [j26]Douglas R. Stinson:
Some Constructions and Bounds for Authentication Codes. J. Cryptol. 1(1): 37-52 (1988) - [j25]Douglas R. Stinson:
A Construction for Authentication/Secrecy Codes from Certain Combinatorial Designs. J. Cryptol. 1(2): 119-127 (1988) - [j24]Douglas R. Stinson, Scott A. Vanstone:
A Combinatorial Approach to Threshold Schemes. SIAM J. Discret. Math. 1(2): 230-236 (1988) - [c5]Ernest F. Brickell, Douglas R. Stinson:
The Detection of Cheaters in Threshold Schemes. CRYPTO 1988: 564-577 - [c4]Ernest F. Brickell, Douglas R. Stinson:
Authentication Codes with Multiple Arbiters (Extended Abstract). EUROCRYPT 1988: 51-55 - 1987
- [j23]Douglas R. Stinson:
Frames for Kirkman triple systems. Discret. Math. 65(3): 289-300 (1987) - [j22]Ronald C. Mullin, Douglas R. Stinson:
Pairwise balanced designs with block sizes 6t + 1. Graphs Comb. 3(1): 365-377 (1987) - [c3]Douglas R. Stinson, Scott A. Vanstone:
A Combinatorial Approach to Threshold Schemes. CRYPTO 1987: 330-339 - [c2]Douglas R. Stinson:
A Construction for Authentication/Secrecy Codes from Certain Combinatorial Designs. CRYPTO 1987: 355-366 - 1986
- [j21]Charles J. Colbourn, William L. Kocay, Douglas R. Stinson:
Some NP-complete problems for hypergraph degree sequences. Discret. Appl. Math. 14(3): 239-254 (1986) - [j20]Douglas R. Stinson:
Concerning the spectrum of perpendicular arrays of triple systems. Discret. Math. 61(2-3): 305-310 (1986) - [c1]Douglas R. Stinson:
Some Constructions and Bounds for authentication Codes. CRYPTO 1986: 418-425 - 1985
- [j19]Douglas R. Stinson, L. Zhu:
On sets of three mols with holes. Discret. Math. 54(3): 321-328 (1985) - [j18]Douglas R. Stinson, Scott A. Vanstone:
A Kirkman square of order 51 and block size 3. Discret. Math. 55(1): 107-111 (1985) - [j17]William L. Kocay, Douglas R. Stinson, Scott A. Vanstone:
On strong starters in cyclic groups. Discret. Math. 56(1): 45-60 (1985) - [j16]Douglas R. Stinson:
The spectrum of nested Steiner triple systems. Graphs Comb. 1(1): 189-191 (1985) - 1984
- [j15]Douglas R. Stinson, G. H. John van Rees:
The equivalence of certain equidistant binary codes and symmetric BIBDs. Comb. 4(4): 357-362 (1984) - [j14]Charles C. Lindner, Douglas R. Stinson:
Steiner pentagon systems. Discret. Math. 52(1): 67-74 (1984) - [j13]B. A. Anderson, Paul J. Schellenberg, Douglas R. Stinson:
The Existence of Howell Designs of Even Side. J. Comb. Theory A 36(1): 23-55 (1984) - [j12]Douglas R. Stinson:
A Short Proof of the Nonexistence of a Pair of Orthogonal Latin Squares of Order Six. J. Comb. Theory A 36(3): 373-376 (1984) - 1983
- [j11]Jeffrey H. Dinitz, Douglas R. Stinson:
Mols with holes. Discret. Math. 44(2): 145-154 (1983) - [j10]Paul Erdös, Ronald C. Mullin, Vera T. Sós, Douglas R. Stinson:
Finite linear spaces and projective planes. Discret. Math. 47: 49-62 (1983) - [j9]Douglas R. Stinson, W. D. Wallis:
Two-fold triple systems without repeated blocks. Discret. Math. 47: 125-128 (1983) - [j8]Jeffrey H. Dinitz, Douglas R. Stinson, W. D. Wallis:
Room squares with holes of sides 3, 5, and 7. Discret. Math. 47: 221-228 (1983) - 1982
- [j7]Douglas R. Stinson:
Problem 26. Discret. Math. 41(3): 332 (1982) - [j6]Douglas R. Stinson:
The Existence of Howell Designs of Odd Side. J. Comb. Theory A 32(1): 53-65 (1982) - 1981
- [j5]Paul J. Schellenberg, Douglas R. Stinson, Scott A. Vanstone, J. W. Yates:
The existence of Howell designs of side n+1 and order 2n. Comb. 1(3): 289-301 (1981) - [j4]Douglas R. Stinson:
A general construction for group-divisible designs. Discret. Math. 33(1): 89-94 (1981) - [j3]Jeffrey H. Dinitz, Douglas R. Stinson:
The Spectrum of Room Cubes. Eur. J. Comb. 2(3): 221-230 (1981) - 1980
- [j2]Douglas R. Stinson:
A skew room square of order 129. Discret. Math. 31(3): 333-335 (1980) - [j1]Dan Archdeacon, Jeffrey H. Dinitz, Douglas R. Stinson, Timothy W. Tillson:
Some New Row-Complete Latin Squares. J. Comb. Theory A 29(3): 395-398 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
