On Some Methods for Unconditionally Secure Key Distributionand Broadcast Encryption
Designs, Codes and Cryptography - Special issue: selected areas in cryptography I
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Some Bounds and a Construction for Secure Broadcast Encryption
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
ISW '00 Proceedings of the Third International Workshop on Information Security
Linear broadcast encryption schemes
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Improving the trade-off between storage and communication in broadcast encryption schemes
Discrete Applied Mathematics
A unified model for unconditionally secure key distribution
Journal of Computer Security
A novel Conference Key Management solution for Secure Dynamic Conferencing
International Journal of Security and Networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Asymmetric key pre-distribution scheme for sensor networks
IEEE Transactions on Wireless Communications
Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Weakly-private secret sharing schemes
TCC'07 Proceedings of the 4th conference on Theory of cryptography
| Hi-index | 754.84 |
A (g, b) key distribution scheme allows conferences of g users to generate secret keys, such that disjoint coalitions of b users cannot gain any information on the generated key (in the information-theoretic sense). We study the relationships between communication and space efficiency of key distribution schemes. We prove that communication does not help in the context of unrestricted schemes. On the other hand, we show that for restricted schemes, which are secure only when used by a limited number of conferences, communication can substantially improve the space efficiency. We also present lower bounds on the space efficiency of restricted schemes