Limits on the provable consequences of one-way permutations
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Perfect cryptographic security from partially independent channels
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Secure communications over insecure channels
Communications of the ACM
Multiparty Secret Key Exchange Using a Random Deal of Cards
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Characterization of Optimal Key Set Protocols
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Fischer's cryptographic protocols
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Characterization of optimal key set protocols
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
A one-round secure message broadcasting protocol through a key sharing tree
Information Processing Letters
Characterization of optimal key set protocols
Discrete Applied Mathematics
Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |