Proceedings of CRYPTO 84 on Advances in cryptology
Communications of the ACM
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
On the Size of Shares for Secret Sharing Schemes
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
On the Information Rate of Secret Sharing Schemes (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
New General Lower Bounds on the Information Rate of Secret Sharing Schemes
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Universally Ideal Secret Sharing Schemes (Preliminary Version)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Nonperfect Secret Sharing Schemes
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
A Construction of Practical Secret Sharing Schemes using Linear Block Codes
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Cumulative Arrays and Geometric Secret Sharing Schemes
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Graph decompositions and secret sharing schemes
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Classification of ideal homomorphic threshold schemes over finite Abelian groups
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
A General Decomposition Construction for Incomplete SecretSharing Schemes
Designs, Codes and Cryptography
Non-perfect Secret Sharing over General Access Structures
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
General Perfect Secret Sharing Schemes
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Shared generation of pseudo-random functions
Journal of Complexity - Special issue on coding and cryptography
Strongly secure ramp secret sharing schemes for general access structures
Information Processing Letters
Generalised Cumulative Arrays in Secret Sharing
Designs, Codes and Cryptography
New results on non-perfect sharing of multiple secrets
Journal of Systems and Software
Secure Computation from Random Error Correcting Codes
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
A New (k,n)-Threshold Secret Sharing Scheme and Its Extension
ISC '08 Proceedings of the 11th international conference on Information Security
A Fast (3,n)-Threshold Secret Sharing Scheme Using Exclusive-OR Operations
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Strongly secure ramp secret sharing schemes for general access structures
Information Processing Letters
General short computational secret sharing schemes
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Authenticated data structures for graph and geometric searching
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Matroids can be far from ideal secret sharing
TCC'08 Proceedings of the 5th conference on Theory of cryptography
A general (k, n) scalable secret image sharing scheme with the smooth scalability
Journal of Systems and Software
On matroids and non-ideal secret sharing
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Optimum general threshold secret sharing
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Hi-index | 0.00 |
This paper shows that nonperfect secret sharing schemes (NSS) have matroid structures and presents a direct link between the secret sharing matroids and entropy for both perfect and nonperfect schemes. We define natural classes of NSS and derive a lower bound of |Vi| for those classes. "Ideal" nonperfect schemes are defined based on this lower bound. We prove that every such ideal secret sharing scheme has a matroid structure. The rank function of the matroid is given by the entropy divided by some constant. It satisfies a simple equation which represents the access level of each subset of participants.