Multi-linear secret-sharing schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8349 LNAI, Issue , 2014, Pages 394-418

  Beimel, Amos ^a   Ben Efraim, Aner ^a   Padró, Carles ^b   Tyomkin, Ilya ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Dowling geometries; Ideal secret sharing schemes; multi linear matroids

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CRYPTOGRAPHIC PROTOCOLS; DOWLING GEOMETRY; LINEAR COMBINATIONS; LINEAR MAPPING; LOWER BOUNDS; SECRET-SHARING; SHARED SECRETS;

CRYPTOGRAPHY;

EID: 84958549041     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-54242-8_17     Document Type: Conference Paper

References (45)

1. Babai, L., Ǵal, A., Wigderson, A.: Superpolynomial lower bounds for monotone span programs. Combinatorica 19(3), 301-319 (1999)
2. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: Proc. of the 20th ACM Symp. on the Theory of Computing, pp. 1-10 (1988)
3. Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27-35. Springer, Heidelberg (1990)
4. Bertilsson, M., Ingemarsson, I.: A construction of practical secret sharing schemes using linear block codes. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 67-79. Springer, Heidelberg (1993)
5. Blakley, G.R.: Safeguarding cryptographic keys. In: Merwin, R.E., Zanca, J.T., Smith, M. (eds.) Proc. of the 1979 AFIPS National Computer Conference. AFIPS Conference proceedings, vol. 48, pp. 313-317. AFIPS Press (1979)
6. Blundo, C., De Santis, A., Stinson, D.R., Vaccaro, U.: Graph decompositions and secret sharing schemes. J. Cryptology 8(1), 39-64 (1995)
7. Brickell, E.F.: Some ideal secret sharing schemes. Journal of Combin. Math. and Combin. Comput. 6, 105-113 (1989)
8. Brickell, E.F., Davenport, D.M.: On the classification of ideal secret sharing schemes. J. of Cryptology 4(73), 123-134 (1991)
9. Chaum, D., Cŕepeau, C., Damg?ard, I.: Multiparty unconditionally secure protocols. In: Proc. of the 20th ACM Symp. on the Theory of Computing, pp. 11-19 (1988)
10. Cramer, R., Damg?ard, I., Maurer, U.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316-334. Springer, Heidelberg (2000)
11. Csirmaz, L.: The size of a share must be large. J. of Cryptology 10(4), 223-231 (1997)
12. Desmedt, Y., Frankel, Y.: Shared generation of authenticators and signatures. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 457-469. Springer, Heidelberg (1992)
13. van Dijk, M.: A linear construction of secret sharing schemes. Designs, Codes and Cryptography 12(2), 161-201 (1997)
14. Dowling, T.A.: A class of geometric lattices based on finite groups. J. Comb. Theory, Ser. B 14(1), 61-86 (1973)
15. Dowling, T.A.: A q-analog of the partition lattice. A Survey of Combinatorial Theory, 101-115 (1973)
16. G?al, A.: A characterization of span program size and improved lower bounds for monotone span programs. Computational Complexity 10(4), 277-296 (2001)
17. G?al, A., Pudl?ak, P.: A note on monotone complexity and the rank of matrices. Inform. Process. Lett. 87, 321-326 (2003)
18. Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for finegrained access control of encrypted data. In: Proc. of the 13th ACM Conference on Computer and Communications Security, pp. 89-98 (2006)
19. Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structure. In: Proc. of the IEEE Global Telecommunication Conf., Globecom 1987, pp. 99-102 (1987).
20. Journal version: Multiple assignment scheme for sharing secret. J. of Cryptology 6(1), 15-20 (1993)
21. Karchmer, M., Wigderson, A.: On span programs. In: Proc. of the 8th IEEE Structure in Complexity Theory, pp. 102-111 (1993)
22. Karnin, E.D., Greene, J.W., Hellman, M.E.: On secret sharing systems. IEEE Trans. on Information Theory 29(1), 35-41 (1983)
23. Linnik, Y.V.: On the least prime in an arithmetic progression I. the basic theorem. Rec. Math (Mat. Sbornik) N.S. 15(57), 139-178 (1944)
24. Linnik, Y.V.: On the least prime in an arithmetic progression II. the deuringheilbronn phenomenon. Rec. Math (Mat. Sbornik) N.S. 15(57), 347-368 (1944)
25. Mart-Farr?e, J., Padr?o, C.: On secret sharing schemes, matroids and polymatroids. Journal of Mathematical Cryptology 4(2), 95-120 (2010)
26. Mat?u?s, F.: Matroid representations by partitions. Discrete Mathematics 203, 169-194 (1999)
27. Milne, J.S.: Group theory, v3.12 (2012), http://www.jmilne.org/math/
28. Naor, M., Wool, A.: Access control and signatures via quorum secret sharing. In: 3rd ACM Conf. on Computer and Communications Security, pp. 157-167 (1996)
29. Oxley, J.G.: Matroid Theory, 2nd edn. Oxford University Press (2011)
30. Pendavingh, R.A., van Zwam, S.H.M.: Skew partial fields, multilinear representations of matroids, and a matrix tree theorem. Advances in Applied Mathematics 50(1), 201-227 (2013)
31. Semple, C., Whittle, G.: Partial fields and matroid representation. Advances in Applied Mathematics 17(2), 184-208 (1996)
32. Serre, J.-P.: Linear Representations of Finite Groups. Springer (1977)
33. Seymour, P.D.: On secret-sharing matroids. J. of Combinatorial Theory, Series B 56, 69-73 (1992)
34. Shamir, A.: How to share a secret. Communications of the ACM 22, 612-613 (1979)
35. Shankar, B., Srinathan, K., Rangan, C.P.: Alternative protocols for generalized oblivious transfer. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds.) ICDCN 2008. LNCS, vol. 4904, pp. 304-309. Springer, Heidelberg (2008)
36. Simonis, J., Ashikhmin, A.: Almost affine codes. Designs, Codes and Cryptography 14(2), 179-197 (1998)
37. Stinson, D.R.: Decomposition construction for secret sharing schemes. IEEE Trans. on Information Theory 40(1), 118-125 (1994)
38. Tassa, T.: Generalized oblivious transfer by secret sharing. Des. Codes Cryptography 58(1), 11-21 (2011)
39. van Dijk, M., Jackson, W.-A., Martin, K.M.: A general decomposition construction for incomplete secret sharing schemes. Des. Codes Cryptography 15(3), 301-321 (1998)
40. van Dijk, M., Kevenaar, T.A.M., Schrijen, G.J., Tuyls, P.: Improved constructions of secret sharing schemes by applying (lambda, omega)-decompositions. Inform. Process. Lett. 99(4), 154-157 (2006)
41. Vincent, G.: Les groupes lineaires finis sans point fixes. Commentarii Mathematici Helvetici 20, 117-171 (1947)
42. Waters, B.: Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 53-70. Springer, Heidelberg (2011)
43. Wolf, J.A.: Spaces of Constant Curvature, 5th edn. Publish or Perish, Inc. (1984)
44. Xylouris, T.: On the least prime in an arithmetic progression and estimates for the zeros of Dirichlet L-functions. Acta Arith. 150(1), 65-91 (2011)
45. Zassenhaus, H.: Uber endliche faskorper. Abhandlungen aus dem Mathematischen Seminar der Hamburgischen Universitat 11, 187-220 (1935)