Secret sharing schemes on sparse homogeneous access structures with rank three

Electronic Journal of Combinatorics

Volumn 11, Issue 1 R, 2004, Pages 1-16

  Martí Farré, Jaume ^a   Padró, Carles ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Cryptography; Ideal secret sharing schemes; Information rate; Secret sharing schemes

Indexed keywords

EID: 5344242549     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1825     Document Type: Conference Paper

References (23)

1. G.R. Blakley. Safeguarding cryptographic keys. AFIPS Conference Proceedings 48 (1979), 313-317.
2. C. Blundo, A. De Santis, R. De Simone, U. Vaccaro. Tight bounds on the information rate of secret sharing schemes. Designs, Codes and Cryptography 11 (1997), 107-122.
3. C. Blundo, A. De Santis, L. Gargano, U. Vaccaro. On the information rate of secret sharing schemes. Advances in Cryptology CRYPTO'92. Lecture Notes in Computer Science 740 (1993), 148-167.
4. C. Blundo, A. De Santis, D.R. Stinson, U. Vaccaro. Graph decompositions and secret sharing schemes. J. Cryptology 8 (1995), 39-64.
5. E.F. Brickell. Some ideal secret sharing schemes. J. Combin. Math. and Combin. Comput. 9 (1989), 105-113.
6. E.F. Brickell, D.M. Davenport. On the classification of ideal secret sharing schemes. J. Cryptology 4 (1991), 123-134.
7. E.F. Brickell, D.R. Stinson. Some improved bounds on the information rate of perfect secret sharing schemes. J. Cryptology 5 (1992), 153-166.
8. R.M. Capocelli, A. De Santis, L. Gargano, U. Vaccaro. On the size of shares of secret sharing schemes. J. Cryptology 6 (1993), 157-168.
9. M. van Dijk. Secret Key Sharing and Secret Key Generation. Ph.D. Thesis, 1997, TU Eindhoven.
10. M. Ito, A. Saito, T. Nishizeki. Secret sharing scheme realizing any access structure. Proc. IEEE Globecom'87 (1987), 99-102.
11. W.-A. Jackson, K.M. Martin. Perfect secret sharing schemes on five participants. Designs, Codes and Cryptography 9 (1996), 267-286.
12. M. Karchmer, A. Wigderson. On span programs. Proceedings of the Eighth Annual Structure in Complexity Theory Conference (San Diego, CA, 1993), 102-111.
13. J. Martí-Farré, C. Padró. Secret sharing schemes with three or four minimal qualified subsets. Designs, Codes and Cryptography, to appear.
14. J. Martí-Farré, C. Padró. Secret sharing schemes on access structures with intersection number equal to one. Proceedings of the Third International Conference on Security in Communication Networks SCN'02, Lecture Notes in Computer Science 2576 (2003) 354-363.
15. J.L. Massey. Minimal codewords and secret sharing. Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, 1993, 276-279.
16. C. Padró, G. Sáez. Secret sharing schemes with bipartite access structure. IEEE Transactions on Information Theory Vol. 46, No. 7 (2000), 2596-2604.
17. C. Padró, G. Sáez. Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. Information Processing Letters 83 (2002), 345-351.
18. P.D. Seymour. On secret-sharing matroids. J. Combin. Theory Ser. B 56 (1992), 69-73.
19. A. Shamir. How to share a secret. Commun. of the ACM 22 (1979), 612-613.
20. G.J. Simmons, W. Jackson and K. Martin. The geometry of secret sharing schemes. Bulletin of the ICA 1 (1991) 71-88.
21. J. Simonis, A. Ashikhmin. Almost affine codes. Designs, Codes and Cryptography 14 (1998) 179-197.
22. D.R. Stinson. An explication of secret sharing schemes. Designs, Codes and Cryptography 2 (1992), 357-390.
23. D.R. Stinson. Decomposition constructions for secret-sharing schemes. IEEE Trans. on Information Theory 40 (1994), 118-125.