Secret-sharing schemes: A survey

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

Volumn 6639 LNCS, Issue , 2011, Pages 11-46

  Beimel, Amos ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS STRUCTURE; BYZANTINE AGREEMENT; LOWER AND UPPER BOUNDS; LOWER BOUNDS; MONOTONE SPAN PROGRAMS; MULTIPARTY COMPUTATION; OBLIVIOUS TRANSFER; ONE-WAY FUNCTIONS; OPEN PROBLEMS; SECURE PROTOCOLS; THRESHOLD CRYPTOGRAPHY;

ACCESS CONTROL; DATA TRANSFER; LINEAR ALGEBRA; SURVEYS;

CRYPTOGRAPHY;

EID: 79959306732     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20901-7_2     Document Type: Conference Paper

References (75)

1. Alon, N., Goldreich, O., Hastad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. Random Structures & Algorithms 3, 289-304 (1992)
2. Babai, L., Ǵal, A., Wigderson, A.: Superpolynomial lower bounds for monotone span programs. Combinatorica 19(3), 301-319 (1999)
3. Beimel, A.: Secure Schemes for Secret Sharing and Key Distribution. PhD thesis, Technion (1996), http://www.cs.bgu.ac.il/∼beimel/pub.html
4. Beimel, A., Chor, B.: Universally ideal secret sharing schemes. IEEE Trans. on Information Theory 40(3), 786-794 (1994)
5. Beimel, A., Ǵal, A., Paterson, M.: Lower bounds for monotone span programs. Computational Complexity 6(1), 29-45 (1997); Conference version: FOCS 1995 (Pubitemid 127049567)
6. Beimel, A., Ishai, Y.: On the power of nonlinear secret-sharing. SIAM J. on Discrete Mathematics 19(1), 258-280 (2005)
7. Beimel, A., Livne, N., Padŕo, C.: Matroids can be far from ideal secret sharing. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 194-212. Springer, Heidelberg (2008)
8. Beimel, A., Orlov, I.: Secret sharing and non-shannon information inequalities. IEEE Trans. on Information Theory (2011);
9. Preliminary version Reingold, O. (ed.): TCC 2009. LNCS, vol. 5444, pp. 539-557. Springer, Heidelberg (2009)
10. Beimel, A., Paskin, A.: On linear secret sharing for connectivity in directed graphs. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol. 5229, pp. 172-184. Springer, Heidelberg (2008)
11. Beimel, A., Weinreb, E.: Separating the power of monotone span programs over different fields. SIAM J. on Computing 34(5), 1196-1215 (2005) (Pubitemid 41495292)
12. Beimel, A., Weinreb, E.: Monotone circuits for monotone weighted threshold functions. Inform. Process. Lett. 97(1), 12-18 (2006); (Pubitemid 41653406)
13. Conference version: Proc. of 20th Annu. IEEE Conf. on Computational Complexity, pp. 67-75 (2005)
14. Bellare, M., Rogaway, P.: Robust computational secret sharing and a unified account of classical secret-sharing goals. In: Proc. of the 14th ACM Conference on Computer and Communications Security, pp. 172-184 (2007)
15. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncrypto-graphic fault-tolerant distributed computations. In: Proc. of the 20th ACM Symp. on the Theory of Computing, pp. 1-10 (1988)
16. Benaloh, J.C., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27-35. Springer, Heidelberg (1990)
17. Benaloh, J.C., Rudich, S.: Private communication (1989)
18. 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)
19. 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)
20. Blundo, C., De Santis, A., De Simone, R., Vaccaro, U.: Tight bounds on the information rate of secret sharing schemes. Designs, Codes and Cryptography 11(2), 107-122 (1997) (Pubitemid 127502285)
21. Blundo, C., De Santis, A., Gargano, L., Vaccaro, U.: On the information rate of secret sharing schemes. Theoretical Computer Science 154(2), 283-306 (1996) (Pubitemid 126412385)
22. Blundo, C, De Santis, A., Vaccaro, U.: On secret sharing schemes. Inform. Process. Lett. 65(1), 25-32 (1998) (Pubitemid 128393453)
23. Brickell, E.F.: Some ideal secret sharing schemes. Journal of Combin. Math. and Combin. Comput. 6, 105-113 (1989)
24. Brickell, E.F., Davenport, D.M.: On the classification of ideal secret sharing schemes. J. of Cryptology 4(73), 123-134 (1991)
25. Capocelli, R.M., De Santis, A., Gargano, L., Vaccaro, U.: On the size of shares for secret sharing schemes. J. of Cryptology 6(3), 157-168 (1993)
26. Chaum, D., Crepeau, C, Damgard, I.: Multiparty unconditionally secure protocols In: Proc. of the 20th ACM Symp. on the Theory of Computing, pp. 11-19 (1988)
27. Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: Proc. of the 26th IEEE Symp. on Foundations of Computer Science, pp. 383-395 (1985) (Pubitemid 16541437)
28. Chor, B., Kushilevitz, E.: Secret sharing over infinite domains. J. of Cryptology 6(2), 87-96 (1993)
29. Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons, Chichester (1991)
30. Cramer, R., Damgard, I.B., Maurer, U.M.: 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)
31. Csirmaz, L.: The size of a share must be large. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 223-231. Springer, Heidelberg (1995); (Pubitemid 127754573)
32. Journal version in: J. of Cryptology 10(4), 223-231 (1997)
33. Csirmaz, L.: The dealer's random bits in perfect secret sharing schemes. Studia Sci. Math. Hungar. 32(3-4), 429-437 (1996)
34. Desmedt, Y.G., Frankel, Y.: Shared generation of authenticators and signatures. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 457-469. Springer, Heidelberg (1992)
35. van Dijk, M.: A linear construction of perfect secret sharing schemes. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 23-34. Springer, Heidelberg (1995)
36. Van Dijk, M.: On the information rate of perfect secret sharing schemes. Designs, Codes and Cryptography 6, 143-169 (1995)
37. Van Dijk, M., Kevenaar, T., Schrijen, G.-J., Tuyls, P.: Improved constructions of secret sharing schemes by applying (A],(-decompositions. Inform. Process. Lett. 99(4), 154-157 (2006) (Pubitemid 43816995)
38. Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. CACM 28(6), 637-647 (1985)
39. Gal, A.: A characterization of span program size and improved lower bounds for monotone span programs. Computational Complexity 10(4), 277-296 (2002)
40. Gal, A., Pudlak, P.: Monotone complexity and the rank of matrices. Inform. Process. Lett. 87, 321-326 (2003)
41. Gennaro, R., Rabin, M.O., Rabin, T.: Simplified vss and fact-track multiparty computations with applications to threshold cryptography. In: Proc. of the 17th ACM Symp. on Principles of Distributed Computing, pp. 101-111 (1998)
42. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proc. of the 19th ACM Symp. on the Theory of Computing, pp. 218-229 (1987)
43. 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) (Pubitemid 47131359)
44. Hastad, J., Impagliazzo, R., Levin, L.A., Luby, M.: Construction of a pseudorandom generator from any one-way function. SIAM J. on Computing 28(4), 1364-1396 (1999)
45. Hirt, M., Maurer, U.: Player simulation and general adversary structures in perfect multiparty computation. J. of Cryptology 13(1), 31-60 (2000)
46. Impagliazzo, R.: A personal view of average-case complexity. In: Proc. of the 10th IEEE Structure in Complexity Theory, pp. 134-147 (1995)
47. Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Proc. of the 21st ACM Symp. on the Theory of Computing, pp. 44-61 (1989)
48. 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); (Pubitemid 18628648)
49. Journal version: Multiple assignment scheme for sharing secret. J. of Cryptology, 6(1), 15-20 (1993)
50. Karchmer, M., Wigderson, A.: On span programs. In: Proc. of the 8th IEEE Structure in Complexity Theory, pp. 102-111 (1993) (Pubitemid 23688021)
51. Karnin, E.D., Greene, J.W., Hellman, M.E.: On secret sharing systems. IEEE Trans. on Information Theory 29(1), 35-41 (1983)
52. Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)
53. Mart́-Farŕe, J., Padŕo, C.: On secret sharing schemes, matroids and polymatroids. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 273-290. Springer, Heidelberg (2007)
54. Matús, F.: Infinitely many information inequalities. In: IEEE International Symposium on Information Theory 2007, pp. 41-44 (2007)
55. Metcalf-Burton, J.R.: Improved upper bounds for the information rates of the secret sharing schemes induced by the Vamos matroid. Technical Report abs/0809.3010, CoRR (2008)
56. Naor, M., Wool, A.: Access control and signatures via quorum secret sharing. IEEE Transactions on Parallel and Distributed Systems 9(1), 909-922 (1998) (Pubitemid 128752028)
57. Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory (1981), Available online in the Cryptology ePrint Archive, Report 2005/187, http://eprint.iacr.org/2005/187
58. Rabin, M.O.: Randomized Byzantine generals. In: Proc. of the 24th IEEE Symp. on Foundations of Computer Science, pp. 403-409 (1983)
59. Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Proc. of the 22nd ACM Symp. on the Theory of Computing, pp. 387-394 (1990) (Pubitemid 20729144)
60. Rudich, S.: Private communication, via M. Naor (1989)
61. Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 457-473. Springer, Heidelberg (2005) (Pubitemid 41313969)
62. Shamir, A.: How to share a secret. Communications of the ACM 22, 612-613 (1979)
63. 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) (Pubitemid 351256567)
64. Simmons, G.J.: How to (really) share a secret. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 390-448. Springer, Heidelberg (1990)
65. Simmons, G.J., Jackson, W., Martin, K.M.: The geometry of shared secret schemes. Bulletin of the ICA 1, 71-88 (1991)
66. Simonis, J., Ashikhmin, A.: Almost affine codes. Designs, Codes and Cryptography 14(2), 179-197 (1998) (Pubitemid 128507639)
67. Stinson, D.R.: Decomposition construction for secret sharing schemes. IEEE Trans. on Information Theory 40(1), 118-125 (1994)
68. Tassa, T.: Hierarchical threshold secret sharing. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 473-490. Springer, Heidelberg (2004)
69. Tassa, T.: Generalized oblivious transfer by secret sharing. Designs, Codes and Cryptography 58 (2011)
70. Tassa, T., Dyn, N.: Multipartite secret sharing by bivariate interpolation. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 288-299. Springer, Heidelberg (2006) (Pubitemid 44113255)
71. Vinod, V., Narayanan, A., Srinathan, K., Pandu Rangan, C., Kim, K.: On the power of computational secret sharing. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 162-176. Springer, Heidelberg (2003)
72. Waters, B.: Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization. Technical Report 2008/290, Cryptology ePrint Archive (2008), http://eprint.iacr.org/
73. Yao, A.C.: Unpublished manuscript. Presented at Oberwolfach and DIMACS Workshops (1989)
74. Yeung, R.W.: Information Theory and Network Coding. Springer, Heidelberg (2008)
75. Zhang, Z., Yeung, R.W.: On characterization of entropy function via information inequalities. IEEE Trans. on Information Theory 44(4), 1440-1452 (1998) (Pubitemid 128736707)