Generalized linear threshold scheme
Proceedings of CRYPTO 84 on Advances in cryptology
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Designs, Codes and Cryptography
Journal of Combinatorial Theory Series B
An explication of secret sharing schemes
Designs, Codes and Cryptography
Perfect Secret Sharing Schemes on Five Participants
Designs, Codes and Cryptography
Tight Bounds on the Information Rate of Secret SharingSchemes
Designs, Codes and Cryptography
A characterization of span program size and improved lower bounds for monotone span programs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Designs, Codes and Cryptography
Weighted threshold secret sharing schemes
Information Processing Letters
Inequalities for Shannon entropy and Kolmogorov complexity
Journal of Computer and System Sciences - Eleventh annual conference on computational learning theory&slash;Twelfth Annual IEEE conference on computational complexity
Communications of the ACM
Journal of Algebraic Combinatorics: An International Journal
How to (Really) Share a Secret
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Discrete Convex Analysis: Monographs on Discrete Mathematics and Applications 10
Discrete Convex Analysis: Monographs on Discrete Mathematics and Applications 10
Separating the Power of Monotone Span Programs over Different Fields
SIAM Journal on Computing
On the Power of Nonlinear Secret-Sharing
SIAM Journal on Discrete Mathematics
Hierarchical Threshold Secret Sharing
Journal of Cryptology
Characterizing Ideal Weighted Threshold Secret Sharing
SIAM Journal on Discrete Mathematics
Ideal Multipartite Secret Sharing Schemes
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Secret Sharing and Non-Shannon Information Inequalities
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Multipartite Secret Sharing by Bivariate Interpolation
Journal of Cryptology
General secure multi-party computation from any linear secret-sharing scheme
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Matroids can be far from ideal secret sharing
TCC'08 Proceedings of the 5th conference on Theory of cryptography
On the optimization of bipartite secret sharing schemes
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Ideal hierarchical secret sharing schemes
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Secret sharing schemes with bipartite access structure
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
This paper is a survey of the main results and open problems in a line of work that was initiated shortly after secret sharing was introduced. Namely, the construction of ideal linear secret sharing schemes for access structures that are natural generalizations of the threshold ones and have interesting properties for the applications. Some of them have hierarchical properties, while other ones are suitable for situations requiring the agreement of several parties. These access structures are multipartite, that is, the participants are distributed into several parts and all participants in the same part play an equivalent role in the structure. This line of work has received an impulse from a recently discovered connection between ideal multipartite secret sharing schemes and integer polymatroids.