Generalized linear threshold scheme
Proceedings of CRYPTO 84 on Advances in cryptology
Clique partitions, graph compression and speeding-up algorithms
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
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
Graph decompositions and secret sharing schemes
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Size of shares and probability of cheating in threshold schemes
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Nonperfect secret sharing schemes and matroids
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Access control and signatures via quorum secret sharing
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Access Control and Signatures via Quorum Secret Sharing
IEEE Transactions on Parallel and Distributed Systems
Detection of Cheaters in Vector Space Secret Sharing Schemes
Designs, Codes and Cryptography
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
Fully Dynamic Secret Sharing Schemes
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Secret sharing schemes with three or four minimal qualified subsets
Designs, Codes and Cryptography
Secret sharing schemes on access structures with intersection number equal to one
Discrete Applied Mathematics
A note on secret sharing schemes with three homogeneous access structure
Information Processing Letters
Ideal Multipartite Secret Sharing Schemes
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
On a Fast (k,n)-Threshold Secret Sharing Scheme
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
Designs, Codes and Cryptography
Secret sharing schemes on access structures with intersection number equal to one
Discrete Applied Mathematics
General short computational secret sharing schemes
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
On secret sharing schemes, matroids and polymatroids
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Secret sharing schemes on access structures with intersection number equal to one
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Optimal complexity of secret sharing schemes with four minimal qualified subsets
Designs, Codes and Cryptography
On the optimization of bipartite secret sharing schemes
Designs, Codes and Cryptography
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
| Hi-index | 0.00 |
We derive new limitations on the information rate and the average information rate of secret sharing schemes for access structure represented by graphs. We give the first proof of the existence of access structures with optimal information rate and optimal average information rate less that 1/2 + 驴, where 驴 is an arbitrary positive constant. We also provide several general lower bounds on information rate and average information rate of graphs. In particular, we show that any graph with n vertices admits a secret sharing scheme with information rate 驴((logn)/n).