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
Authentication Schemes, Perfect Local Randomizers, Perfect Secrecy and Secret Sharing Schemes
Designs, Codes and Cryptography - Special issue dedicated to Gustavus J. Simmons
On the Dealer‘s Randomness Required in Secret Sharing Schemes
Designs, Codes and Cryptography
Tight Bounds on the Information Rate of Secret SharingSchemes
Designs, Codes and Cryptography
A Linear Construction of Secret Sharing Schemes
Designs, Codes and Cryptography
Unconditionally Secure Group Authentication
Designs, Codes and Cryptography
A General Decomposition Construction for Incomplete SecretSharing Schemes
Designs, Codes and Cryptography
Lower bounds on the information rate of secret sharing schemes with homogeneous access structure
Information Processing Letters
Ideal Threshold Schemes from Orthogonal Arrays
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Providing Anonymity in Unconditionally Secure Secret Sharing Schemes
Designs, Codes and Cryptography
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
Randomness in secret sharing and visual cryptography schemes
Theoretical Computer Science
A Linear Algebraic Approach to Metering Schemes
Designs, Codes and Cryptography
Secret sharing schemes with three or four minimal qualified subsets
Designs, Codes and Cryptography
Sharing Multiple Secrets: Models, Schemes and Analysis
Designs, Codes and Cryptography
Secret sharing schemes on access structures with intersection number equal to one
Discrete Applied Mathematics
Improved constructions of secret sharing schemes by applying (λ, ω)-decompositions
Information Processing Letters
A note on secret sharing schemes with three homogeneous access structure
Information Processing Letters
Robust computational secret sharing and a unified account of classical secret-sharing goals
Proceedings of the 14th ACM conference on Computer and communications security
Revisiting the Karnin, Greene and Hellman Bounds
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Unidirectional key distribution across time and space with applications to RFID security
SS'08 Proceedings of the 17th conference on Security symposium
Secret sharing schemes on access structures with intersection number equal to one
Discrete Applied Mathematics
Efficient secret sharing without a mutually trusted authority
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
Ideal threshold schemes from MDS codes
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
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
Matroids can be far from ideal secret sharing
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Crypto topics and applications II
Algorithms and theory of computation handbook
SIAM Journal on Discrete Mathematics
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
Ideal secret sharing schemes with share selectability
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Characterizing ideal weighted threshold secret sharing
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
On the optimization of bipartite secret sharing schemes
Designs, Codes and Cryptography
Information Sciences: an International Journal
| Hi-index | 0.00 |