On the power of nonlinear secret-sharing

SIAM Journal on Discrete Mathematics

Volumn 19, Issue 1, 2005, Pages 258-280

  Beimel, Amos ^a   Ishai, Yuval ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Monotone span programs; Nonlinear secret sharing; Quadratic residuosity; Secret sharing

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS; SET THEORY;

MONOTONE SPAN PROGRAMS; NONLINEAR SECRET-SHARING; QUADRATIC RESIDUOSITY; SECRET-SHARING;

NONLINEAR SYSTEMS;

EID: 33644602159     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480102412868     Document Type: Article

References (64)

1. L. M. ADLEMAN AND K. KOMPELLA, Using smoothness to achieve parallelism, in Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, 1988, pp. 528-538.
2. L. BABAI, A. GÁL, AND A. WIGDERSON, Superpolynomial lower bounds for monotone span programs, Combinatorica, 19 (1999), pp. 301-319.
3. E. BACH AND J. SHALIT, Algorithmic Number Theory, Vol. 1. Efficient Algorithms, MIT Press, Cambridge, MA, 1996.
4. P. BEGUIN AND A. CRESTI, General short computational secret sharing schemes, in Advances in Cryptology - EUROCRYPT '95, L. C. Guillou and J. J. Quisquater, eds., Lect. Notes in Comput. Sci. 921, Springer-Verlag, Berlin, 1995, pp. 194-208.
5. R. BEIGEL AND B. FU, Circuits over PP and PL, J. Comput. Syst. Sci., 60 (2000), pp. 422-441.
6. Preliminary version in the proceedings of the 12th Annual IEEE Conference on Computational Complexity, 1997, pp. 24-35.
7. A. BEIMEL, Secure Schemes for Secret Sharing and Key Distribution, Ph.D. thesis, Technion-Israel Institute of Technology, Haifa, Israel, 1996.
8. A. BEIMEL, A. GAL, AND M. PATERSON, Lower bounds for monotone span programs, Comput. Complexity, 6 (1996/1997), pp. 29-45. Conference version: FOCS '95.
9. A. BEIMEL AND E. WEINREB, Separating the power of monotone span programs over different fields, in Proceeding of the 44th Annual IEEE Symposium on Foundations of Computer Science, Cambridge, MA, 2003, pp. 428-437.
10. M. BEN-OR, S. GOLDWASSER, AND A. WIGDERSON, Completeness theorems for noncryptographic fault-tolerant distributed computations, in Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, Chicago, IL, 1988, pp. 1-10.
11. J. BENALOH AND J. LEICHTER, Generalized secret sharing and monotone functions, in Advances in Cryptology - CRYPTO '88, S. Goldwasser, ed., Lect. Notes in Comput. Sci. 403, Springer-Verlag, Berlin, 1990, pp. 27-35.
12. J. BENALOH AND S. RUDICH, Private communication, 1989.
13. S. J. BERKOWITZ, On computing the determinant in small parallel time using a small number of processors, Inform. Process. Lett., 18 (1984), pp. 147-150.
14. M. BERTILSSON AND I. INGEMARSSON, A construction of practical secret sharing schemes using linear block codes, in Advances in Cryptology - AUSCRYPT '92, J. Seberry and Y. Zheng, eds., Lect. Notes Comput. Sci. 718, Springer-Verlag, Berlin, 1993, pp. 67-79.
15. G. R. BLAKLEY, Safeguarding cryptographic keys, in Proceedings of the 1979 AFIPS National Computer Conference, R. E. Merwin, J. T. Zanca, and M. Smith, eds., Vol. 48 of AFIPS Conference Proceedings, AFIPS Press, Arlington, VA, 1979, pp. 313-317.
16. C. BLUNDO, A. DE SANTIS, L. GARGANO, AND U. VACCARO, On the information rate of secret sharing schemes, Theoret. Comput. Sci., 154 (1996), pp. 283-306.
17. D. BONEH AND M. NAOR, Timed commitments, in Advances in Cryptology - CRYPTO 2000, M. Bellare, ed., Lect. Notes Comput. Sci. 1880, Springer-Verlag, Berlin, 2000, pp. 236-254.
18. A. BORODIN, J. VON ZUR. GATHEN, AND J. HOPCROFT, Fast parallel matrix and GCD computations, Inform. Control, 52 (1982), pp. 241-256.
19. E. F. BRICKELL, Some ideal secret sharing schemes, J. Combin. Math. Combin. Comput., 6 (1989), pp. 105-113.
20. E. F. BRICKELL AND D. M. DAVENPORT, On the classification of ideal secret sharing schemes, J. Cryptology, 4 (1991), pp. 123-134.
21. E. F. BRICKELL AND D. R. STINSON, Some improved bounds on the information rate of perfect secret sharing schemes, J. Cryptology, 5 (1992), pp. 153-166.
22. G. BUNTROCK, C. DAMM, U. HERTRAMPF, AND C. MEINEL, Structure and importance of the logspace-mod class, Math. Systems Theory, 25 (1992), pp. 223-237.
23. R. M. CAPOCELLI, A. DE SANTIS, L. GARGANO, AND U. VACCARO, On the size of shares for secret sharing schemes, J. Cryptology, 6 (1993), pp. 157-168.
24. D. CHAUM, C. CRÉPEAU, AND I. DAMGÅRD, Multiparty unconditionally secure protocols, in Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, Chicago, IL, 1988, pp. 11-19.
25. B. CHOR AND O. GOLDREICH, An improved parallel algorithm for integer GCD, Algorithmica, 5 (1990), pp. 1-10.
26. S. A. COOK, A taxonomy of problems with fast parallel algorithms, Inform. Control, 64 (1985), pp. 2-22.
27. R. CRAMER, I. DAMGARD, AND S. DZIEMBOWSKI, On the complexity of verifiable secret sharing and multiparty computation, in Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing, New York, 2000, pp. 325-334.
28. R. CRAMER, I. DAMGÅRD, AND U. MAURER, General secure multi-party computation from any linear secret-sharing scheme, in Advances in Cryptology - EUROCRYPT 2000, B. Preneel, ed., Lect. Notes Comput. Sci. 1807, Springer-Verlag, Berlin, 2000, pp. 316-334.
29. L. CSIRMAZ, The dealer's random bits in perfect secret sharing schemes, Studia Sci. Math. Hungar., 32 (1996), pp. 429-437.
30. L. CSIRMAZ, The size of a share must be large, J. Cryptology, 10 (1997), pp. 223-231.
31. Y. DESMEDT AND Y. FRANKEL, Shared generation of authenticators and signatures, in Advances in Cryptology - CRYPTO '91, J. Feigenbaum, ed., Lect. Notes Comput. Sci. 576, Springer-Verlag, Berlin, 1992, pp. 457-469.
32. Y. DESMEDT AND Y. FRANKEL, Homomorphic zero-knowledge threshold schemes over any finite abelian group, SIAM J. Discrete Math., 7 (1994), pp. 667-679.
33. M. v. DIJK, On the information rate of perfect secret sharing schemes, Des. Codes Cryptogr., 6 (1995), pp. 143-169.
34. M. v. DIJK, A linear construction of secret sharing schemes, Des. Codes Cryptogr., 12 (1997), pp. 161-201.
35. S. M. EIKENBERRY AND J. P. SORENSON, Efficient algorithms for computing the Jacobi symbol, J. Symb. Comput., 26 (1998), pp. 509-523.
36. S. FEHR, Span Programs Over Rings and How to Share a Secret from a Module, Master's thesis, ETH Zurich, Zurich, Switzerland, 1998.
37. U. FEIGE, J. KILIAN, AND M. NAOR, A minimal model for secure computation, in Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, Montreal, 1994, pp. 554-563.
38. A. GAL, A characterization of span program size and improved lower bounds for monotone span programs, in Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, Dallas, 1998, pp. 429-437.
39. L. GOLDSCHLAGER, The monotone and planar circuit value problem is complete for P, SIGACT News, 9 (1977), pp. 25-27.
40. S. GOLDWASSER AND S. MICALI, Probabilistic encryption, J. Comput. System Sci., 28 (1984), pp. 270-299.
41. D. M. GORDON, A survey of fast exponentiation methods, J. Algorithms, 27 (1998), pp. 129-146.
42. J. HÅSTAD, The shrinkage exponent of De Morgan formulas is 2, SIAM J. Comput., 27 (1998), pp. 48-64.
43. Y. ISHAI AND E. KUSHILEVITZ, Private simultaneous messages protocols with applications, in 5th Israel Symposium on Theory of Computing and Systems, Ramat-Gan, Israel, 1997, pp. 174-183.
44. M. ITO, A. SAITO, AND T. NISHIZEKI, Secret sharing schemes realizing general access structure, in Proceedings of the IEEE Global Telecommunication Conference, Globecom 87, 1987, pp. 99-102.
45. Journal version: Multiple Assignment Scheme for Sharing Secret, J. Cryptology, 6 (1993), pp. 15-20.
46. R. KANNAN, G. L. MILLER, AND L. RUDOLPH, Sublinear parallel algorithm for computing the greatest common divisor of two integers, SIAM J. Comput., 16 (1987), pp. 7-16.
47. M. KARCHMER AND A. WIGDERSON, On span programs, in Proceedings of the 8th Annual IEEE Structure in Complexity Theory, San Diego, 1993, pp. 102-111.
48. H. KRAWCZYK, Secret sharing made short, in Advances in Cryptology - CRYPTO '93, D. R. Stinson, ed., Lect. Notes Comput. Sci. 773, Springer-Verlag, Berlin, 1994, pp. 136-146.
49. K. M. MARTIN, New secret sharing schemes from old, J. Combin. Math. Combin. Comput., 14 (1993), pp. 65-77.
50. E. MARTINEZ-MORO, J. MOZO-FERNANDEZ, AND C. MUNUERA, Compounding secret sharing schemes, Australas. J. Combin., 30 (2004), pp. 277-290.
51. K. MULMULEY, A fast parallel algorithm to compute the rank of a matrix over an arbitrary field, Combinatorica, 7 (1987), pp. 101-104.
52. M. O. RABIN, Randomized Byzantine generals, in Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, Boston, 1983, pp. 403-409.
53. A. RENVALL AND C. DING, A nonlinear secret sharing scheme, in ACISP: Information Security and Privacy: Australasian Conference, Lect. Notes Comput. Sci. 1172, Springer-Verlag, Berlin, 1996, pp. 56-66.
54. A. SHAMIR, How to share a secret, Comm. ACM, 22 (1979), pp. 612-613.
55. G. J. SIMMONS, An introduction to shared secret and/or shared control and their application, in Contemporary Cryptology, The Science of Information Integrity, G. J. Simmons, ed., IEEE Press, Piscataway, NJ, 1992, pp. 441-497.
56. G. J. SIMMONS, W. JACKSON, AND K. M. MARTIN, The geometry of shared secret schemes, Bull. Inst. Combin. Appl., 1 (1991), pp. 71-88.
57. J. SIMONIS AND A. ASHIKHMIN, Almost affine codes, Des. Codes Cryptogr., 14 (1998), pp. 179-197.
58. J. SORENSON, Two fast GCD algorithms, J. Algorithms, 16 (1994), pp. 110-144.
59. P. M. SPIRA, On time hardware tradeoffs for Boolean functions, in Proceedings of the 4th Annual Hawaii International Symposium on System Sciences, Western Periodicals Co., North Hollywood, 1971, pp. 525-527.
60. D. R. STINSON, An explication of secret sharing schemes, Des. Codes Cryptogr., 2 (1992), pp. 357-390.
61. D. R. STINSON, New general lower bounds on the information rate of secret sharing schemes, in Advances in Cryptology - CRYPTO '92, E. F. Brickell, ed., Lect. Notes Comput. Sci. 740, Springer-Verlag, Berlin, 1993, pp. 168-182.
62. D. R. STINSON AND J. L. MASSEY, An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions, J. Cryptology, 8 (1995), pp. 167-173.
63. D. R. STINSON AND S. A. VANSTONE, A combinatorial approach to threshold schemes, SIAM J. Discrete Math., 1 (1988), pp. 230-236.
64. A. C. YAO, Unpublished manuscript, Presented at Oberwolfach (Oberwolfach, Germany) and DIMACS (Piscataway, NJ) workshops, 1989.