Universally ideal secret-sharing schemes
- 1 May 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 40 (3), 786-794
- https://doi.org/10.1109/18.335890
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- On the size of shares for secret sharing schemesJournal of Cryptology, 1993
- On secret-sharing matroidsJournal of Combinatorial Theory, Series B, 1992
- On the classification of ideal secret sharing schemesJournal of Cryptology, 1991
- Generalized Secret Sharing and Monotone FunctionsLecture Notes in Computer Science, 1990
- Monotone circuits for connectivity require super-logarithmic depthPublished by Association for Computing Machinery (ACM) ,1988
- On secret sharing systemsIEEE Transactions on Information Theory, 1983
- How to share a secretCommunications of the ACM, 1979
- A Homotopy Theorem for Matroids, ITransactions of the American Mathematical Society, 1958