Geometrical contributions to secret sharing theory

Journal of Geometry

Volumn 79, Issue 1-2, 2004, Pages 102-133

  Jackson, Wen Ai ^a   Martin, Keith M ^b   O'Keefe, Christine M ^a,c  

^a UNIVERSITY OF ADELAIDE   (Australia)

^b UNIVERSITY OF LONDON   (United Kingdom)

^c CSIRO   (Australia)

Author keywords

Finite geometry; Information security; Secret sharing

Indexed keywords

EID: 13444289684     PISSN: 00472468     EISSN: 14208997     Source Type: Journal    
DOI: 10.1007/s00022-003-1633-y     Document Type: Article

References (67)

1. S. Barwick, W.-A. Jackson, K.M. Martin and CM. O'Keefe, Optimal Updating of Ideal Threshold Schemes, submitted.
2. S. Barwick, W.-A. Jackson, K.M. Martin and P.R. Wild, Size of broadcast in threshold schemes with disenrollment, Information Security and Privacy, ACISP 2002, LNCS, 2384 (2002) 71-88.
3. J. Benaloh, Secret sharing homomorphisms - keeping shares of a secret secret, Adv. in Cryptology - CRYPTO' 86, Lecture Notes in Comput. Sci. 263 (1987) 251-260.
4. J. Benaloh, and J. Leichter, Generalized secret sharing and monotone functions, Adv. in Cryptology - CRYPTO' 88, Lecture Notes in Comput. Sci. 403 (1990) 27-35.
5. M. Bertilsson and I. Ingemarsson, A construction of practical secret sharing schemes using linearblock codes, Adv. in Cryptology - AUSCRYPT'92, Lecture Notes in Comput. Sci. 718 (1993) 67-79.
6. A. Beutelspacher, Enciphered geometry: some applications of geometry to cryptography, Annals Discr. Math. 37 (1988) 59-68.
7. A. Beutelspacher, How to say "no", Adv. in Cryptology - EUROCRYPT' 89, Lecture Notes in Comput. Sci. 434 (1990) 491-496.
8. A. Beutelspacher, Applications of finite geometry to cryptography, Geometries, in: Codes and Cryptography, CISM Courses and Lecture Notes 313, Springer Verlag, 1990, pp. 161-186.
9. 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, pp. 255-268.
10. A. Beutelspacher and A. Kersten, Die Bedeutung von shared secret schemes als Mechanisms zur Realisierung von Sicherheitsfunktionen in Informationstechnischen Systemen, Datenschutz und Datensicherung 9 (1993) 498-510.
11. A. Beutelspacher and F. Wettl, On 2-level secret sharing, Des. Codes Cryptogr. 3 (1993) 127-134.
12. G.R. Blakley, Safeguarding cryptographic keys, Proceedings of AFIPS 1979 National Computer Conference, 48 (1979) 313-317.
13. G.R. Blakley and C. Meadows, Security of ramp schemes, Adv. in Cryptology - CRYPTO '84, Lecture Notes in Comput. Sci. 196 (1985) 411-431.
14. G.R. Blakley and G.A. Kabatianskii, Linear algebra approach to secret sharing schemes, Error Control, Cryptography and Speech Compression - Lecture Notes in Comput. Sci. 829 (1994) 33-40.
15. C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro and M. Yung, Perfectly-secure key distribution for dynamic conferences, Adv. in Cryptology - CRYPTO '92, Lecture Notes in Comput. Sci. 740 (1993) 471-486.
16. C. Blundo, A. De Santis, G. Di Crescenzo, A. Giorgio Gaggia and U. Vaccaro, Multi-secret sharing schemes, Adv. in Cryptology - CRYPTO '94, Lecture Notes in Comput. Sci. 839 (1994) 150-163.
17. C. Blundo, A. De Santis, D. Stinson and U. Vaccaro, Graph decompositions and secret sharing schemes, J. Cryptology 8 (1995) 39-64.
18. C. Blundo, A. De Santis, A. Gaggia and U. Vaccaro, New bounds on the information rate of secret sharing schemes, IEEE Trans. Inf. Th. 41 (1995) 549-554.
19. C. Blundo, A. Gaggia and D.R. Stinson, On the dealer's randomness required in secret sharing schemes, Des. Codes Cryptogr. 11 (1997) 235-259.
20. E.F. Brickell, Some ideal secret sharing schemes, J. Combin. Math. Combin. Comput. 9 (1989) 105-113.
21. E.F. Brickell and D.M. Davenport, On the classification of ideal secret sharing schemes, J. Cryptology 2 (1991) 123-134.
22. E.F. Brickell and D.R. Stinson, The detection of cheaters in threshold schemes, SLAM J. of Disc. Math. 4 (1991) 502-510.
23. R.M. Capocelli, A. De Santis, Gargano, and U. Vaccaro, On the size of shares for secret sharing schemes, J. Cryptology 6 (1993), 157-169.
24. R.M. Capocelli, A. De Santis, L. Gargano and U. Vaccaro, A note on secret sharing schemes, in: Sequences II: Methods in Communications, Security and Computer Science, Springer Verlag, 1993, pp. 335-344.
25. M. Carpentieri, A perfect threshold secret sharing scheme to identify cheaters, Des. Codes Cryptogr. 5 (1995) 183-188.
26. M. De Soete and K. Vedder, Some new classes of geometric threshold schemes, Adv. in Cryptology - EUROCRYPT '88, Lecture Notes in Comput. Sci. 330 (1988) 389-401.
27. D.E. Denning and D.K. Branstad, A taxonomy for key escrow encryption systems, Communications of the ACM, 39 (1996) 34-40.
28. M. van Dijk, A linear construction for perfect secret sharing schemes, Adv. in Cryptology - EUROCRYPT '94, Lecture Notes in Comput. Sci. 950 (1995) 23-34.
29. M. van Dijk, On the information rate of perfect secret sharing schemes, Des. Codes Cryptogr. 6 (1995) 143-169.
30. M. van Dijk, W.-A. Jackson and K.M. Martin, A general decomposition construction for incomplete secret sharing schemes, Des. Codes Cryptogr. 15 (1998) 301-321.
31. E. Gilbert, F.J. MacWilliams and N.J.A. Sloane, Codes which detect deception, Bell System Technical Journal 53 (3) (1974) 405-424.
32. J.W.P. Hirschfeld, Projective geometries over finite fields, Second Edition, Oxford University Press, Oxford, 1998.
33. M. Ito, A. Saito and T. Nishizeki, Secret sharing schemes realizing general access structure, J. Cryptology 6 (1993) 15-20.
34. W.-A. Jackson and K.M. Martin, Geometric secret sharing schemes and their duals, Des. Codes Cryptogr. 4 (1994) 83-95.
35. W.-A. Jackson K.M. Martin, Combinatorial models for perfect secret sharing schemes, J. Combin. Math. and Combin. Comput. 28 (1998) 249-265.
36. W.-A. Jackson and K.M. Martin, An Algorithm for efficient geometric secret sharing schemes, Utilitas Mathematica 54 (1998) 127-150.
37. W.-A. Jackson and K.M. Martin, Perfect secret sharing schemes on five participants, Des. Codes Cryptogr. 9 (1996) 267-286.
38. W.-A. Jackson and K.M. Martin, A combinatorial exposition of ramp schemes, Australas. J. Combin. 14 (1996) 51-60.
39. W.-A. Jackson, K.M. Martin and C.M. O'Keefe, Multisecret threshold schemes, Adv. in Cryptology - CRYPTO '93, Lecture Notes in Comput. Sci. 773 (1994) 126-135.
40. W.-A. Jackson, K.M. Martin, and C.M. O'Keefe, A construction for multisecret threshold schemes, Des. Codes Cryptogr. 9 (1996) 287-303.
41. W.-A. Jackson, K.M. Martin, and C.M. O'Keefe, Mutually trusted authority free secret sharing schemes, J. Cryptology 10 (1997) 261-289.
42. E.D. Karnin, J.W. Green and M.G. Hellman, On secret sharing systems, IEEE Trans. Inf. Th. 29 (1993) 35-41.
43. K.M. Martin, New secret sharing schemes from old, J. Combin. Math. Combin. Comput. 14 (1993) 65-77.
44. K.M. Martin, J. Pieprzyk, R. Safavi-Naini and H. Wang, Changing thresholds in the absence of secure channels, Australian Computer Journal 31 (1999) 34-43.
45. F. Matùs, Matroid Representations by Partitions, Discrete Mathematics 203 (1999) 169-194.
46. C.J. Mitchell and F.C. Piper, Key storage in secure networks, Discrete Applied Mathematics 21 (1988) 215-228.
47. A. Menezes, P. van Oorschot and S. Vanstone, Handbook of Applied Cryptography, CRC Press, Boca Raton, 1996.
48. S.-L. Ng, A representation of a family of secret sharing matroids, to appear in Des. Codes Cryptogr.
49. S.-L. Ng and M. Walker, On the composition of matroids and ideal secret sharing schemes, Des. Codes Cryptogr. 24 (2001) 49-67.
50. W. Ogata and K. Kurosawa, Optimum secret sharing scheme secure against cheating, Adv. in Cryptology - EUROCRYPT '96, Lecture Notes in Comput. Sci. 1070 (1996) 200-211.
51. C.M. O'Keefe, Key distribution patterns using Minkowski planes, Des. Codes Cryptogr. 5 (1995), 261-267.
52. J.G. Oxley, Matroid Theory, OUP, New York, 1992.
53. C. Schulze, Multifunktionale shared secret schemes, Mitteilungen aus dem Mathematischen Seminar Giessen, Heft 222, Giessen, 1995.
54. P.D. Seymour, On secret sharing matroids, Journal of Combin. Theory B 56 (1992) 69-73.
55. A. Shamir, How to share a secret, Comm. ACM 22 (1979) 612-613.
56. G.J. Simmons, Robust shared secret schemes or 'how to be sure you have the right answer even though you don't know the question', Congr. Numer. 68 (1989) 215-248.
57. G.J. Simmons, How to (really) share a secret, Adv. in Cryptology - CRYPTO ' 88, Lecture Notes in Comput. Sci. 403 (1990) 390-448.
58. G.J. Simmons, Prepositioned Shared Secret and/or Shared Control Schemes, Adv. in Cryptology - EUROCRYPT '89, Lecture Notes in Comput. Sci. 434 (1990) 436-467.
59. G.J. Simmons, Geometric Shared Secret and/or Shared Control Schemes, Adv. in Cryptology - CRYPTO '88, Lecture Notes in Comput. Sci. 403 (1991) 390-448.
60. G.J. Simmons, W.-A. Jackson and K. Martin, The geometry of shared secret schemes, Bull. Inst. Combin. Appl. 1 (1991) 71-88.
61. G.J. Simmons, An introduction to shared secret/shared control schemes, in: G.J. Simmons, ed., Contemporary Cryptology - The science of information integrity, IEEE Press, New York, 1992.
62. J. Simonis and A. Ashikhmin, Almost affine codes, Des. Codes Cryptogr. 14 (1998) 179-197.
63. D.R. Stinson, The combinatorics of authentication and secrecy codesz, J. Cryptology 2 (1990) 23-49.
64. D.R. Stinson, An explication of secret sharing schemes, Des. Codes Cryptogr. 2 (1992) 357-390.
65. D.R. Stinson, Decomposition constructions for secret sharing schemes, IEEE Trans. Inf. Th. 40 (1994) 118-125.
66. D.R. Stinson, Cryptography: theory and practice, CRC Press, Boca Raton, 1995.
67. T.-C. Wu and W.-H. He, A geometric approach for sharing secrets, Computers and Security 14 (1995) 135-146.