Tight Bounds on the Information Rate of Secret SharingSchemes
Designs, Codes and Cryptography
A Linear Construction of Secret Sharing Schemes
Designs, Codes and Cryptography
A General Decomposition Construction for Incomplete SecretSharing Schemes
Designs, Codes and Cryptography
Sharing one secret vs. sharing many secrets: tight bounds on the average improvement ratio
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Sharing one secret vs. sharing many secrets
Theoretical Computer Science - Mathematical foundations of computer science
Secret Sharing in Graph-Based Prohibited Structures
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Sharing Multiple Secrets: Models, Schemes and Analysis
Designs, Codes and Cryptography
Improved constructions of secret sharing schemes by applying (λ, ω)-decompositions
Information Processing Letters
On Linear Secret Sharing for Connectivity in Directed Graphs
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Hypergraph decomposition and secret sharing
Discrete Applied Mathematics
Secret Sharing and Non-Shannon Information Inequalities
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
An impossibility result on graph secret sharing
Designs, Codes and Cryptography
Weakly-private secret sharing schemes
TCC'07 Proceedings of the 4th conference on Theory of cryptography
SIAM Journal on Discrete Mathematics
Secret-sharing schemes: a survey
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
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
Finding lower bounds on the complexity of secret sharing schemes by linear programming
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On the optimization of bipartite secret sharing schemes
Designs, Codes and Cryptography
Designs, Codes and Cryptography
On matroids and non-ideal secret sharing
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Finding lower bounds on the complexity of secret sharing schemes by linear programming
Discrete Applied Mathematics
The complexity of the graph access structures on six participants
Designs, Codes and Cryptography
Information Sciences: an International Journal
| Hi-index | 0.00 |