On the power of nonlinear secret-sharing

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2001, Pages 188-202

  Beimel, A ^a   Ishai, Y ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; FUNCTION EVALUATION; POLYNOMIALS; SET THEORY;

MONOTONE FUNCTION; NONLINEAR SECRET SHARING;

INFORMATION THEORY;

EID: 0034865642     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (55)

1. Using smoothness to achieve parallelism
2. Superpolynomial lower bounds for monotone span programs
3. Simultaneous messages vs. communication
4. Multiparty protocols and logspace-hard pseudorandom sequences
5. General short computational secret sharing schemes
6. Circuits over PP and PL
7. Lower bounds for monotone span programs
8. Completeness theorems for noncryptographic fault-tolerant distributed computations
9. Generalized secret sharing and monotone functions
10. On computing the determinant in small parallel time using a small number of processors
11. Safeguarding cryptographic keys
12. On the information rate of secret sharing schemes
13. Timed commitments
14. Fast parallel matrix and GCD computations
15. Some ideal secret sharing schemes
16. On the classification of ideal secret sharing schemes
17. Some improved bounds on the information rate of perfect secret sharing schemes
18. Structure and importance of the logspace-mod class
19. On the size of shares for secret sharing schemes
20. Multiparty unconditionally secure protocols
21. On the complexity of verifiable secret sharing and multiparty computation
22. General secure multi-party computation from any linear secret-sharing scheme
23. The dealer's random bits in perfect secret sharing schemes
24. The size of a share must be large
25. Shared generation of authenticators and signatures
26. Homomorphic zero-knowledge threshold schemes over any finite abelian group
27. On the information rate of perfect secret sharing schemes
28. A linear construction of secret sharing schemes
29. Efficient algorithms for computing the Jacobi symbol
30. Span programs over rings and how to share a secret from a module
31. A minimal model for secure computation
32. A characterization of span program size and improved lower bounds for monotone span programs
33. The monotone and planar circuit value problem is complete for P
34. Probabilistic encryption
35. A survey of fast exponentiation methods
36. The shrinkage exponent of de Morgan formulas is 2
37. Private simultaneous messages protocols with applications
38. Secret sharing schemes realizing general access structure
39. On span programs
40. Secret sharing made short
41. New secret sharing schemes from old
42. A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
43. Randomized Byzantine generals
44. A nonlinear secret sharing scheme
45. How to share a secret
46. An introduction to shared secret and/or shared control and their application
47. The geometry of shared secret schemes
48. On time hardware tradeoffs for Boolean functions
49. An explication of secret sharing schemes
50. New general lower bounds on the information rate of secret sharing schemes
51. An infinite class of counterexamples to a conjecture concerning non-linear resilient functions
52. A combinatorial approach to threshold schemes