Weakly-private secret sharing schemes

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

Volumn 4392 LNCS, Issue , 2007, Pages 253-272

  Beimel, Amos ^a   Franklin, Matthew ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b University of California Davis   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; NETWORK PROTOCOLS; SECURITY OF DATA;

2-BIT SHARES; ACCESS STRUCTURE; SECRET-SHARING SCHEMES;

PUBLIC KEY CRYPTOGRAPHY;

EID: 38049002374     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70936-7_14     Document Type: Conference Paper

References (50)

1. 0. In Proc. of the 45th Symp. on Foundations of Computer Science, pages 166-175, 2004.
2. P. Beguin and A. Cresti. General short computational secret sharing schemes. In EUROCRYPT '95, vol. 921 of LNCS, pages 194-208. 1995.
3. A. Beimel. Secure Schemes for Secret Sharing and Key Distribution. PhD thesis, Technion - Israel Institute of Technology, 1996.
4. A. Beimel. On private computation in incomplete networks. Distributed Computing, 2006.
5. A. Beimel and B. Chor. Communication in key distribution schemes. IEEE Trans. on Information Theory, 42(1):19-28, 1996.
6. A. Beimel and Y. Ishai. On the power of nonlinear secret-sharing. SIAM J. on Discrete Mathematics, 19(1):258-280, 2005.
7. A. Beimel and N. Livne. On matroids and non-ideal secret sharing. In TCC 2006, vol. 3876 of LNCS, pages 482-501, 2006.
8. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computations. In Proc. of the 20th STOC, pages 1-10, 1988.
9. J. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. In CRYPTO '88, vol. 403 of LNCS, pages 27-35. 1990.
10. G. R. Blakley. Safeguarding cryptographic keys. In Proc. of the 1979 AFIPS National Computer Conference, pages 313-317. 1979.
11. 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(2):107-122, 1997.
12. C. Blundo, A. De Santis, A. Giorgio Gaggia, and U. Vaccaro. New bounds on the information rate of secret sharing schemes. IEEE Trans. on Information Theory, 41(2):549-553, 1995.
13. C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung. Perfectly secure key distribution for dynamic conferences. Info. and Comput., 146(1):1-23, 1998.
14. C. Blundo and D. R. Stinson. Anonymous secret sharing schemes. Discrete Applied Math. and Combin. Operations Research and Comp. Sci., 77:13-28, 1997.
15. E. F. Brickell. Some ideal secret sharing schemes. Journal of Combin. Math, and Combin. Comput., 6:105-113, 1989.
16. E. F. Brickell and D. M. Davenport. On the classification of ideal secret sharing schemes. J. of Cryptology, 4(73): 123-134, 1991.
17. R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro. On the size of shares for secret sharing schemes. J. of Cryptology, 6(3): 157-168, 1993.
18. D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols. In Proc. of the 20th STOC, pages 11-19, 1988.
19. R. Cramer, I. Damgård, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In EUROCRYPT 2000, vol. 1807 of LNCS, pages 316-334. 2000.
20. L. Csirmaz. The size of a share must be large. In EUROCRYPT '94, vol. 950 of LNCS, pages 13-22. 1995.
21. Also in: J. of Cryptology, 10(4):223-231, 1997.
22. L. Csirmaz. The dealer's random bits in perfect secret sharing schemes. Studia Sci. Math. Hungar., 32(3-4):429-437, 1996.
23. I. Damgård and R. Thorbek. Linear integer secret sharing and distributed exponentiation. In PKC 2006, vol. 3958 of LNCS, pages 75-90. 2006.
24. Y. Desmedt and Y. Frankel. Shared generation of authenticators and signatures. In CRYPTO '91, vol. 576 of LNCS, pages 457-469. 1992.
25. M. van Dijk. On the information rate of perfect secret sharing schemes. Designs, Codes and Cryptography, 6:143-169, 1995.
26. M. van Dijk. A linear construction of secret sharing schemes. Designs, Codes and Cryptography, 12(2):161-201, 1997.
27. V. Goyal, O. Pandey, A. Sahai, and B. Waters. Attribute based encryption for fine-grained access control of encrypted data. In CCS 2006, 2006.
28. Y. Ishai. Personal communication. 2006.
29. M. Ito, A. Saito, and T. Nishizeki. Secret sharing schemes realizing general access structure. In Proc. of Globecom 87, pages 99-102, 1987.
30. W.-A Jackson and K. M. Martin. Combinatorial models for perfect secret sharing schemes. J. of Comb. Mathematics and Comb. Computing, 28:249-265, 1998.
31. M. Karchmer and A. Wigderson. On span programs. In Proc. of the 8th Structure in Complexity Theory, pages 102-111, 1993.
32. E. D. Karnin, J. W. Greene, and M. E. Hellman. On secret sharing systems. IEEE Trans. on Information Theory, 29(1):35-41, 1983.
33. J. Kilian and N. Nisan. Private communication, 1990.
34. W. Kishimoto, K. Okada, K. Kurosawa, and W. Ogata. On the bound for anonymous secret sharing schemes. Discrete Appl. Math., 121 (1-3):193-202, 2002.
35. H. Krawczyk. Secret sharing made short. In CRYPTO '93, vol. 773 of LNCS, pages 136-146. 1994.
36. K. Kurosawa and K. Okada. Combinatorial lower bounds for secret sharing schemes. Inform. Process. Lett., 60(6):301-304, 1996.
37. E. Kushilevitz. Privacy and communication complexity. SIAM J. on Discrete Mathematics, 5(2):273-284, 1992.
38. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. J. of the ACM, 41(5):960-981, 1994.
39. J. Martí-Farré and C. Padró. On secret sharing schemes, matroids and polymartroids. Technical Report 2006/077, Cryptology ePrint Archive, 2006.
40. Y. Miao. A combinatorial characterization of regular anonymous perfect threshold schemes. Inform. Process. Lett., 85(3):131-135, 2003.
41. M. Naor and A. Wool. Access control and signatures via quorum secret sharing. IEEE Transactions on Parallel and Distributed Systems, 9(1):909-922, 1998.
42. C. Padró and G. Sáez. Secret sharing schemes with bipartite access structure. IEEE Trans. on Information Theory, 46:2596-2605, 2000.
43. M. O. Rabin. Randomized Byzantine generals. In Proc. of the 24th IEEE Symp. on Foundations of Computer Science, pages 403-409, 1983.
44. P. D. Seymour. On secret-sharing matroids. J. of Combinatorial Theory, Series B, 56:69-73, 1992.
45. A. Shamir. How to share a secret. Communications of the ACM, 22:612-613, 1979.
46. G. J. Simmons, W. Jackson, and K. M. Martin. The geometry of shared secret schemes. Bulletin of the ICA, 1:71-88, 1991.
47. D. R. Stinson. Decomposition construction for secret sharing schemes. IEEE Trans. on Information Theory, 40(1):118-125, 1994.
48. D. R. Stinson and S. A. Vanstone. A combinatorial approach to threshold schemes. SIAM J. on Discrete Mathematics, 1(2):230-236, 1988.
49. V. Vinod, A. Narayanan, K. Srinathan, C. Pandu Rangan, and K. Kim. On the power of computational secret sharing. In Indocrypt 2003, vol. 2904 of LNCS, pages 162-176. 2003.
50. A. C. Yao. Unpublished manuscript, 1989. Presented at Oberwolfach and DIMACS workshops.