An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Elements of information theory
Elements of information theory
Some improved bounds on the information rate of perfect secret sharing schemes
Journal of Cryptology
An explication of secret sharing schemes
Designs, Codes and Cryptography
Geometric secret sharing schemes and their duals
Designs, Codes and Cryptography
On key distribution via true broadcasting
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
On the information rate of perfect secret sharing schemes
Designs, Codes and Cryptography
Provably secure session key distribution: the three party case
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Randomness in distribution protocols
Information and Computation
Tight Bounds on the Information Rate of Secret SharingSchemes
Designs, Codes and Cryptography
On Some Methods for Unconditionally Secure Key Distributionand Broadcast Encryption
Designs, Codes and Cryptography - Special issue: selected areas in cryptography I
Perfectly secure key distribution for dynamic conferences
Information and Computation
Communications of the ACM
Using encryption for authentication in large networks of computers
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
On the Distribution of a Key Distribution Center
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
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
How to (Really) Share a Secret
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
On the Size of Shares for Secret Sharing Schemes
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Lower bounds for monotone span programs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Distributed Pseudo-random functions and KDCs
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient communication-storage tradeoffs for multicast encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Secret sharing schemes with bipartite access structure
IEEE Transactions on Information Theory
New bounds on the information rate of secret sharing schemes
IEEE Transactions on Information Theory
A unified model for unconditionally secure key distribution
Journal of Computer Security
Linear threshold multisecret sharing schemes
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
| Hi-index | 5.23 |
In this paper we investigate the issues concerning the use of a single server across a network, the key distribution center (KDC) to enable private communications within groups of users. After providing several motivations, showing the advantages related to the distribution of the task accomplished by this server, we describe a model for such a distribution, and present bounds on the amount of resources required in a real-world implementation: random bits, memory storage, and messages to be exchanged. Moreover, we introduce a linear algebraic approach to design optimal schemes distributing a KDC, and we point out that some previous constructions belong to the proposed framework.