Douglas R. Stinson [FOAF] [Follow]

Position:	Professor and University Research Chair
Affiliation:	School of Computer Science University of Waterloo
Address:	School of Computer Science University of Waterloo Waterloo Ontario, N2L 3G1 Canada
Phone:	(519) 888-4567
Fax:	(519) 885-1208
Email:
Homepage:	http://www.cacr.math.uwaterloo.ca/~dstin...
	[Edit]

Statistics:	H-index: 41 (See all experts' h-index.) total citation number: 5341 highest-cited paper: Combinatorial algorithms: generation, enumeration, and search. (1999) at SIGACT News (Cited By 298) More Statistics...

Research Interest:

Authentication Codes, Threshold Schemes, Broadcast Encryption, Cryptography Schemes, Deterministic Key Predistribution Schemes

Show Temporal Interests (Do you want to see the change of his/her research interests?)

Education: [Edit]

Phd University:	Waterloo	Phd Date:	1981
Master University:	Ohio State University	Master Date:	1980
Bachelor University:	Waterloo	Bachelor Date:	1978

Publications: [Edit disambiguation Result]

Group By Year Group By Category

2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 1993 1992 1991 1990 1989 1988 1987 1986 1985 1984 1983 1982 1981 1980

2009 Top (6)
[147]	Jiang Wu, Douglas R. Stinson. A Highly Scalable RFID Authentication Protocol. ACISP'2009. pp.360~376 Cited By 4[Bibtex]
[146]	Ian Goldberg, Atefeh Mashatan, Douglas R. Stinson. A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks. ACNS'2009. pp.219~237 Cited By 2[Bibtex]
[145]	Simon R. Blackburn, Maura B. Paterson, Douglas R. Stinson. Putting Dots in Triangles. CoRR, 2009. Cited By 1[Bibtex]
[144]	Haitao Cao, Jeffrey H. Dinitz, Donald L. Kreher, Douglas R. Stinson, Ruizhong Wei. On orthogonal generalized equitable rectangles. Des. Codes Cryptography, 2009: 225~230 [Bibtex]
[143]	Atefeh Mashatan, Douglas R. Stinson. Interactive two-channel message authentication based on Interactive-Collision Resistant hash functions. Int. J. Inf. Sec., 2009: 49~60 Cited By 9[Bibtex]
[142]	Jiayuan Sui, Douglas R. Stinson. A critical analysis and improvement of advanced access content system drive-host authentication. IJACT, 2009: 169~180 [Bibtex]
2008 Top (10)
[141]	Jiayuan Sui, Douglas R. Stinson. A Critical Analysis and Improvement of AACS Drive-Host Authentication. ACISP'2008. pp.37~52 Cited By 1[Bibtex]
[140]	Atefeh Mashatan, Douglas R. Stinson. A New Message Recognition Protocol for Ad Hoc Pervasive Networks. CANS'2008. pp.378~394 Cited By 6[Bibtex]
[139]	Jiang Wu, Douglas R. Stinson. Authorship Proof for Textual Document. Information Hiding'2008. pp.209~223 Cited By 2[Bibtex]
[138]	Jiang Wu, Douglas R. Stinson. Minimum node degree and kappa-connectivity for key predistribution schemes and distributed sensor networks. WISEC'2008. pp.119~124 [Bibtex]
[137]	Simon R. Blackburn, Keith M. Martin, Maura B. Paterson, Douglas R. Stinson. Key Refreshing in Wireless Sensor Networks. ICITS'2008. pp.156~170 [Bibtex]
[136]	Simon R. Blackburn, Tuvi Etzion, Douglas R. Stinson, Gregory M. Zaverucha. A bound on the size of separating hash families. J. Comb. Theory, Ser. A, 2008: 1246~1256 Cited By 2[Bibtex]
[135]	Douglas R. Stinson, Ruizhong Wei, Kejun Chen. On generalized separating hash families. J. Comb. Theory, Ser. A, 2008: 105~120 Cited By 5[Bibtex]
[134]	Douglas R. Stinson. Combinatorial designs: constructions and analysis. SIGACT News, 2008: 17~21 Cited By 6[Bibtex]
[133]	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., 2008. Cited By 25[Bibtex]
[132]	Douglas R. Stinson, Gregory M. Zaverucha. Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families. IEEE Transactions on Information Theory, 2008: 2508~2514 Cited By 4[Bibtex]
2007 Top (5)
[131]	Douglas R. Stinson. Generalized mix functions and orthogonal equitable rectangles. Des. Codes Cryptography, 2007: 347~357 Cited By 2[Bibtex]
[130]	D. Deng, Douglas R. Stinson, Pak Ching Li, G. H. John van Rees, Ruizhong Wei. Constructions and bounds for (m, t)-splitting systems. Discrete Mathematics, 2007: 18~37 [Bibtex] [PDF]
[129]	Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Douglas R. Stinson. On Unconditionally Secure Distributed Oblivious Transfer. J. Cryptology, 2007: 323~373 Cited By 4[Bibtex] [PDF]
[128]	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, 2007: 109~119 Cited By 64[Bibtex]
[127]	Mridul Nandi, Douglas R. Stinson. Multicollision Attacks on Some Generalized Sequential Hash Functions. IEEE Transactions on Information Theory, 2007: 759~767 Cited By 19[Bibtex]
2006 Top (6)
[126]	James A. Muir, Douglas R. Stinson. On the low hamming weight discrete logarithm problem for nonadjacent representations. Appl. Algebra Eng. Commun. Comput., 2006: 461~472 Cited By 2[Bibtex]
[125]	Paolo D'Arco, Wataru Kishimoto, Douglas R. Stinson. Properties and constraints of cheating-immune secret sharing schemes. Discrete Applied Mathematics, 2006: 219~233 Cited By 3[Bibtex]
[124]	Khoongming Khoo, Guang Gong, Douglas R. Stinson. A New Characterization of Semi-bent and Bent Functions on Finite Fields*. Des. Codes Cryptography, 2006: 279~295 Cited By 16[Bibtex]
[123]	Douglas R. Stinson. Some Observations on the Theory of Cryptographic Hash Functions. Des. Codes Cryptography, 2006: 259~277 Cited By 42[Bibtex]
[122]	Jeffrey H. Dinitz, Alan C. H. Ling, Douglas R. Stinson. Fault-tolerant routings with minimum optical index. Networks, 2006: 47~55 Cited By 3[Bibtex]
[121]	Wakaha Ogata, Kaoru Kurosawa, Douglas R. Stinson. Optimum Secret Sharing Scheme Secure against Cheating. SIAM J. Discrete Math., 2006: 79~95 [Bibtex] [PDF]
2005 Top (4)
[120]	James A. Muir, Douglas R. Stinson. New Minimal Weight Representations for Left-to-Right Window Methods. CT-RSA'2005. pp.366~383 Cited By 29[Bibtex]
[119]	Jooyoung Lee, Douglas R. Stinson. Tree-Based Key Distribution Patterns. Selected Areas in Cryptography'2005. pp.189~204 Cited By 4[Bibtex]
[118]	Jeffrey H. Dinitz, Peter Dukes, Douglas R. Stinson. Sequentially Perfect and Uniform One-Factorizations of the Complete Graph. Electr. J. Comb., 2005. Cited By 3[Bibtex]
[117]	James A. Muir, Douglas R. Stinson. Alternative Digit Sets for Nonadjacent Representations. SIAM J. Discrete Math., 2005: 165~191 Cited By 11[Bibtex]
2004 Top (5)
[116]	Jooyoung Lee, Douglas R. Stinson. Deterministic Key Predistribution Schemes for Distributed Sensor Networks. Selected Areas in Cryptography'2004. pp.294~307 Cited By 96[Bibtex]
[115]	D. Deng, Douglas R. Stinson, Ruizhong Wei. The Lovasz Local Lemma and Its Applications to some Combinatorial Arrays. Des. Codes Cryptography, 2004: 121~134 [Bibtex] [PDF]
[114]	Wakaha Ogata, Kaoru Kurosawa, Douglas R. Stinson, Hajime Saido. New combinatorial designs and their applications to authentication codes and secret sharing schemes. Discrete Mathematics, 2004: 383~405 Cited By 33[Bibtex]
[113]	Douglas R. Stinson, Ruizhong Wei. Generalized cover-free families. Discrete Mathematics, 2004: 463~477 Cited By 35[Bibtex]
[112]	Douglas R. Stinson. Attack on a concast signature scheme. Inf. Process. Lett., 2004: 39~41 Cited By 1[Bibtex]
2003 Top (3)
[111]	Paolo D'Arco, Douglas R. Stinson. Fault Tolerant and DistributedBroadcast Encryption. CT-RSA'2003. pp.263~280 Cited By 19[Bibtex]
[110]	James A. Muir, Douglas R. Stinson. Alternative Digit Sets for Nonadjacent Representations. Selected Areas in Cryptography'2003. pp.306~319 Cited By 11[Bibtex]
[109]	Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Douglas R. Stinson. Contrast Optimal Threshold Visual Cryptography Schemes. SIAM J. Discrete Math., 2003: 224~261 Cited By 76[Bibtex]
2002 Top (7)
[108]	Paolo D'Arco, Douglas R. Stinson. On Unconditionally Secure Robust Distributed Key Distribution Centers. ASIACRYPT'2002. pp.346~363 Cited By 21[Bibtex] [PDF]
[107]	Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Douglas R. Stinson. New Results on Unconditionally Secure Distributed Oblivious Transfer. Selected Areas in Cryptography'2002. pp.291~309 Cited By 9[Bibtex]
[106]	Carlo Blundo, Barbara Masucci, Douglas R. Stinson, Ruizhong Wei. Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes. Des. Codes Cryptography, 2002: 97~110 Cited By 19[Bibtex]
[105]	Charles J. Colbourn, Douglas R. Stinson, G. H. John van Rees. Preface: In Honour of Ronald C. Mullin. Des. Codes Cryptography, 2002: 5~6 [Bibtex]
[104]	Philip A. Eisen, Douglas R. Stinson. Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels. Des. Codes Cryptography, 2002: 15~61 Cited By 79[Bibtex]
[103]	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. Cryptology, 2002: 285~297 [Bibtex]
[102]	Douglas R. Stinson. Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. Math. Comput., 2002: 379~391 Cited By 48[Bibtex]
2001 Top (9)
[101]	Douglas R. Stinson, Reto Strobl. Provably Secure Distributed Schnorr Signatures and a (t, n) Threshold Scheme for Implicit Certificates. ACISP'2001. pp.417~434 Cited By 32[Bibtex]
[100]	Palash Sarkar, Douglas R. Stinson. Frameproof and IPP Codes. INDOCRYPT'2001. pp.117~126 Cited By 15[Bibtex]
[99]	Paolo D'Arco, Douglas R. Stinson. Generalized Zig-zag Functions and Oblivious Transfer Reductions. Selected Areas in Cryptography'2001. pp.87~102 Cited By 6[Bibtex]
[98]	Douglas R. Stinson. Something About All or Nothing (Transforms). Des. Codes Cryptography, 2001: 133~138 Cited By 23[Bibtex]
[97]	Charles J. Colbourn, Jeffrey H. Dinitz, Douglas R. Stinson. Quorum Systems Constructed from Combinatorial Designs. Inf. Comput., 2001: 160~173 Cited By 10[Bibtex] [PDF]
[96]	Kaoru Kurosawa, Thomas Johansson, Douglas R. Stinson. Almost k-Wise Independent Sample Spaces and Their Cryptologic Applications. J. Cryptology, 2001: 231~253 Cited By 32[Bibtex] [PDF]
[95]	Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson. Extended capabilities for visual cryptography. Theor. Comput. Sci., 2001: 143~161 Cited By 96[Bibtex]
[94]	Barbara Masucci, Douglas R. Stinson. Efficient metering schemes with pricing. IEEE Transactions on Information Theory, 2001: 2835~2844 Cited By 23[Bibtex]
[93]	Jessica Staddon, Douglas R. Stinson, Ruizhong Wei. Combinatorial properties of frameproof and traceability codes. IEEE Transactions on Information Theory, 2001: 1042~1049 Cited By 185[Bibtex]
2000 Top (3)
[92]	Barbara Masucci, Douglas R. Stinson. Metering Schemes for General Access Structures. ESORICS'2000. pp.72~87 Cited By 26[Bibtex]
[91]	Carlo Blundo, Annalisa De Bonis, Barbara Masucci, Douglas R. Stinson. Dynamic Multi-threshold Metering Schemes. Selected Areas in Cryptography'2000. pp.130~143 Cited By 22[Bibtex]
[90]	Douglas R. Stinson, Ruizhong Wei, Lie Zhu. Some New Bounds for Cover-Free Families. J. Comb. Theory, Ser. A, 2000: 224~234 Cited By 64[Bibtex]
1999 Top (6)
[89]	Guang Gong, Thomas A. Berson, Douglas R. Stinson. Elliptic Curve Pseudorandom Sequence Generators. Selected Areas in Cryptography'1999. pp.34~48 Cited By 46[Bibtex] [PDF]
[88]	Douglas R. Stinson, Ruizhong Wei. Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures. Selected Areas in Cryptography'1999. pp.200~214 Cited By 27[Bibtex] [PDF]
[87]	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., 1999. Cited By 23[Bibtex]
[86]	Douglas R. Stinson, Ruizhong Wei. An Application of Ramp Schemes to Broadcast Encryption. Inf. Process. Lett., 1999: 131~135 Cited By 21[Bibtex] [PDF]
[85]	Carlo Blundo, Alfredo De Santis, Douglas R. Stinson. On the Contrast in Visual Cryptography Schemes. J. Cryptology, 1999: 261~289 Cited By 125[Bibtex] [PDF]
[84]	Donald L. Kreher, Douglas R. Stinson. Combinatorial algorithms: generation, enumeration, and search. SIGACT News, 1999: 33~35 Cited By 298[Bibtex]
1998 Top (5)
[83]	Douglas R. Stinson, Ruizhong Wei. Key Preassigned Traceability Schemes for Broadcast Encryption. Selected Areas in Cryptography'1998. pp.144~156 Cited By 77[Bibtex]
[82]	Kaoru Kurosawa, Koji Okada, Hajime Saido, Douglas R. Stinson. New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes. Des. Codes Cryptography, 1998: 87~100 Cited By 18[Bibtex]
[81]	Douglas R. Stinson, Tran van Trung. Some New Results on Key Distribution Patterns and Broadcast Encryption. Des. Codes Cryptography, 1998: 261~279 Cited By 93[Bibtex]
[80]	Douglas R. Stinson, Ruizhong Wei. Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes. SIAM J. Discrete Math., 1998: 41~53 Cited By 193[Bibtex] [PDF]
[79]	Carlo Blundo, Luiz A. Frota Mattos, Douglas R. Stinson. Generalized Beimel-Chor Schemes for Broadcast Encryption and Interactive Key Distribution. Theor. Comput. Sci., 1998: 313~334 [Bibtex] [PDF]
1997 Top (4)
[78]	Kaoru Kurosawa, Thomas Johansson, Douglas R. Stinson. Almost k-wise Independent Sample Spaces and Their Cryptologic Applications. EUROCRYPT'1997. pp.409~421 Cited By 32[Bibtex] [PDF]
[77]	Carlo Blundo, Douglas R. Stinson. Anonymous Secret Sharing Schemes. Discrete Applied Mathematics, 1997: 13~28 Cited By 26[Bibtex] [PDF]
[76]	Carlo Blundo, Antonio Giorgio Gaggia, Douglas R. Stinson. On the Dealer's Randomness Required in Secret Sharing Schemes. Des. Codes Cryptography, 1997: 235~259 Cited By 38[Bibtex]
[75]	Douglas R. Stinson. On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption. Des. Codes Cryptography, 1997: 215~243 [Bibtex]
1996 Top (8)
[74]	Mustafa Atici, Douglas R. Stinson. Universal Hashing and Multiple Authentication. CRYPTO'1996. pp.16~30 Cited By 26[Bibtex] [PDF]
[73]	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. pp.387~400 Cited By 80[Bibtex] [PDF]
[72]	Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson. Constructions and Bounds for Visual Cryptography. ICALP'1996. pp.416~428 Cited By 81[Bibtex] [PDF]
[71]	Rolf S. Rees, Douglas R. Stinson. Combinatorial Characterizations of Authentication Codes II. Des. Codes Cryptography, 1996: 239~259 Cited By 26[Bibtex]
[70]	Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson. Visual Cryptography for General Access Structures. Electronic Colloquium on Computational Complexity (ECCC), 1996. [Bibtex] [PDF]
[69]	Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson. Visual Cryptography for General Access Structures. Inf. Comput., 1996: 86~106 [Bibtex] [PDF]
[68]	K. Gopalakrishnan, Douglas R. Stinson. A Simple Analysis of the Error Probability of Two-Point Based Sampling. Inf. Process. Lett., 1996: 91~96 Cited By 8[Bibtex]
[67]	Jurgen Bierbrauer, K. Gopalakrishnan, Douglas R. Stinson. Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds. SIAM J. Discrete Math., 1996: 424~452 Cited By 33[Bibtex]
1995 Top (5)
[66]	Carlo Blundo, Luiz A. Frota Mattos, Douglas R. Stinson. Multiple Key Distribution Maintaining User Anonymity via Broadcast Channels. Journal of Computer Security, 1995: 309~322 Cited By 14[Bibtex]
[65]	K. Gopalakrishnan, Douglas R. Stinson. Three Characterizations of Non-binary Correlation-Immune and Resilient Functions. Des. Codes Cryptography, 1995: 241~251 Cited By 46[Bibtex] [PDF]
[64]	Douglas R. Stinson. On the Connections Between Universal Hashing, Combinatorial Designs and Error-Correcting Codes. Electronic Colloquium on Computational Complexity (ECCC), 1995. Cited By 39[Bibtex] [PDF]
[63]	Carlo Blundo, Alfredo De Santis, Douglas R. Stinson, Ugo Vaccaro. Graph Decompositions and Secret Sharing Schemes. J. Cryptology, 1995: 39~64 Cited By 117[Bibtex]
[62]	Douglas R. Stinson, James L. Massey. An Infinite Class of Counterexamples to a Conjecture Concerning Nonlinear Resilient Functions. J. Cryptology, 1995: 167~173 Cited By 66[Bibtex]
1994 Top (6)
[61]	Jurgen Bierbrauer, K. Gopalakrishnan, Douglas R. Stinson. Bounds for Resilient Functions and Orthogonal Arrays. CRYPTO'1994. pp.247~256 Cited By 44[Bibtex]
[60]	Carlo Blundo, Antonio Giorgio Gaggia, Douglas R. Stinson. On the Dealer's Randomness Required in Secret Sharing Schemes. EUROCRYPT'1994. pp.35~46 Cited By 38[Bibtex]
[59]	Jeffrey H. Dinitz, Douglas R. Stinson, Lie Zhu. On the Spectra of Certain Classes of Room Frames. Electr. J. Comb., 1994. [Bibtex]
[58]	Douglas R. Stinson. Universal Hashing and Authentication Codes. Des. Codes Cryptography, 1994: 369~380 Cited By 208[Bibtex] [PDF]
[57]	Douglas R. Stinson. Combinatorial Techniques for Universal Hashing. J. Comput. Syst. Sci., 1994: 337~346 Cited By 33[Bibtex]
[56]	Douglas R. Stinson. Decomposition constructions for secret-sharing schemes. IEEE Transactions on Information Theory, 1994: 118~125 Cited By 119[Bibtex] [PDF]
1993 Top (2)
[55]	K. Gopalakrishnan, Dean G. Hoffman, Douglas R. Stinson. A Note on a Conjecture Concerning Symmetric Resilient Functions. Inf. Process. Lett., 1993: 139~143 [Bibtex]
[54]	Douglas R. Stinson, Lie Zhu. Towards the Spectrum of Room Squares with Subsquares. J. Comb. Theory, Ser. A, 1993: 129~142 Cited By 10[Bibtex]
1992 Top (8)
[53]	Douglas R. Stinson. New General Lower Bounds on the Information Rate of Secret Sharing Schemes. CRYPTO'1992. pp.168~182 Cited By 41[Bibtex]
[52]	Carlo Blundo, Alfredo De Santis, Douglas R. Stinson, Ugo Vaccaro. Graph Decompositions and Secret Sharing Schemes. EUROCRYPT'1992. pp.1~24 Cited By 117[Bibtex]
[51]	Douglas R. Stinson. Combinatorial Characterizations of Authentication Codes. Des. Codes Cryptography, 1992: 175~187 Cited By 66[Bibtex]
[50]	Douglas R. Stinson. An Explication of Secret Sharing Schemes. Des. Codes Cryptography, 1992: 357~390 Cited By 234[Bibtex]
[49]	Douglas R. Stinson, Y. J. Wei. Some results on quadrilaterals in Steiner triple systems. Discrete Mathematics, 1992: 207~219 [Bibtex]
[48]	D. Chen, Charles C. Lindner, Douglas R. Stinson. Further results on large sets of disjoint group-divisible designs. Discrete Mathematics, 1992: 35~42 [Bibtex]
[47]	Charles J. Colbourn, Douglas R. Stinson, Luc Teirlinck. A Parallelization of Miller's n^log n Isomorphism Technique. Inf. Process. Lett., 1992: 223~228 Cited By 1[Bibtex]
[46]	Ernest F. Brickell, Douglas R. Stinson. Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes. J. Cryptology, 1992: 153~166 Cited By 131[Bibtex]
1991 Top (7)
[45]	Douglas R. Stinson. Combinatorial Characterizations of Authentication Codes. CRYPTO'1991. pp.62~73 Cited By 66[Bibtex]
[44]	Douglas R. Stinson. Universal Hashing and Authentication Codes. CRYPTO'1991. pp.74~85 Cited By 208[Bibtex] [PDF]
[43]	Douglas R. Stinson. A survey of Kirkman triple systems and related designs. Discrete Mathematics, 1991: 371~393 Cited By 18[Bibtex]
[42]	Douglas R. Stinson. Designs constructed from maximal arcs. Discrete Mathematics, 1991: 387~393 Cited By 2[Bibtex]
[41]	Charles J. Colbourn, Jeffrey H. Dinitz, Douglas R. Stinson. Spanning sets and scattering sets in Steiner triple systems. J. Comb. Theory, Ser. A, 1991: 46~59 Cited By 6[Bibtex]
[40]	Ernest F. Brickell, Douglas R. Stinson. The Detection of Cheaters in Threshold Schemes. SIAM J. Discrete Math., 1991: 502~510 Cited By 94[Bibtex] [PDF]
[39]	Douglas R. Stinson. On bit-serial multiplication and dual bases in GF(2m). IEEE Transactions on Information Theory, 1991: 1733~1733 Cited By 14[Bibtex]
1990 Top (6)
[38]	Ernest F. Brickell, Douglas R. Stinson. Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes. CRYPTO'1990. pp.242~252 Cited By 131[Bibtex]
[37]	Charles C. Lindner, Christopher A. Rodger, Douglas R. Stinson. Small embeddings for partial cycle systems of odd length. Discrete Mathematics, 1990: 273~280 Cited By 5[Bibtex]
[36]	Rolf S. Rees, Douglas R. Stinson. On the number of blocks in a perfect covering of upsilon points. Discrete Mathematics, 1990: 81~93 [Bibtex]
[35]	Ronald C. Mullin, Douglas R. Stinson. Pairwise balanced designs with odd block sizes exceeding five. Discrete Mathematics, 1990: 47~62 Cited By 5[Bibtex]
[34]	Douglas R. Stinson. The Combinatorics of Authentication and Secrecy Codes. J. Cryptology, 1990: 23~49 Cited By 111[Bibtex]
[33]	Douglas R. Stinson. Some Observations on Parallel Algorithms for Fast Exponentiation in GF(2^n). SIAM J. Comput., 1990: 711~717 [Bibtex]
1989 Top (4)
[32]	Kevin T. Phelps, Douglas R. Stinson, Scott A. Vanstone. The existence of simple S3(3, 4, v). Discrete Mathematics, 1989: 255~258 [Bibtex]
[31]	Rolf S. Rees, Douglas R. Stinson. On combinatorial designs with subdesigns. Discrete Mathematics, 1989: 259~279 [Bibtex]
[30]	Charles C. Lindner, Christopher A. Rodger, Douglas R. Stinson. Nesting of cycle systems of odd length. Discrete Mathematics, 1989: 191~203 Cited By 19[Bibtex]
[29]	Brian Alspach, Paul J. Schellenberg, Douglas R. Stinson, David Wagner. The Oberwolfach problem and factors of uniform odd length cycles. J. Comb. Theory, Ser. A, 1989: 20~43 Cited By 55[Bibtex]
1988 Top (6)
[28]	Ernest F. Brickell, Douglas R. Stinson. The Detection of Cheaters in Threshold Schemes. CRYPTO'1988. pp.564~577 Cited By 94[Bibtex] [PDF]
[27]	Ernest F. Brickell, Douglas R. Stinson. Authentication Codes with Multiple Arbiters (Extended Abstract). EUROCRYPT'1988. pp.51~55 [Bibtex]
[26]	E. Seah, Douglas R. Stinson. A perfect one-factorization for K36. Discrete Mathematics, 1988: 199~202 [Bibtex]
[25]	Douglas R. Stinson. Some Constructions and Bounds for Authentication Codes. J. Cryptology, 1988: 37~52 Cited By 69[Bibtex]
[24]	Douglas R. Stinson. A Construction for Authentication/Secrecy Codes from Certain Combinatorial Designs. J. Cryptology, 1988: 119~127 Cited By 6[Bibtex]
[23]	Douglas R. Stinson, Scott A. Vanstone. A Combinatorial Approach to Threshold Schemes. SIAM J. Discrete Math., 1988: 230~236 Cited By 66[Bibtex]
1987 Top (3)
[22]	Douglas R. Stinson. A Construction for Authentication/Secrecy Codes from Certain Combinatorial Designs. CRYPTO'1987. pp.355~366 Cited By 6[Bibtex]
[21]	Douglas R. Stinson, Scott A. Vanstone. A Combinatorial Approach to Threshold Schemes. CRYPTO'1987. pp.330~339 [Bibtex]
[20]	Douglas R. Stinson. Frames for Kirkman triple systems. Discrete Mathematics, 1987: 289~300 Cited By 89[Bibtex]
1986 Top (2)
[19]	Douglas R. Stinson. Some Constructions and Bounds for authentication Codes. CRYPTO'1986. pp.418~425 Cited By 69[Bibtex]
[18]	Douglas R. Stinson. Concerning the spectrum of perpendicular arrays of triple systems. Discrete Mathematics, 1986: 305~310 [Bibtex]
1985 Top (3)
[17]	Douglas R. Stinson, L. Zhu. On sets of three mols with holes. Discrete Mathematics, 1985: 321~328 [Bibtex]
[16]	Douglas R. Stinson, Scott A. Vanstone. A Kirkman square of order 51 and block size 3. Discrete Mathematics, 1985: 107~111 [Bibtex]
[15]	W. L. Kocay, Douglas R. Stinson, Scott A. Vanstone. On strong starters in cyclic groups. Discrete Mathematics, 1985: 45~60 Cited By 13[Bibtex]
1984 Top (4)
[14]	Douglas R. Stinson, G. H. John van Rees. The equivalence of certain equidistant binary codes and symmetric BIBDs. Combinatorica, 1984: 357~362 [Bibtex]
[13]	Charles C. Lindner, Douglas R. Stinson. Steiner pentagon systems. Discrete Mathematics, 1984: 67~74 Cited By 58[Bibtex]
[12]	B. A. Anderson, Paul J. Schellenberg, Douglas R. Stinson. The Existence of Howell Designs of Even Side. J. Comb. Theory, Ser. A, 1984: 23~55 Cited By 17[Bibtex]
[11]	Douglas R. Stinson. A Short Proof of the Nonexistence of a Pair of Orthogonal Latin Squares of Order Six. J. Comb. Theory, Ser. A, 1984: 373~376 Cited By 46[Bibtex]
1983 Top (4)
[10]	Jeffrey H. Dinitz, Douglas R. Stinson. Mols with holes. Discrete Mathematics, 1983: 145~154 [Bibtex]
[9]	Douglas R. Stinson, W. D. Wallis. Two-fold triple systems without repeated blocks. Discrete Mathematics, 1983: 125~128 Cited By 4[Bibtex]
[8]	Paul Erdos, Ronald C. Mullin, Vera T. Sos, Douglas R. Stinson. Finite linear spaces and projective planes. Discrete Mathematics, 1983: 49~62 Cited By 17[Bibtex]
[7]	Jeffrey H. Dinitz, Douglas R. Stinson, W. D. Wallis. Room squares with holes of sides 3, 5, and 7. Discrete Mathematics, 1983: 221~228 Cited By 3[Bibtex]
1982 Top (2)
[6]	Douglas R. Stinson. Problem 26. Discrete Mathematics, 1982: 332~332 [Bibtex]
[5]	Douglas R. Stinson. The Existence of Howell Designs of Odd Side. J. Comb. Theory, Ser. A, 1982: 53~65 Cited By 15[Bibtex]
1981 Top (2)
[4]	Paul J. Schellenberg, Douglas R. Stinson, Scott A. Vanstone, J. W. Yates. The existence of Howell designs of side n+1 and order 2n. Combinatorica, 1981: 289~301 Cited By 6[Bibtex]
[3]	Douglas R. Stinson. A general construction for group-divisible designs. Discrete Mathematics, 1981: 89~94 [Bibtex]
1980 Top (2)
[2]	Douglas R. Stinson. A skew room square of order 129. Discrete Mathematics, 1980: 333~335 [Bibtex]
[1]	Dan Archdeacon, Jeffrey H. Dinitz, Douglas R. Stinson, Timothy W. Tillson. Some New Row-Complete Latin Squares. J. Comb. Theory, Ser. A, 1980: 395~398 Cited By 19[Bibtex]

Signature Schemes / Authenticated Key Exchange Secure Finite Sets / New Designs Binary code / Error detection

Signature Schemes / Authenticated Key Exchange Secure(107)

Top

[147]	Jiang Wu, Douglas R. Stinson. A Highly Scalable RFID Authentication Protocol. ACISP'2009. pp.360~376 Cited By 4[Bibtex]
[146]	Ian Goldberg, Atefeh Mashatan, Douglas R. Stinson. A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks. ACNS'2009. pp.219~237 Cited By 2[Bibtex]
[145]	Simon R. Blackburn, Maura B. Paterson, Douglas R. Stinson. Putting Dots in Triangles. CoRR, 2009. Cited By 1[Bibtex]
[144]	Atefeh Mashatan, Douglas R. Stinson. Interactive two-channel message authentication based on Interactive-Collision Resistant hash functions. Int. J. Inf. Sec., 2009: 49~60 Cited By 9[Bibtex]
[143]	Jiayuan Sui, Douglas R. Stinson. A critical analysis and improvement of advanced access content system drive-host authentication. IJACT, 2009: 169~180 [Bibtex]
[142]	Jiayuan Sui, Douglas R. Stinson. A Critical Analysis and Improvement of AACS Drive-Host Authentication. ACISP'2008. pp.37~52 Cited By 1[Bibtex]
[141]	Atefeh Mashatan, Douglas R. Stinson. A New Message Recognition Protocol for Ad Hoc Pervasive Networks. CANS'2008. pp.378~394 Cited By 6[Bibtex]
[140]	Jiang Wu, Douglas R. Stinson. Authorship Proof for Textual Document. Information Hiding'2008. pp.209~223 Cited By 2[Bibtex]
[139]	Jiang Wu, Douglas R. Stinson. Minimum node degree and kappa-connectivity for key predistribution schemes and distributed sensor networks. WISEC'2008. pp.119~124 [Bibtex]
[138]	Simon R. Blackburn, Keith M. Martin, Maura B. Paterson, Douglas R. Stinson. Key Refreshing in Wireless Sensor Networks. ICITS'2008. pp.156~170 [Bibtex]
[137]	Douglas R. Stinson. Combinatorial designs: constructions and analysis. SIGACT News, 2008: 17~21 Cited By 6[Bibtex]
[136]	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., 2008. Cited By 25[Bibtex]
[135]	Douglas R. Stinson, Gregory M. Zaverucha. Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families. IEEE Transactions on Information Theory, 2008: 2508~2514 Cited By 4[Bibtex]
[134]	Douglas R. Stinson. Generalized mix functions and orthogonal equitable rectangles. Des. Codes Cryptography, 2007: 347~357 Cited By 2[Bibtex]
[133]	Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Douglas R. Stinson. On Unconditionally Secure Distributed Oblivious Transfer. J. Cryptology, 2007: 323~373 Cited By 4[Bibtex] [PDF]
[132]	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, 2007: 109~119 Cited By 64[Bibtex]
[131]	Mridul Nandi, Douglas R. Stinson. Multicollision Attacks on Some Generalized Sequential Hash Functions. IEEE Transactions on Information Theory, 2007: 759~767 Cited By 19[Bibtex]
[130]	James A. Muir, Douglas R. Stinson. On the low hamming weight discrete logarithm problem for nonadjacent representations. Appl. Algebra Eng. Commun. Comput., 2006: 461~472 Cited By 2[Bibtex]
[129]	Paolo D'Arco, Wataru Kishimoto, Douglas R. Stinson. Properties and constraints of cheating-immune secret sharing schemes. Discrete Applied Mathematics, 2006: 219~233 Cited By 3[Bibtex]
[128]	Khoongming Khoo, Guang Gong, Douglas R. Stinson. A New Characterization of Semi-bent and Bent Functions on Finite Fields*. Des. Codes Cryptography, 2006: 279~295 Cited By 16[Bibtex]
[127]	Douglas R. Stinson. Some Observations on the Theory of Cryptographic Hash Functions. Des. Codes Cryptography, 2006: 259~277 Cited By 42[Bibtex]
[126]	Wakaha Ogata, Kaoru Kurosawa, Douglas R. Stinson. Optimum Secret Sharing Scheme Secure against Cheating. SIAM J. Discrete Math., 2006: 79~95 [Bibtex] [PDF]
[125]	James A. Muir, Douglas R. Stinson. New Minimal Weight Representations for Left-to-Right Window Methods. CT-RSA'2005. pp.366~383 Cited By 29[Bibtex]
[124]	Jooyoung Lee, Douglas R. Stinson. Tree-Based Key Distribution Patterns. Selected Areas in Cryptography'2005. pp.189~204 Cited By 4[Bibtex]
[123]	James A. Muir, Douglas R. Stinson. Alternative Digit Sets for Nonadjacent Representations. SIAM J. Discrete Math., 2005: 165~191 Cited By 11[Bibtex]
[122]	Jooyoung Lee, Douglas R. Stinson. Deterministic Key Predistribution Schemes for Distributed Sensor Networks. Selected Areas in Cryptography'2004. pp.294~307 Cited By 96[Bibtex]
[121]	Wakaha Ogata, Kaoru Kurosawa, Douglas R. Stinson, Hajime Saido. New combinatorial designs and their applications to authentication codes and secret sharing schemes. Discrete Mathematics, 2004: 383~405 Cited By 33[Bibtex]
[120]	Douglas R. Stinson, Ruizhong Wei. Generalized cover-free families. Discrete Mathematics, 2004: 463~477 Cited By 35[Bibtex]
[119]	Douglas R. Stinson. Attack on a concast signature scheme. Inf. Process. Lett., 2004: 39~41 Cited By 1[Bibtex]
[118]	Paolo D'Arco, Douglas R. Stinson. Fault Tolerant and DistributedBroadcast Encryption. CT-RSA'2003. pp.263~280 Cited By 19[Bibtex]
[117]	James A. Muir, Douglas R. Stinson. Alternative Digit Sets for Nonadjacent Representations. Selected Areas in Cryptography'2003. pp.306~319 Cited By 11[Bibtex]
[116]	Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Douglas R. Stinson. Contrast Optimal Threshold Visual Cryptography Schemes. SIAM J. Discrete Math., 2003: 224~261 Cited By 76[Bibtex]
[115]	Paolo D'Arco, Douglas R. Stinson. On Unconditionally Secure Robust Distributed Key Distribution Centers. ASIACRYPT'2002. pp.346~363 Cited By 21[Bibtex] [PDF]
[114]	Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Douglas R. Stinson. New Results on Unconditionally Secure Distributed Oblivious Transfer. Selected Areas in Cryptography'2002. pp.291~309 Cited By 9[Bibtex]
[113]	Carlo Blundo, Barbara Masucci, Douglas R. Stinson, Ruizhong Wei. Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes. Des. Codes Cryptography, 2002: 97~110 Cited By 19[Bibtex]
[112]	Philip A. Eisen, Douglas R. Stinson. Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels. Des. Codes Cryptography, 2002: 15~61 Cited By 79[Bibtex]
[111]	Douglas R. Stinson. Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. Math. Comput., 2002: 379~391 Cited By 48[Bibtex]
[110]	Douglas R. Stinson, Reto Strobl. Provably Secure Distributed Schnorr Signatures and a (t, n) Threshold Scheme for Implicit Certificates. ACISP'2001. pp.417~434 Cited By 32[Bibtex]
[109]	Palash Sarkar, Douglas R. Stinson. Frameproof and IPP Codes. INDOCRYPT'2001. pp.117~126 Cited By 15[Bibtex]
[108]	Paolo D'Arco, Douglas R. Stinson. Generalized Zig-zag Functions and Oblivious Transfer Reductions. Selected Areas in Cryptography'2001. pp.87~102 Cited By 6[Bibtex]
[107]	Douglas R. Stinson. Something About All or Nothing (Transforms). Des. Codes Cryptography, 2001: 133~138 Cited By 23[Bibtex]
[106]	Kaoru Kurosawa, Thomas Johansson, Douglas R. Stinson. Almost k-Wise Independent Sample Spaces and Their Cryptologic Applications. J. Cryptology, 2001: 231~253 Cited By 32[Bibtex] [PDF]
[105]	Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson. Extended capabilities for visual cryptography. Theor. Comput. Sci., 2001: 143~161 Cited By 96[Bibtex]
[104]	Barbara Masucci, Douglas R. Stinson. Efficient metering schemes with pricing. IEEE Transactions on Information Theory, 2001: 2835~2844 Cited By 23[Bibtex]
[103]	Jessica Staddon, Douglas R. Stinson, Ruizhong Wei. Combinatorial properties of frameproof and traceability codes. IEEE Transactions on Information Theory, 2001: 1042~1049 Cited By 185[Bibtex]
[102]	Barbara Masucci, Douglas R. Stinson. Metering Schemes for General Access Structures. ESORICS'2000. pp.72~87 Cited By 26[Bibtex]
[101]	Carlo Blundo, Annalisa De Bonis, Barbara Masucci, Douglas R. Stinson. Dynamic Multi-threshold Metering Schemes. Selected Areas in Cryptography'2000. pp.130~143 Cited By 22[Bibtex]
[100]	Guang Gong, Thomas A. Berson, Douglas R. Stinson. Elliptic Curve Pseudorandom Sequence Generators. Selected Areas in Cryptography'1999. pp.34~48 Cited By 46[Bibtex] [PDF]
[99]	Douglas R. Stinson, Ruizhong Wei. Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures. Selected Areas in Cryptography'1999. pp.200~214 Cited By 27[Bibtex] [PDF]
[98]	Douglas R. Stinson, Ruizhong Wei. An Application of Ramp Schemes to Broadcast Encryption. Inf. Process. Lett., 1999: 131~135 Cited By 21[Bibtex] [PDF]
[97]	Carlo Blundo, Alfredo De Santis, Douglas R. Stinson. On the Contrast in Visual Cryptography Schemes. J. Cryptology, 1999: 261~289 Cited By 125[Bibtex] [PDF]
[96]	Douglas R. Stinson, Ruizhong Wei. Key Preassigned Traceability Schemes for Broadcast Encryption. Selected Areas in Cryptography'1998. pp.144~156 Cited By 77[Bibtex]
[95]	Kaoru Kurosawa, Koji Okada, Hajime Saido, Douglas R. Stinson. New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes. Des. Codes Cryptography, 1998: 87~100 Cited By 18[Bibtex]
[94]	Douglas R. Stinson, Ruizhong Wei. Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes. SIAM J. Discrete Math., 1998: 41~53 Cited By 193[Bibtex] [PDF]
[93]	Carlo Blundo, Luiz A. Frota Mattos, Douglas R. Stinson. Generalized Beimel-Chor Schemes for Broadcast Encryption and Interactive Key Distribution. Theor. Comput. Sci., 1998: 313~334 [Bibtex] [PDF]
[92]	Kaoru Kurosawa, Thomas Johansson, Douglas R. Stinson. Almost k-wise Independent Sample Spaces and Their Cryptologic Applications. EUROCRYPT'1997. pp.409~421 Cited By 32[Bibtex] [PDF]
[91]	Carlo Blundo, Douglas R. Stinson. Anonymous Secret Sharing Schemes. Discrete Applied Mathematics, 1997: 13~28 Cited By 26[Bibtex] [PDF]
[90]	Carlo Blundo, Antonio Giorgio Gaggia, Douglas R. Stinson. On the Dealer's Randomness Required in Secret Sharing Schemes. Des. Codes Cryptography, 1997: 235~259 Cited By 38[Bibtex]
[89]	Douglas R. Stinson. On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption. Des. Codes Cryptography, 1997: 215~243 [Bibtex]
[88]	Mustafa Atici, Douglas R. Stinson. Universal Hashing and Multiple Authentication. CRYPTO'1996. pp.16~30 Cited By 26[Bibtex] [PDF]
[87]	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. pp.387~400 Cited By 80[Bibtex] [PDF]
[86]	Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson. Constructions and Bounds for Visual Cryptography. ICALP'1996. pp.416~428 Cited By 81[Bibtex] [PDF]
[85]	Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson. Visual Cryptography for General Access Structures. Electronic Colloquium on Computational Complexity (ECCC), 1996. [Bibtex] [PDF]
[84]	Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson. Visual Cryptography for General Access Structures. Inf. Comput., 1996: 86~106 [Bibtex] [PDF]
[83]	K. Gopalakrishnan, Douglas R. Stinson. A Simple Analysis of the Error Probability of Two-Point Based Sampling. Inf. Process. Lett., 1996: 91~96 Cited By 8[Bibtex]
[82]	Carlo Blundo, Luiz A. Frota Mattos, Douglas R. Stinson. Multiple Key Distribution Maintaining User Anonymity via Broadcast Channels. Journal of Computer Security, 1995: 309~322 Cited By 14[Bibtex]
[81]	K. Gopalakrishnan, Douglas R. Stinson. Three Characterizations of Non-binary Correlation-Immune and Resilient Functions. Des. Codes Cryptography, 1995: 241~251 Cited By 46[Bibtex] [PDF]
[80]	Douglas R. Stinson. On the Connections Between Universal Hashing, Combinatorial Designs and Error-Correcting Codes. Electronic Colloquium on Computational Complexity (ECCC), 1995. Cited By 39[Bibtex] [PDF]
[79]	Carlo Blundo, Alfredo De Santis, Douglas R. Stinson, Ugo Vaccaro. Graph Decompositions and Secret Sharing Schemes. J. Cryptology, 1995: 39~64 Cited By 117[Bibtex]
[78]	Douglas R. Stinson, James L. Massey. An Infinite Class of Counterexamples to a Conjecture Concerning Nonlinear Resilient Functions. J. Cryptology, 1995: 167~173 Cited By 66[Bibtex]
[77]	Carlo Blundo, Antonio Giorgio Gaggia, Douglas R. Stinson. On the Dealer's Randomness Required in Secret Sharing Schemes. EUROCRYPT'1994. pp.35~46 Cited By 38[Bibtex]
[76]	Douglas R. Stinson. Universal Hashing and Authentication Codes. Des. Codes Cryptography, 1994: 369~380 Cited By 208[Bibtex] [PDF]
[75]	Douglas R. Stinson. Combinatorial Techniques for Universal Hashing. J. Comput. Syst. Sci., 1994: 337~346 Cited By 33[Bibtex]
[74]	Douglas R. Stinson. Decomposition constructions for secret-sharing schemes. IEEE Transactions on Information Theory, 1994: 118~125 Cited By 119[Bibtex] [PDF]
[73]	Douglas R. Stinson. New General Lower Bounds on the Information Rate of Secret Sharing Schemes. CRYPTO'1992. pp.168~182 Cited By 41[Bibtex]
[72]	Carlo Blundo, Alfredo De Santis, Douglas R. Stinson, Ugo Vaccaro. Graph Decompositions and Secret Sharing Schemes. EUROCRYPT'1992. pp.1~24 Cited By 117[Bibtex]
[71]	Douglas R. Stinson. Combinatorial Characterizations of Authentication Codes. Des. Codes Cryptography, 1992: 175~187 Cited By 66[Bibtex]
[70]	Douglas R. Stinson. An Explication of Secret Sharing Schemes. Des. Codes Cryptography, 1992: 357~390 Cited By 234[Bibtex]
[69]	Ernest F. Brickell, Douglas R. Stinson. Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes. J. Cryptology, 1992: 153~166 Cited By 131[Bibtex]
[68]	Douglas R. Stinson. Combinatorial Characterizations of Authentication Codes. CRYPTO'1991. pp.62~73 Cited By 66[Bibtex]
[67]	Douglas R. Stinson. Universal Hashing and Authentication Codes. CRYPTO'1991. pp.74~85 Cited By 208[Bibtex] [PDF]
[66]	Douglas R. Stinson. A survey of Kirkman triple systems and related designs. Discrete Mathematics, 1991: 371~393 Cited By 18[Bibtex]
[65]	Douglas R. Stinson. Designs constructed from maximal arcs. Discrete Mathematics, 1991: 387~393 Cited By 2[Bibtex]
[64]	Ernest F. Brickell, Douglas R. Stinson. The Detection of Cheaters in Threshold Schemes. SIAM J. Discrete Math., 1991: 502~510 Cited By 94[Bibtex] [PDF]
[63]	Douglas R. Stinson. On bit-serial multiplication and dual bases in GF(2m). IEEE Transactions on Information Theory, 1991: 1733~1733 Cited By 14[Bibtex]
[62]	Ernest F. Brickell, Douglas R. Stinson. Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes. CRYPTO'1990. pp.242~252 Cited By 131[Bibtex]
[61]	Douglas R. Stinson. The Combinatorics of Authentication and Secrecy Codes. J. Cryptology, 1990: 23~49 Cited By 111[Bibtex]
[60]	Douglas R. Stinson. Some Observations on Parallel Algorithms for Fast Exponentiation in GF(2^n). SIAM J. Comput., 1990: 711~717 [Bibtex]
[59]	Brian Alspach, Paul J. Schellenberg, Douglas R. Stinson, David Wagner. The Oberwolfach problem and factors of uniform odd length cycles. J. Comb. Theory, Ser. A, 1989: 20~43 Cited By 55[Bibtex]
[58]	Ernest F. Brickell, Douglas R. Stinson. The Detection of Cheaters in Threshold Schemes. CRYPTO'1988. pp.564~577 Cited By 94[Bibtex] [PDF]
[57]	Ernest F. Brickell, Douglas R. Stinson. Authentication Codes with Multiple Arbiters (Extended Abstract). EUROCRYPT'1988. pp.51~55 [Bibtex]
[56]	E. Seah, Douglas R. Stinson. A perfect one-factorization for K36. Discrete Mathematics, 1988: 199~202 [Bibtex]
[55]	Douglas R. Stinson. Some Constructions and Bounds for Authentication Codes. J. Cryptology, 1988: 37~52 Cited By 69[Bibtex]
[54]	Douglas R. Stinson. A Construction for Authentication/Secrecy Codes from Certain Combinatorial Designs. J. Cryptology, 1988: 119~127 Cited By 6[Bibtex]
[53]	Douglas R. Stinson, Scott A. Vanstone. A Combinatorial Approach to Threshold Schemes. SIAM J. Discrete Math., 1988: 230~236 Cited By 66[Bibtex]
[52]	Douglas R. Stinson. A Construction for Authentication/Secrecy Codes from Certain Combinatorial Designs. CRYPTO'1987. pp.355~366 Cited By 6[Bibtex]
[51]	Douglas R. Stinson, Scott A. Vanstone. A Combinatorial Approach to Threshold Schemes. CRYPTO'1987. pp.330~339 [Bibtex]
[50]	Douglas R. Stinson. Frames for Kirkman triple systems. Discrete Mathematics, 1987: 289~300 Cited By 89[Bibtex]
[49]	Douglas R. Stinson. Some Constructions and Bounds for authentication Codes. CRYPTO'1986. pp.418~425 Cited By 69[Bibtex]
[48]	Douglas R. Stinson. Concerning the spectrum of perpendicular arrays of triple systems. Discrete Mathematics, 1986: 305~310 [Bibtex]
[47]	Douglas R. Stinson, Scott A. Vanstone. A Kirkman square of order 51 and block size 3. Discrete Mathematics, 1985: 107~111 [Bibtex]
[46]	W. L. Kocay, Douglas R. Stinson, Scott A. Vanstone. On strong starters in cyclic groups. Discrete Mathematics, 1985: 45~60 Cited By 13[Bibtex]
[45]	Douglas R. Stinson. A Short Proof of the Nonexistence of a Pair of Orthogonal Latin Squares of Order Six. J. Comb. Theory, Ser. A, 1984: 373~376 Cited By 46[Bibtex]
[44]	Douglas R. Stinson. Problem 26. Discrete Mathematics, 1982: 332~332 [Bibtex]
[43]	Douglas R. Stinson. The Existence of Howell Designs of Odd Side. J. Comb. Theory, Ser. A, 1982: 53~65 Cited By 15[Bibtex]
[42]	Douglas R. Stinson. A general construction for group-divisible designs. Discrete Mathematics, 1981: 89~94 [Bibtex]
[41]	Douglas R. Stinson. A skew room square of order 129. Discrete Mathematics, 1980: 333~335 [Bibtex]

Finite Sets / New Designs(37)

Top

[40]	Haitao Cao, Jeffrey H. Dinitz, Donald L. Kreher, Douglas R. Stinson, Ruizhong Wei. On orthogonal generalized equitable rectangles. Des. Codes Cryptography, 2009: 225~230 [Bibtex]
[39]	Douglas R. Stinson, Ruizhong Wei, Kejun Chen. On generalized separating hash families. J. Comb. Theory, Ser. A, 2008: 105~120 Cited By 5[Bibtex]
[38]	D. Deng, Douglas R. Stinson, Pak Ching Li, G. H. John van Rees, Ruizhong Wei. Constructions and bounds for (m, t)-splitting systems. Discrete Mathematics, 2007: 18~37 [Bibtex] [PDF]
[37]	Jeffrey H. Dinitz, Alan C. H. Ling, Douglas R. Stinson. Fault-tolerant routings with minimum optical index. Networks, 2006: 47~55 Cited By 3[Bibtex]
[36]	Jeffrey H. Dinitz, Peter Dukes, Douglas R. Stinson. Sequentially Perfect and Uniform One-Factorizations of the Complete Graph. Electr. J. Comb., 2005. Cited By 3[Bibtex]
[35]	D. Deng, Douglas R. Stinson, Ruizhong Wei. The Lovasz Local Lemma and Its Applications to some Combinatorial Arrays. Des. Codes Cryptography, 2004: 121~134 [Bibtex] [PDF]
[34]	Charles J. Colbourn, Douglas R. Stinson, G. H. John van Rees. Preface: In Honour of Ronald C. Mullin. Des. Codes Cryptography, 2002: 5~6 [Bibtex]
[33]	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. Cryptology, 2002: 285~297 [Bibtex]
[32]	Charles J. Colbourn, Jeffrey H. Dinitz, Douglas R. Stinson. Quorum Systems Constructed from Combinatorial Designs. Inf. Comput., 2001: 160~173 Cited By 10[Bibtex] [PDF]
[31]	Douglas R. Stinson, Ruizhong Wei, Lie Zhu. Some New Bounds for Cover-Free Families. J. Comb. Theory, Ser. A, 2000: 224~234 Cited By 64[Bibtex]
[30]	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., 1999. Cited By 23[Bibtex]
[29]	Donald L. Kreher, Douglas R. Stinson. Combinatorial algorithms: generation, enumeration, and search. SIGACT News, 1999: 33~35 Cited By 298[Bibtex]
[28]	Douglas R. Stinson, Tran van Trung. Some New Results on Key Distribution Patterns and Broadcast Encryption. Des. Codes Cryptography, 1998: 261~279 Cited By 93[Bibtex]
[27]	Rolf S. Rees, Douglas R. Stinson. Combinatorial Characterizations of Authentication Codes II. Des. Codes Cryptography, 1996: 239~259 Cited By 26[Bibtex]
[26]	Jeffrey H. Dinitz, Douglas R. Stinson, Lie Zhu. On the Spectra of Certain Classes of Room Frames. Electr. J. Comb., 1994. [Bibtex]
[25]	K. Gopalakrishnan, Dean G. Hoffman, Douglas R. Stinson. A Note on a Conjecture Concerning Symmetric Resilient Functions. Inf. Process. Lett., 1993: 139~143 [Bibtex]
[24]	Douglas R. Stinson, Lie Zhu. Towards the Spectrum of Room Squares with Subsquares. J. Comb. Theory, Ser. A, 1993: 129~142 Cited By 10[Bibtex]
[23]	Douglas R. Stinson, Y. J. Wei. Some results on quadrilaterals in Steiner triple systems. Discrete Mathematics, 1992: 207~219 [Bibtex]
[22]	D. Chen, Charles C. Lindner, Douglas R. Stinson. Further results on large sets of disjoint group-divisible designs. Discrete Mathematics, 1992: 35~42 [Bibtex]
[21]	Charles J. Colbourn, Douglas R. Stinson, Luc Teirlinck. A Parallelization of Miller's n^log n Isomorphism Technique. Inf. Process. Lett., 1992: 223~228 Cited By 1[Bibtex]
[20]	Charles J. Colbourn, Jeffrey H. Dinitz, Douglas R. Stinson. Spanning sets and scattering sets in Steiner triple systems. J. Comb. Theory, Ser. A, 1991: 46~59 Cited By 6[Bibtex]
[19]	Charles C. Lindner, Christopher A. Rodger, Douglas R. Stinson. Small embeddings for partial cycle systems of odd length. Discrete Mathematics, 1990: 273~280 Cited By 5[Bibtex]
[18]	Rolf S. Rees, Douglas R. Stinson. On the number of blocks in a perfect covering of upsilon points. Discrete Mathematics, 1990: 81~93 [Bibtex]
[17]	Ronald C. Mullin, Douglas R. Stinson. Pairwise balanced designs with odd block sizes exceeding five. Discrete Mathematics, 1990: 47~62 Cited By 5[Bibtex]
[16]	Kevin T. Phelps, Douglas R. Stinson, Scott A. Vanstone. The existence of simple S3(3, 4, v). Discrete Mathematics, 1989: 255~258 [Bibtex]
[15]	Rolf S. Rees, Douglas R. Stinson. On combinatorial designs with subdesigns. Discrete Mathematics, 1989: 259~279 [Bibtex]
[14]	Charles C. Lindner, Christopher A. Rodger, Douglas R. Stinson. Nesting of cycle systems of odd length. Discrete Mathematics, 1989: 191~203 Cited By 19[Bibtex]
[13]	Douglas R. Stinson, L. Zhu. On sets of three mols with holes. Discrete Mathematics, 1985: 321~328 [Bibtex]
[12]	Douglas R. Stinson, G. H. John van Rees. The equivalence of certain equidistant binary codes and symmetric BIBDs. Combinatorica, 1984: 357~362 [Bibtex]
[11]	Charles C. Lindner, Douglas R. Stinson. Steiner pentagon systems. Discrete Mathematics, 1984: 67~74 Cited By 58[Bibtex]
[10]	B. A. Anderson, Paul J. Schellenberg, Douglas R. Stinson. The Existence of Howell Designs of Even Side. J. Comb. Theory, Ser. A, 1984: 23~55 Cited By 17[Bibtex]
[9]	Jeffrey H. Dinitz, Douglas R. Stinson. Mols with holes. Discrete Mathematics, 1983: 145~154 [Bibtex]
[8]	Douglas R. Stinson, W. D. Wallis. Two-fold triple systems without repeated blocks. Discrete Mathematics, 1983: 125~128 Cited By 4[Bibtex]
[7]	Paul Erdos, Ronald C. Mullin, Vera T. Sos, Douglas R. Stinson. Finite linear spaces and projective planes. Discrete Mathematics, 1983: 49~62 Cited By 17[Bibtex]
[6]	Jeffrey H. Dinitz, Douglas R. Stinson, W. D. Wallis. Room squares with holes of sides 3, 5, and 7. Discrete Mathematics, 1983: 221~228 Cited By 3[Bibtex]
[5]	Paul J. Schellenberg, Douglas R. Stinson, Scott A. Vanstone, J. W. Yates. The existence of Howell designs of side n+1 and order 2n. Combinatorica, 1981: 289~301 Cited By 6[Bibtex]
[4]	Dan Archdeacon, Jeffrey H. Dinitz, Douglas R. Stinson, Timothy W. Tillson. Some New Row-Complete Latin Squares. J. Comb. Theory, Ser. A, 1980: 395~398 Cited By 19[Bibtex]

Binary code / Error detection(3)

Top

[3]	Simon R. Blackburn, Tuvi Etzion, Douglas R. Stinson, Gregory M. Zaverucha. A bound on the size of separating hash families. J. Comb. Theory, Ser. A, 2008: 1246~1256 Cited By 2[Bibtex]
[2]	Jurgen Bierbrauer, K. Gopalakrishnan, Douglas R. Stinson. Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds. SIAM J. Discrete Math., 1996: 424~452 Cited By 33[Bibtex]
[1]	Jurgen Bierbrauer, K. Gopalakrishnan, Douglas R. Stinson. Bounds for Resilient Functions and Orthogonal Arrays. CRYPTO'1994. pp.247~256 Cited By 44[Bibtex]