Bibliography on Secret Sharing Schemes

maintained by Douglas Stinson and Ruizhong Wei
version 4.1
October, 1998

In the late 1980's, Gus Simmons compiled a bibliography of papers on secret sharing schemes. As far as we know, the most recent version of his bibliography was published in his book Contemporary Cryptology in 1992. At that time he had a list of 68 papers. We are not aware if Gus has continued to maintain his bibliography, but we felt it would be useful to create an up-to-date bibliography and make it available on the WWW ... so that is what we are doing here. The current version of this bibliography has 216 entries.

In general, we are including papers that are published or accepted for publication in conference proceedings and journals (but not unpublished technical reports, preprints or dissertations). We would appreciate knowing of any errors in this list, as well as any papers that should be added, updates to unpublished papers, etc. Please e-mail us.

See also the bibliography on authentication codes .

  1. R. Ahlswede and I. Csiszar, Common randomness in information theory and cryptography I: secret sharing, IEEE Transactions on Information Theory 39 (1993), 1121-1132.
  2. N. Alon, Z. Galil and M. Yung, Efficient dynamic-resharing "verifiable secret sharing" against mobile adversary, in "European Symposium on Algorithms 95", Lecture Notes in Computer Science979(1995), 523-537.
  3. C. A. Asmuth and G. R. Blakley, Pooling, Splitting and reconstituting information to overcome total failure of some channels of communication, in "Proceedings of the 1982 Symposium on Security and Privacy", IEEE Press, 1982, 156-169.
  4. C. A. Asmuth and J. Bloom, A modular approach to key safeguarding, IEEE Transactions on Information Theory 29 (1983), 208-210.
  5. G. Ateniese, C. Blundo, A. De Santis and D. R. Stinson, Visual cryptography for general access structures, Information and Computation 129 (1996), 86-106.
  6. G. Ateniese, C. Blundo, A. De Santis and D. R. Stinson, Constructions and bounds for visual cryptography, in "23rd International Colloquium on Automata, Languages and Programming", F. M. auf der Heide and B. Monien, eds., Lecture Notes in Computer Science 1099 (1996), 416-428.
  7. S. Barwick, Y. Desmedt and P. Wild, Homomorphic threshold schemes, k-arcs and Lenstra's constant, in "Cryptography and Coding IV", Oxford University Press, 1995, 95-102.
  8. P. Beguin and A. Cresti, General short computational secret sharing schemes, in "Advances in Cryptology -- EUROCRYPT '95", L. C. Guillou and J.-J. Quisquater, eds., Lecture Notes in Computer Science 921 (1995), 194-208.
  9. A. Beimel and B. Chor, Universally ideal secret sharing schemes, IEEE Transactions on Information Theory 40 (1994), 786-794. [Preliminary version appeared in "Advances in Cryptology -- CRYPTO '92", E. F. Brickell, ed., Lecture Notes in Computer Science 740 (1993), 183-195.]
  10. A. Beimel and B. Chor, Secret sharing with public reconstruction, IEEE Trans. on Info. Theory, 44(5):1887-1896, 1998. [Preliminary version appeard in "Advances in Cryptology -- CRYPTO '95", D. Coppersmith, ed., Lecture Notes in Computer Science 963 (1995), 353-366.]
  11. J. Cohen Benaloh, Secret sharing homomorphisms: keeping shares of a secret secret, in "Advances in Cryptology -- CRYPTO '86", A. M. Odlyzko, ed., Lecture Notes in Computer Science 263 (1987), 251-260.
  12. J. Benaloh and J. Leichter, Generalized secret sharing and monotone functions, in "Advances in Cryptology -- CRYPTO '88", S. Goldwasser, ed., Lecture Notes in Computer Science 403 (1989), 27-35.
  13. M. Ben-Or, S. Goldwasser and A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, in "20th Annual Symposium on Theory of Computing", ACM Press, 1988, 1-10.
  14. M. Bertilsson and I. Ingemarsson, A construction of practical secret sharing schemes using linear block codes, in "Advances in Cryptology -- AUSCRYPT '92", J. Seberry and Y. Zheng, eds., Lecture Notes in Computer Science 718 (1993), 67-79.
  15. T. Beth, H. J. Knobloch and M. Otten, Verifiable secret sharing for monotone access structures, in "1st ACM Conference on Computer and Communications Security", ACM Press, 1993, 189-194.
  16. A. Beutelspacher, Enciphered geometry: some applications of geometry to cryptography, in "Combinatorics '86", A. Barlotti, M. Marchi and G. Tallini, eds., Discrete Applied Mathematics 37 (1988), 59-68.
  17. A. Beutelspacher, How to say "no", in "Advances in Cryptology -- EUROCRYPT '89", J.-J. Quisquater and J. Vandewalle, eds., Lecture Notes in Computer Science 434 (1990), 491-496.
  18. A. Beutelspacher, Applications of finite geometry to cryptography, in "Geometries, Codes and Cryptography", G. Longo, M. Marchi and A. Sgarro, eds., CISM Courses and Lectures No. 313, Springer-Verlag, 1990, 161-186.
  19. A. Beutelspacher and K. Vedder, Geometric structures as threshold schemes, in "Cryptography and Coding", H. J. Beker and F. C. Piper, eds., Oxford University Press, 1989, 255-268.
  20. A. Beutelspacher and F. Wettl, On 2-level secret sharing, Designs, Codes and Cryptography 3 (1993), 127-134.
  21. I. Biehl and S. Wetzel, Traceable visual cryptography, in" Information and Communications Security", Lecture Notes in Computer Science 1334 (1997), 61-71.
  22. S. R. Blackburn, M. Burmester, Y. Desmedt and P. R. Wild, Efficient multiplicative sharing schemes, in "Advances in Cryptology -- EUROCRYPT '96", U. Maurer, ed., Lecture Notes in Computer Science 1070 (1996), 107-118.
  23. B. Blakley, G. R. Blakley, A. H. Chan and J. Massey, Threshold schemes with disenrollment, in "Advances in Cryptology -- CRYPTO '92", E. F. Brickell, ed., Lecture Notes in Computer Science 740 (1993), 540-548.
  24. G. R. Blakley, Safeguarding cryptographic keys, in "Proceedings of the National Computer Conference, 1979", American Federation of Information Processing Societies Proceedings 48 (1979), 313-317.
  25. G. R. Blakley, One-time pads are key safeguarding schemes, not cryptosystems: fast key safeguarding schemes (threshold schemes) exist, in "Proceedings of the 1980 Symposium on Security and Privacy", IEEE Press, 1980, 108-113.
  26. G. R. Blakley and R. D. Dixon, Smallest possible message expansion in threshold schemes, in "Advances in Cryptology -- CRYPTO '86", A. M. Odlyzko, ed., Lecture Notes in Computer Science 263 (1987), 266-274.
  27. G. R. Blakley and G. A. Kabatianski, Linear algebra approach to secret sharing schemes, in "Error Control, Cryptology, and Speech Compression", Lecture Notes in Computer Science 829 (1994), 33-40.
  28. G. R. Blakley and G. A. Kabatianski, On general perfect secret sharing schemes, in "Advances in Cryptology -- CRYPTO '95", D. Coppersmith, ed., Lecture Notes in Computer Science 963 (1995), 367-371.
  29. G. R. Blakley and C. Meadows, Security of ramp schemes, in "Advances in Cryptology -- CRYPTO '84", G. R. Blakley and D. Chaum, eds., Lecture Notes in Computer Science 196 (1985), 242-268.
  30. G. R. Blakley and L. Swanson, Security proofs for information protection systems, in "Proceedings of the 1981 Symposium on Security and Privacy", IEEE Press, 1981, 75-82.
  31. G. R. Blakley and L. Swanson, Infinite structures in information theory, in "Advances in Cryptology -- CRYPTO '82", D. Chaum, R. L. Rivest and A. T. Sherman, eds., Plenum Press, 1983, 39-50.
  32. R. G. Bleuikli and G. A. Kabatyanskiuli, Generalized ideal secret sharing schemes and matroids, Problems Infrom. Transmission, 33(1997), 277-284.
  33. C. Blundo, A note on dynamic threshold schemes, Information Processing Letters 55 (1995), 189-193.
  34. C. Blundo, A. Cresti, A. De Santis and U. Vaccaro, Fully dynamic secret sharing schemes, Theoretical Computer Science 155 (1996), 407-410. [Preliminary version appeared in "Advances in Cryptology -- CRYPTO '93", D. R. Stinson, ed., Lecture Notes in Computer Science 773 (1994), 110-125.]
  35. C. Blundo and A. De Santis, On the construction of secret sharing schemes, in "Structure: From Physics to General Systems, Festschrift in honour of E. Caianiello", M. Marinaro and G. Scarpetta, eds., World Scientific, 1992, 245-261.
  36. C. Blundo and A. De Santis, Lower bounds for robust secret sharing schemes, Inform. Process. Lett. 63(1997), 317-321.
  37. C. Blundo, A. De Santis, R. De Simone and U. Vaccaro, Tight bounds on the information rate of secret sharing schemes, Designs, Codes and Cryptography 11 (1997), 107-122.
  38. C. Blundo, A. De Santis, G. Di Crescenzo, A. Giorgio Gaggia and U. Vaccaro, Multi-secret sharing schemes, in "Advances in Cryptology -- CRYPTO '94", Y. G. Desmedt, ed., Lecture Notes in Computer Science 839 (1994), 150-163.
  39. C. Blundo, A. De Santis, R. De Simone and U. Vaccaro, New bounds on the share's size in secret sharing schemes, in "PRAGOCRYPT '96", CTU Publishing House, 1996, 349-358.
  40. C. Blundo, A. De Santis, L. Gargano and U. Vaccaro, On the information rate of secret sharing schemes, Theoretical Computer Science 154 (1996), 283-306. [Preliminary version appeared in ``Advances in Cryptology -- CRYPTO '92'', E. F. Brickell, ed., Lecture Notes in Computer Science 740 (1993), 148-167.]
  41. C. Blundo, A. De Santis, L. Gargano and U. Vaccaro, Secret sharing with veto capabilities, in "Algebraic Coding, First French-Israeli Workshop", G. Cohen, S. Litsyn, A. Lobstein and G. Zemor, eds., Lecture Notes in Computer Science 781 (1993), 82-89.
  42. C. Blundo, A. De Santis, A. Giorgio Gaggia, and U. Vaccaro, Lower Bounds in Secret Sharing Schemes, in " ISIT '94 ", 1994, 491.
  43. C. Blundo, A. De Santis, A. Giorgio Gaggia and U. Vaccaro, New bounds on the information rate of secret sharing schemes, IEEE Transactions on Information Theory 41 (1995), 549-554.
  44. C. Blundo, A. De Santis and D. R. Stinson, On the contrast in visual cryptography schemes, Journal of Cryptology , to appear.
  45. C. Blundo, A. De Santis, D. R. Stinson and U. Vaccaro, Graph decompositions and secret sharing schemes, J. Cryptology 8 (1995), 39-64. [Preliminary version appeared in "Advances in Cryptology -- EUROCRYPT '92", R. A. Rueppel, ed., Lecture Notes in Computer Science 658 (1993), 1-24.]
  46. C. Blundo, A. De Santis and U. Vaccaro, Efficient sharing of many secrets, in "10th Annual Symposium on Theoretical Aspects of Computer Science", P. Enjalbert, A. Finnkel and K. Wagner, eds., Lecture Notes in Computer Science 665 (1993), 692-703.
  47. C. Blundo, A. De Santis and U. Vaccaro, Randomness in distribution protocols, Information and Computation 131 (1996), 111-139. [Preliminary version appeared in "Automata, Languages and Programming, 21st International Colloquium", S. Abiteboul and E. Shamir, eds., Lecture Notes in Computer Science 820 (1994), 568-579.]
  48. C. Blundo, A. De Santis and U. Vaccaro, On secret sharing schemes, Inform. Process. Lett. 65 (1998), 25-32.
  49. C. Blundo, A. Giorgia Gaggia and D. R. Stinson, On the dealer's randomness required in secret sharing schemes, Designs, Codes and Cryptography 11 (1997), 107-122. [Preliminary version appeared in "Advances in Cryptology -- EUROCRYPT '94", A. De Santis, ed., Lecture Notes in Computer Science 950 (1995), 35-46.]
  50. C. Blundo and D. R. Stinson, Anonymous secret sharing schemes, Discrete Applied Mathematics 77 (1997), 13-28.
  51. E. F. Brickell, Some ideal secret sharing schemes, Journal of Combinatorial Mathematics and Combinatorial Computing 6 (1989), 105-113. [Preliminary version appeared in "Advances in Cryptology -- EUROCRYPT '89", J.-J. Quisquater and J. Vandewalle, eds., Lecture Notes in Computer Science 434 (1990), 468-475.]
  52. E. F. Brickell and D. M. Davenport, On the classification of ideal secret sharing schemes, J. Cryptology 4 (1991), 123-134. [Preliminary version appeared in "Advances in Cryptology -- CRYPTO '89", G. Brassard, ed., Lecture Notes in Computer Science 435 (1990), 278-285.]
  53. E. F. Brickell and D. R. Stinson, The detection of cheaters in threshold schemes, SIAM Journal of Discrete Mathematics 4 (1991), 502-510. [Preliminary version appeared in "Advances in Cryptology -- CRYPTO '88", S. Goldwasser, ed., Lecture Notes in Computer Science 403 (1989), 564-577.]
  54. E. F. Brickell and D. R. Stinson, Some improved bounds on the information rate of perfect secret sharing schemes, J. Cryptology 5 (1992), 153-166. [Preliminary version appeared in "Advances in Cryptology -- CRYPTO '90", A. J. Menezes and S. A. Vanstone, eds., Lecture Notes in Computer Science 537 (1991), 242-252.]
  55. M. Burmester, Homomorphisms of sharing schemes: a tool for verifiable signature sharing, in "Advances in Cryptology -- EUROCRYPT '96", U. Maurer, ed., Lecture Notes in Computer Science 1070 (1996), 96-106.
  56. C. Cachin, On-line secret sharing, in "Cryptography and Coding V", C. Boyd, ed., Lecture Notes in Computer Science 1025 (1996), 190-198.
  57. Z. Cao, Finite set theory and its application to cryptology, Journal of Statistical Planning and Inference 51 (1996), 129-136.
  58. R. M. Capocelli, A. De Santis, L. Gargano and U. Vaccaro, On the size of shares in secret sharing schemes, J. Cryptology 6 (1993), 157-167. [Preliminary version appeared in "Advances in Cryptology -- CRYPTO '91", J. Feigenbaum, ed., Lecture Notes in Computer Science 576 (1992), 101-113.]
  59. R. M. Capocelli, A. De Santis, L. Gargano and U. Vaccaro, A note on secret sharing schemes, in "Sequences II: Methods in Communication, Security and Computer Science", R. Capocelli and A. De Santis, eds., Springer Verlag, 1993, 335-344.
  60. M. Carpentieri, A perfect threshold secret sharing scheme to identify cheaters, Designs, Codes and Cryptography 5 (1995), 183-188.
  61. M. Carpentieri, Some democratic secret sharing schemes, Discrete Applied Mathematics 59 (1995), 293-298.
  62. M. Carpentieri, A. De Santis and U. Vaccaro, Size of shares and probability of cheating in threshold schemes, in "Advances in Cryptology -- EUROCRYPT '93", T. Helleseth, ed., Lecture Notes in Computer Science 765 (1994), 118-125.
  63. C. Charnes, K. M. Martin, J. Pieprzyk and R. Safavi-Naini, Sharing secret information in hierarchical groups, in "Information and Communications Security", Lecture Notes in Computer Science 1334(1997) 81-86.
  64. C. Charnes and J. Pieprzyk, Cumulative arrays and generalised Shamir secret sharing schemes, in "17th Australasian Computer Science Conference", Australian Computer Science Communications 16 (1994), 519-528.
  65. C. Charnes and J. Pieprzyk, Generalised cumulative arrays and their application to secret sharing schemes, in "18th Australasian Computer Science Conference", Australian Computer Science Communications 17 (1995), 61-65.
  66. C. Charnes, J. Pieprzyk and R. Safavi-Naini, Conditionally secure secret sharing scheme with disenrollment capability, in "2nd ACM Conference on Computer and Communications Security", ACM Press, 1994, 89-95.
  67. G. R. Chaudry and J. Seberry, Secret sharing schemes based on Room squares, in "Combinatorics, Complexity and Logic", Springer-Verlag, 1997, 158-167.
  68. D. Chaum, How to keep a secret alive, extensible partial key, key safeguarding, and threshold systems, in "Advances in Cryptology -- CRYPTO '84", G. R. Blakley and D. Chaum, eds., Lecture Notes in Computer Science 196 (1985), 481-485.
  69. D. Chaum, C. Crepeau and I. Damgard, Multiparty unconditionally secure protocols, in: " Proc. 20th Annual Symp. on Theory of Computing", ACM, (1988), 11-19.
  70. D. Chen and D. R. Stinson, Recent results on combinatorial constructions for threshold schemes, Australasian Journal of Combinatorics 1 (1990), 29-48.
  71. L. Chen, D. Gollmann, C. J. Mitchell and P. Wild, Secret sharing with reusable polynomials, in "Information Security and Privacy -- ACISP '97", V. Varadharajan, J. Pieprzyk and Y. Mu, eds., Lecture Notes in Computer Science 1270 (1997), 183-193.
  72. B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults, in "Proceedings of the 26th IEEE Symposium on the Foundations of Computer Science", IEEE Press, 1985, 383-395.
  73. B. Chor and E. Kushilevitz, Secret sharing over infinite domains, J. Cryptology 6 (1993), 87-95. [Preliminary version appeared in "Advances in Cryptology -- CRYPTO '89", G. Brassard, ed., Lecture Notes in Computer Science 435 (1990), 299-306.]
  74. J. Cooper, D. Donovan and J. Seberry, Secret sharing schemes arising from latin squares, Bulletin of the Institute of Combinatorics and its Applications 12 (1994), 33-43.
  75. R. Cramer, I. Damgard and B. Schoenmakers, Proofs of partial knowledge and simplified design of witness hiding protocols, in "Advances in Cryptology -- CRYPTO '94", Y. G. Desmedt, ed., Lecture Notes in Computer Science 839 (1994), 174-187.
  76. R. A. Croft and S. P. Harris, Public-key cryptography and re-usable shared secrets, in "Cryptography and Coding", H. J. Beker and F. C. Piper, eds., Oxford University Press, 1989, 189-201.
  77. L. Czirimaz, The size of a share must be large, Journal of Cryptology 10 (1997), 223-231. [Preliminary version appeared in "Advances in Cryptology -- EUROCRYPT '94", A. De Santis, ed., Lecture Notes in Computer Science 950 (1995), 13-22.]
  78. L. Czirimaz, The dealer's random bits in secret sharing schemes, Studia Sci. Math. Hungar. 32 (1996), 429-437.
  79. G. I. Davida, R. DeMillo and R. Lipton, Protecting shared cryptographic keys, in "Proceedings of the 1980 Symposium on Security and Privacy", IEEE Press, 1980, 100-102.
  80. E. Dawson and D. Donovan, Shamir's scheme says it all, in "Computer Security", E. G. Dougall, ed., North-Holland, 1993, 91-102.
  81. E. Dawson and D. Donovan, The breadth of Shamir's secret sharing scheme, Computers and Security 13 (1994), 69-78.
  82. E. Dawson, E. S. Mahmoodian and A. Rahilly, Orthogonal arrays and ordered threshold schemes, Australasian Journal of Combinatorics 8 (1993), 27-44.
  83. J. Denes and A. D. Keedwell, On Golomb-Posner codes and a remark of W. W. Wu about secret-sharing systems, IEEE Trans. Comm. 38 (1990), 261-262.
  84. A. De Santis, Y. Desmedt and Y. Frankel, How to share a function securely, in "26th Annual Symposium on Theory of Computing", ACM Press, 1994, 522-533.
  85. A. De Santis, G. Di Crescenzo and G. Persiano, Secret sharing and perfect zero knowledge, in "Advances in Cryptology -- CRYPTO '93", D. R. Stinson, ed., Lecture Notes in Computer Science 773 (1994), 73-84.
  86. Y. Desmedt, Threshold cryptography, European Transactions on Telecommunications 5 (1994), 449-457.
  87. Y. Desmedt and Y. Frankel, Threshold cryptosystems, in "Advances in Cryptology -- CRYPTO '89", G. Brassard, ed., Lecture Notes in Computer Science 435 (1990), 307-315.
  88. Y. Desmedt and Y. Frankel, Shared generation of authenticators and signatires, in "Advances in Cryptology -- CRYPTO '91", J. Feigenbaum, ed., Lecture Notes in Computer Science 576 (1992), 457-469.
  89. Y. Desmedt and Y. Frankel, Homomorphic zero-knowledge threshold schemes over any finite abelian group, SIAM Journal of Discrete Mathematics 7 (1994), 667-679. [Preliminary version appeared in "Sequences II: Methods in Communication, Security and Computer Science", R. Capocelli and A. De Santis, eds., Springer Verlag, 1993, 369-378.]
  90. Y. Desmedt, Y. Frankel and M. Yung, Multi-reciever/multi-sender network security: efficient authenticated multicast/feedback, in "IEEE INFOCOM '92", IEEE Press, 1992, 2045-2054.
  91. Y. Desmedt, G. di Crescenzo and M. Burmester, Multiplicative non-abelian sharing schemes and their application to threshold cryptography, in "Advances in Cryptology -- ASIACRYPT '94", J. Pieprzyk and R. Safavi-Naini, eds., Lecture Notes in Computer Science 917 (1995), 21-32.
  92. M. De Soete, Geometric threshold schemes, in "Geometries, Codes and Cryptography", G. Longo, M. Marchi and A. Sgarro, eds., CISM Courses and Lectures No. 313, Springer-Verlag, 1990, 201-212.
  93. M. De Soete and K. Vedder, Some new classes of geometric threshold schemes, in "Advances in Cryptology -- EUROCRYPT '88", C. G. Gunther, ed., Lecture Notes in Computer Science 330 (1988), 389-401.
  94. M. van Dijk, On the information rate of perfect secret sharing schemes, Designs, Codes and Cryptography 6 (1995), 143-169.
  95. M. van Dijk, More information theoretical inequalities to be used in secret sharing?, Information Processing Letters 63 (1997), 41-44.
  96. M. van Dijk, A linear construction of secret sharing schemes, Designs, Codes and Cryptography 12 (1997), 161-201. [Preliminary version appeared in "Advances in Cryptology -- EUROCRYPT '94", A. De Santis, ed., Lecture Notes in Computer Science 950 (1995), 23-34. ]
  97. M. van Dijk, W.-A. Jackson and K. M. Martin, A note on duality in linear secret sharing schemes, Bulletin of the Institute of Combinatorics and its Applications 19 (1997), 93-101.
  98. D. Donovan, Some interesting constructions for secret sharing schemes, Australasian Journal of Combinatorics 9 (1994), 37-65.
  99. S. Droste, New results on visual cryptography, in "Advances in Cryptology -- CRYPTO '96", N. Koblitz, ed., Lecture Notes in Computer Science 1109 (1996), 401-415.
  100. C. Dwork, On verification in secret sharing, in "Advances in Cryptology -- CRYPTO '91", J. Feigenbaum, ed., Lecture Notes in Computer Science 576 (1992), 114-128.
  101. C. Dwork, Strong verifiable secret sharing, in "Proceedings of the 4th International Workshop on Distributed Algorithms", Lecture Notes in Computer Science 486 (1991), 213-227.
  102. T. Etzion, On threshold schemes from large sets, J. Combin. Des. 4 (1996), 323-338.
  103. P. Feldman, A practical scheme for non-interactive verifiable secret sharing, in "Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science", IEEE Press, 1987, 427-437.
  104. P. Feldman and S. Micali, Optimal algorithms for Byzantine agreement, in:" Proc. 20th Annual Symp. on Theory of Computing, ACM, (1988), 148-161.
  105. Y. Frankel and Y. Desmedt, Classification of ideal homomorphic threshold schemes over finite abelian groups, in "Advances in Cryptology -- EUROCRYPT '92", R. A. Rueppel, ed., Lecture Notes in Computer Science 658 (1993), 25-34.
  106. Y. Frankel, Y. Desmedt and M. Burmester, Non-existence of homomorphic general sharing schemes for some key spaces, in "Advances in Cryptology -- CRYPTO '92", E. F. Brickell, ed., Lecture Notes in Computer Science 740 (1993), 549-557.
  107. M. K. Franklin and M. K. Reiter, Verifiable signature sharing, in "Advances in Cryptology -- EUROCRYPT '95", L. C. Guillou and J.-J. Quisquater, eds., Lecture Notes in Computer Science 921 (1995), 50-63.
  108. R. Gennaro and S. Micali, Verifiable secret sharing as secure computation, in "Advances in Cryptology -- EUROCRYPT '95", L. C. Guillou and J.-J. Quisquater, eds., Lecture Notes in Computer Science 921 (1995), 168-182.
  109. R. Gennaro M. O. Rabin, and T. Rabin, Simplified VSS and fast-track multiparty computations with applications to threshold cryptography, in: " Proc. of 1998 ACM Symp. on Priciples of Distributed Computing", to appear.
  110. H. Ghodosi, J. Pieprzyk and Safavi-Naini, Remarks on the multiple assignment secret sharing scheme, Lecture Notes in Computer Science 1334 (1997), 72-82.
  111. O. Goldreich, S. Micali and A. Wigderson, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, J. ACM 38(1991), 691-729.
  112. J. Dj. Golic, On matroid characterization of ideal secret sharing schemes, J. Cryptology 11 (1998), 75-86.
  113. S. Harari, Secret sharing systems, in "Secure Digital Communications", G. Longo, ed., CISM Courses and Lectures No. 279, Springer-Verlag, 1983, 105-110.
  114. S. Harari, Application des codes correcteurs au partage du secret, Traitement Signal 4 (1987), 353-356.
  115. L. Harn and H.-Y. Lin, An l-span generalized secret sharing scheme, in "Advances in Cryptology -- CRYPTO '92", E. F. Brickell, ed., Lecture Notes in Computer Science 740 (1993), 558-565.
  116. J. He and E. Dawson, Multistage secret sharing based on one-way function, Electronics Letters 30 (1994), 1591-1592.
  117. J. He and E. Dawson, Multisecret-sharing scheme based on one-way function, Electronics Letters 31 (1995), 93-95.
  118. J. He and E. Dawson, How to fairly reconstruct a shared secret, in "Cryptography: Policy and Algorithms", Lecture Notes in Computer Science 1029 (1996), 115-124.
  119. A. Herzberg, S. Jarecki, H. Krawczyk and M. Yung, Proactive secret sharing or how to cope with perpetual leakage, in "Advances in Cryptology -- CRYPTO '95", D. Coppersmith, ed., Lecture Notes in Computer Science 963 (1995), 339-352.
  120. T. Hofmeister, M. Krause and H. U. Simon, Contrast-optimal k out of n secret sharing schemes in visual cryptography, in "Computing and Combinatorics -- COCOON '97", Lecture Notes in Computer Science 1276 (1997), 176-185.
  121. S.-J. Hwang and C.-C. Chang, A dynamic secret sharing scheme with cheater detection, in "Information Security and Privacy '96", J. Pieprzyk and J. Seberry, eds., Lecture Notes in Computer Science 1172 (1996), 48-55.
  122. T. Hwang, Protocols for group oriented secret sharing, Information Processing Letters 42 (1992), 179-182.
  123. I. Ingemarsson and G. J. Simmons, A protocol to set up shared secret schemes without the assistance of a mutually trusted party, in "Advances in Cryptology -- EUROCRYPT '90", I. B. Damgard, ed., Lecture Notes in Computer Science 473 (1991), 266-282.
  124. M. Ito, A. Saito and T. Nishizeki, Secret sharing scheme realizing general access structure, in "Proceedings of the IEEE Global Telecommunications Conference, Globecom '87", IEEE Press, 1987, 99-102.
  125. M. Ito, A. Saito and T. Nishizeki, Secret sharing scheme realizing general access structure, Electron. Comm. Japan Part III Fund. Electron. Sci. 72 (1989), 56-63.
  126. M. Ito, A. Saito and T. Nishizeki, Multiple assignment scheme for sharing secret, J. Cryptology 6 (1993), 15-20.
  127. W.-A. Jackson and K. M. Martin, Cumulative arrays and geometric secret sharing schemes, in "Advances in Cryptology -- AUSCRYPT '92", J. Seberry and Y. Zheng, eds., Lecture Notes in Computer Science 718 (1993), 48-55.
  128. W.-A. Jackson and K. M. Martin, Geometric secret sharing schemes and their duals, Designs, Codes and Cryptography 4 (1994), 83-95.
  129. W.-A. Jackson and K. M. Martin, Combinatorial models for perfect secret sharing schemes, to appear in Journal of Combinatorial Mathematics and Combinatorial Computing.
  130. W.-A. Jackson and K. M. Martin, Efficient constructions for one sharing of many secrets, Australasian Journal of Combinatorics 14 (1996), 283-296.
  131. W.-A. Jackson and K. M. Martin, A combinatorial interpretation of ramp schemes, Australasian Journal of Combinatorics 14 (1996), 51-60.
  132. W.-A. Jackson and K. M. Martin, Perfect secret sharing schemes on five participants, Designs, Codes and Cryptography 9 (1996), 267-286.
  133. W.-A. Jackson, K. M. Martin and C. M. O'Keefe, Multisecret threshold schemes, in "Advances in Cryptology -- CRYPTO '93", D. R. Stinson, ed., Lecture Notes in Computer Science 773 (1994), 126-135.
  134. W.-A. Jackson, K. M. Martin and C. M. O'Keefe, On sharing many secrets, in "Advances in Cryptology -- ASIACRYPT '94", J. Pieprzyk and R. Safavi-Naini, eds., Lecture Notes in Computer Science 917 (1995), 42-54.
  135. W.-A. Jackson, K. M. Martin and C. M. O'Keefe, Efficient secret sharing without a mutually trusted authority, in "Advances in Cryptology -- EUROCRYPT '95", L. C. Guillou and J.-J. Quisquater, eds., Lecture Notes in Computer Science 921 (1995), 183-193.
  136. W.-A. Jackson, K. M. Martin and C. M. O'Keefe, A construction for multisecret threshold schemes, Designs, Codes and Cryptography 9 (1996), 287-303.
  137. W.-A. Jackson, K. M. Martin and C. M. O'Keefe, Ideal secret sharing schemes with multiple secrets, Journal of Cryptology 9 (1996), 233-250.
  138. W.-A. Jackson, K. M. Martin and C. M. O'Keefe, Mutually trusted authority-free secret sharing schemes, Journal of Cryptology 10 (1997), 261-289.
  139. E. D. Karnin, J. W. Greene and M. E. Hellman, On secret sharing systems, IEEE Transactions on Information Theory 29 (1983), 35-41.
  140. S. C. Kothari, Generalized linear threshold scheme, in "Advances in Cryptology -- CRYPTO '84", G. R. Blakley and D. Chaum, eds., Lecture Notes in Computer Science 196 (1985), 231-241.
  141. K. Koyama, Cryptographic key sharing methods for multi-groups and security analysis, Transactions of the IECE Japan E66 (1983), 13-20.
  142. H. Krawczyk, Secret sharing made short, in "Advances in Cryptology -- CRYPTO '93", D. R. Stinson, ed., Lecture Notes in Computer Science 773 (1994), 136-146.
  143. K. Kurosawa, S. Obana and W. Ogata, t-cheater identifiable (k,n) threshold secret sharing schemes, in "Advances in Cryptology -- CRYPTO '95", D. Coppersmith, ed., Lecture Notes in Computer Science 963 (1995), 410-423.
  144. K. Kurosawa and K. Okada, Combinatorial interpretation of secret sharing schemes, in "Advances in Cryptology -- ASIACRYPT '94", J. Pieprzyk and R. Safavi-Naini, eds., Lecture Notes in Computer Science 917 (1995), 55-64.
  145. K. Kurosawa and K. Okada, Combinatorial lower bounds for secret sharing schemes, Information Processing Letters 60 (1996), 301-304. [This is a revised version of the previous paper.]
  146. K. Kurosawa, K. Okada, K. Sakano, W. Ogata and S. Tsujii, Nonperfect secret sharing schemes and matroids, in "Advances in Cryptology -- EUROCRYPT '93", T. Helleseth, ed., Lecture Notes in Computer Science 765 (1994), 126-141.
  147. C.-S. Laih, L. Harn, J.-Y. Lee and T. Hwang, Dynamic threshold scheme based on the definition of a cross-product in an n-dimensional linear space, in "Advances in Cryptology -- CRYPTO '89", G. Brassard, ed., Lecture Notes in Computer Science 435 (1990), 286-298.
  148. C. Laih, J. Lee and L. Harn, A new threshold scheme and its applications in designing the conference key distribution cryptosystem, Information Processing Letters 32 (1989), 95-99.
  149. H.-Y. Lin and L. Harn, A generalized secret sharing scheme with cheater detection, in "Advances in Cryptology -- ASIACRYPT '91", H. Imai, R. L. Rivest and T. Matsumoto, eds., Lecture Notes in Computer Science 739 (1993), 149-158.
  150. H.-Y. Lin and L. Harn, Fair reconstruction of a secret, Information Processing Letters 55 (1995), 45-48.
  151. P. L. Lin and J. G. Dunham, A secret sharing model: GS^3, IEE Electronics Letters 30 (1994), 2116-2118.
  152. W. Mao, Necessity and relization of universally verifiable secret sharing, in: "IEEE Symp. on Security and Privacy", to appear.
  153. K. M. Martin, Untrustworthy participants in perfect secret sharing schemes, in "Cryptography and Coding III", M. J. Ganley, ed., Oxford University Press, 1993, 255-264.
  154. K. M. Martin, New secret sharing schemes from old, Journal of Combinatorial Mathematics and Combinatorial Computing 14 (1993), 65-77.
  155. J. L. Massey, Minimal codewords and secret sharing, in "Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory", 1993, 276-279.
  156. J. L. Massey, Some applications of coding theory in cryptography, in "Cryptography and Coding IV", Oxford University Press, 1995, 33-47.
  157. A. Mayer and M. Yung, Generalized secret sharing and group-key distribution using short keys, in "Proc. of Sequences '97".
  158. R. J. McEliece and D. Sarwate, On sharing secrets and Reed-Solomon codes, Communications of the ACM 24 (1981), 583-584.
  159. C. Meadows, Some threshold schemes without central key distributors, Congressus Numerantium 46 (1985), 187-199.
  160. S. Micali, Fair public-key cryptosystems, in "Advances in Cryptology -- CRYPTO '92", E. F. Brickell, ed., Lecture Notes in Computer Science 740 (1993), 113-138.
  161. S. Micali and T. Rabin, Collective coin tossing without assumptions nor broadcasting, in "Advances in Cryptology -- CRYPTO '90", A. J. Menezes and S. A. Vanstone, eds., Lecture Notes in Computer Science 537 (1991), 253-266.
  162. M. Mignotte, How to share a secret, in "Cryptography Proceedings, Burg Feuerstein 1982", T. Beth, ed., Lecture Notes in Computer Science 149 (1983), 371-375.
  163. C. J. Mitchell, F. C. Piper, M. Walker and P. Wild, Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes, Designs, Codes and Cryptography 7 (1996), 101-110.
  164. M. Naor and B. Pinkas, Visual authentication and identification, in "Advances in Cryptology -- CRYPTO '97", B. Kaliski, Jr., ed., Lecture Notes in Computer Science 1294 (1997), 322-336.
  165. M. Naor and A. Shamir, Visual cryptography, in "Advances in Cryptology -- EUROCRYPT '94", A. De Santis, ed., Lecture Notes in Computer Science 950 (1995), 1-12.
  166. M. Naor and A. Shamir, Visual cryptography II: improving the constrast via the cover base, in "Security Protocols", M. Lomas, ed., Lecture Notes in Computer Science 1189 (1997), 197-202.
  167. M. Naor and A. Wool, Access control and signatures via quorum secret sharing, in "3rd ACM Conference on Communication and Computer Security", 1996.
  168. S. Obana and K. Kurosawa, Veto is impossible in secret sharing schemes, Information Processing Letters 58 (1996), 293-295.
  169. W. Ogata and K. Kurosawa, Optimum secret sharing scheme secure against cheating, in "Advances in Cryptology -- EUROCRYPT '96", U. Maurer, ed., Lecture Notes in Computer Science 1070 (1996), 200-211.
  170. W. Ogata, K. Kurosawa and S. Tsujii, Nonperfect secret sharing schemes, in "Advances in Cryptology -- AUSCRYPT '92", J. Seberry and Y. Zheng, eds., Lecture Notes in Computer Science 718 (1993), 56-66.
  171. K. Okada and K. Kurosawa, Lower bound on the size of shares of nonperfect secret sharing schemes, in "Advances in Cryptology -- ASIACRYPT '94", J. Pieprzyk and R. Safavi-Naini, eds., Lecture Notes in Computer Science (1995), 33-41.
  172. K. Okada, W. Ogata, K. Sakano and K. Kurosawa, Analysis on secret sharing schemes with non-graphical access structures, IEICE Transactions Fundamentals, E80-A (1997), 85-89.
  173. C. M. O'Keefe, Applications of finite geometries to information security, Australasian Journal of Combinatorics 7 (1993), 195-212.
  174. R. Ostrosky and M. Yung, How to withstand mobile virus attacks, in: " ACM Symp. on Priciples of Distributed Computing", 1991, 51-59.
  175. T. P. Pedersen, Non-interactive and information-theoretic secure verifiable secret sharing, in "Advances in Cryptology -- CRYPTO '91", J. Feigenbaum, ed., Lecture Notes in Computer Science 576 (1992), 129-140.
  176. S. J. Phillips and N. C. Phillips, Strongly ideal secret sharing schemes, J. Cryptology 5 (1992), 185-191.
  177. R. G. E. Pinch, On-line multiple secret sharing, Electronics Letters 32 (1996), 1087-1088.
  178. T. Rabin, Robust sharing of secrets when the dealer is honest or cheating, Journal of the ACM 41 (1994), 1089-1109.
  179. T. Rabin and M. Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, in "21st Annual Symposium on Theory of Computing", ACM Press, 1989, 73-85.
  180. A. Renvall and C. Ding, A nonlinear secret sharing scheme, in "Information Security and Privacy '96", J. Pieprzyk and J. Seberry, eds., Lecture Notes in Computer Science 1172 (1996), 56-66.
  181. A. Renvall and C. Ding, The access structure of some secret sharing schemes, in "Information Security and Privacy '96", J. Pieprzyk and J. Seberry, eds., Lecture Notes in Computer Science 1172 (1996), 67-78.
  182. J. Rifa-Coma, How to avoid the cheaters succeeding in the key sharing scheme, Designs, Codes and Cryptography 3 (1993), 221-228.
  183. P. J. Schellenberg and D. R. Stinson, Threshold schemes from combinatorial designs, Journal of Combinatorial Mathematics and Combinatorial Computing 5 (1989), 143-160.
  184. P. D. Seymour, On secret sharing matroids, Journal of Combinatorial Theory B 56 (1992), 69-73.
  185. A. Shamir, How to share a secret, Communications of the ACM 22 (1979), 612-613.
  186. S. P. Shieh and H. M. Sun, On constructing secret sharing schemes, in "Infocom '94 Proceedings", IEEE Press, 1994, 1288-1292.
  187. G. J. Simmons, How to (really) share a secret, in "Advances in Cryptology -- CRYPTO '88", S. Goldwasser, ed., Lecture Notes in Computer Science 403 (1989), 390-448.
  188. G. J. Simmons, Prepositioned shared secret and/or shared control schemes, in "Advances in Cryptology -- EUROCRYPT '89", J.-J. Quisquater and J. Vandewalle, eds., Lecture Notes in Computer Science 434 (1990), 436-467.
  189. G. J. Simmons, Robust secret sharing schemes or "How to be sure you have the right answer even though you don't know the question", Congressus Numerantium 68 (1989), 215-248.
  190. G. J. Simmons, Geometric shared secret and/or shared control schemes, in "Advances in Cryptology -- CRYPTO '90", A. J. Menezes and S. A. Vanstone, eds., Lecture Notes in Computer Science 537 (1991), 216-241.
  191. G. J. Simmons, An introduction to shared secret and/or shared control schemes and their application, in "Contemporary Cryptology, The Science of Information Integrity", G. J. Simmons, ed., IEEE Press, 1992, 441-497.
  192. G. J. Simmons, The consequences of trust in shared secret schemes, in "Advances in Cryptology -- EUROCRYPT '93", T. Helleseth, ed., Lecture Notes in Computer Science 765 (1994), 448-452.
  193. G. J. Simmons, W.-A. Jackson and K. M. Martin, The geometry of shared secret schemes, Bulletin of the Institute of Combinatorics and its Applications 1 (1991), 71-88.
  194. G. J. Simmons and C. Meadows, The role of trust in information security protocols, Journal of Computer Security 3 (1994/1995), 71-84.
  195. M. Stadler, Publicly verifiable secret sharing, in "Advances in Cryptology -- EUROCRYPT '96", U. Maurer, ed., Lecture Notes in Computer Science 1070 (1996), 190-199.
  196. D. R. Stinson, An explication of secret sharing schemes, Designs, Codes and Cryptography 2 (1992), 357-390.
  197. D. R. Stinson, New general lower bounds on the information rate of perfect secret sharing schemes, in "Advances in Cryptology -- CRYPTO '92", E. F. Brickell, ed., Lecture Notes in Computer Science 740 (1993), 168-182.
  198. D. R. Stinson. Combinatorial designs and cryptography, in "Surveys in Combinatorics, 1993", K. Walker, ed., Cambridge University Press, 1993, 257--287.
  199. D. R. Stinson, Decomposition constructions for secret sharing schemes, IEEE Transactions on Information Theory 40 (1994), 118-125.
  200. D. R. Stinson, Visual cryptography and threshold schemes, Dr. Dobb's Journal April 1998, 36-43.
  201. D. R. Stinson and S. A. Vanstone, A combinatorial approach to threshold schemes, SIAM Journal of Discrete Mathematics 1 (1988), 230-236. [Preliminary version appeared in "Advances in Cryptology -- CRYPTO 87", C. Pomerance, ed., Lecture Notes in Computer Science 293 (1988), 330-339.]
  202. H.-M. Sun and B.-L. Chen, On the decomposition constructions for perfect secret sharing schemes, in "Information and Communications Security, Lecture Notes in Computer Science, 1334 (1997), 50-60.
  203. H.-M. Sun and S.-P. Shieh, On dynamic threshold schemes, Information Processing Letters 52 (1994), 201-206.
  204. H.-M. Sun and S.-P. Shieh, An efficient construction of perfect secret sharing schemes for graph-based access structures, Computers and Mathematics with Applictions 31 (1996), 129-135.
  205. M. Tompa and H. Woll, How to share a secret with cheaters, J. Cryptology 1 (1988), 133-138. [Preliminary version appeared in "Advances in Cryptology -- CRYPTO '86", A. M. Odlyzko, ed., Lecture Notes in Computer Science 263 (1987), 261-265.]
  206. T. Uehara, T. Nishizeki, E. Okamoto and K. Nakamura, A secret sharing system with matroidal access structure, Transactions of the IECE Japan J69-A 9 (1986), 1124-1132.
  207. H. Unterwalcher, A department threshold scheme based on algebraic equations, Contributions to General Algebra 6 (1988), 287-298.
  208. E. R. Verheul and H. C. A. van Tilborg, Constructions and properties of k out of n visual secret sharing schemes, Designs, Codes and Cryptography 11 (1997), 179-196.
  209. W. D. Wallis, Not all perfect extrinsic secret sharing schemes are ideal, Australasian Journal of Combinatorics 2 (1990), 237-238.
  210. T.-C. Wu and W.-H. He, A geometric approach for sharing secrets, Computers and Security 14 (1995), 135-146.
  211. T.-C. Wu and T.-S. Wu, Cheating detection and cheater identification in secret sharing schemes, IEE Transactions on Computers and Digital Techniques 142 (1995), 367-369.
  212. H. Yamamoto, On secret sharing systems using (k,L,n)-threshold scheme, Transactions of the IECE Japan J68-A (1985), 945-952.
  213. H. Yamamoto, Secret sharing system using (k,L,n)-threshold scheme, Electron. Comm. Japan Part I Comm. 69 (1986), 46-64.
  214. X. B. Zhang, Constructions for perfect threshold schemes, in "Combinatorics and Graph Theory", H. P. Yap, T. H. Ku, E. K. Lloyd and Z. M. Wang, eds., World Scientific, 1993, 87-90.
  215. Y. Zheng, T. Hardjono and J. Seberry, Reusing shares in secret sharing schemes, The Computer Journal 37 (1994), 199-205.
  216. Y. Zheng, T. Hardjono and J. Seberry, How to recycle shares in secret sharing schemes, Austral. Comput. Sci. Comm. 14 (1992), 1053-1064.

Back to Ruizhong Wei's home page: click here