The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Douglas R. Stinson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  129. A Highly Scalable RFID Authentication Protocol. [Citation Graph (, )][DBLP]


  130. A Critical Analysis and Improvement of AACS Drive-Host Authentication. [Citation Graph (, )][DBLP]


  131. A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks. [Citation Graph (, )][DBLP]


  132. A New Message Recognition Protocol for Ad Hoc Pervasive Networks. [Citation Graph (, )][DBLP]


  133. Authorship Proof for Textual Document. [Citation Graph (, )][DBLP]


  134. Brief announcement: secret sharing based on the social behaviors of players. [Citation Graph (, )][DBLP]


  135. Minimum node degree and kappa-connectivity for key predistribution schemes and distributed sensor networks. [Citation Graph (, )][DBLP]


  136. Key Refreshing in Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  137. Group Testing and Batch Verification. [Citation Graph (, )][DBLP]


  138. Sequentially Perfect and Uniform One-Factorizations of the Complete Graph. [Citation Graph (, )][DBLP]


  139. Putting Dots in Triangles [Citation Graph (, )][DBLP]


  140. Generalized mix functions and orthogonal equitable rectangles. [Citation Graph (, )][DBLP]


  141. On orthogonal generalized equitable rectangles. [Citation Graph (, )][DBLP]


Search in 0.081secs, Finished in 0.087secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002