An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
A matrix key-distribution scheme
Journal of Cryptology
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On the Key Predistribution System: A Practical Solution to the Key Distribution Problem
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Multiparty Secret Key Exchange Using a Random Deal of Cards
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
On Some Methods for Unconditionally Secure Key Distributionand Broadcast Encryption
Designs, Codes and Cryptography - Special issue: selected areas in cryptography I
| Hi-index | 0.00 |
A (g, b) key distribution scheme allows conferences of g users to generate secret keys, so that disjoint coalitions of b users cannot gain any information on the key (in the information theoretic sense). In this work we study the relationships between interaction and space efficiency of key distribution schemes. We prove that interaction does not help in the context of unrestricted schemes. On the other hand, we show that for restricted schemes, which are secure for a limited number of conferences, interaction can substantially improve the space efficiency.