Applications of combinatorial designs in computer science
ACM Computing Surveys (CSUR)
How to (really) share a secret
CRYPTO '88 Proceedings on Advances in cryptology
Secret sharing over infinite domains (extended abstract)
CRYPTO '89 Proceedings on Advances in cryptology
On the Dealer‘s Randomness Required in Secret Sharing Schemes
Designs, Codes and Cryptography
On the bound for anonymous secret sharing schemes
Discrete Applied Mathematics
A combinatorial characterization of regular anonymous perfect threshold schemes
Information Processing Letters
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 Security of the Threshold Scheme Based on the Chinese Remainder Theorem
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Threshold Schemes with Disenrollment
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Providing Anonymity in Unconditionally Secure Secret Sharing Schemes
Designs, Codes and Cryptography
Combinatorial design of key distribution mechanisms for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
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
Weakly-private secret sharing schemes
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Combinatorial Designs for Authentication and Secrecy Codes
Foundations and Trends in Communications and Information Theory
Crypto topics and applications II
Algorithms and theory of computation handbook
On partial anonymity in secret sharing
EuroPKI'07 Proceedings of the 4th European conference on Public Key Infrastructure: theory and practice
| Hi-index | 0.00 |