An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Key storage in secure networks
Discrete Applied Mathematics
Secure Broadcasting Using the Secure Lock
IEEE Transactions on Software Engineering
A matrix key-distribution scheme
Journal of Cryptology
A new threshold scheme and its application in designing the conference key distribution cryptosystem
Information Processing Letters
Elements of information theory
Elements of information theory
A conference key broadcasting system using sealed locks
Information Systems
Interaction in key distribution schemes
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On key distribution via true broadcasting
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Digital signets: self-enforcing protection of digital information (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On Some Methods for Unconditionally Secure Key Distributionand Broadcast Encryption
Designs, Codes and Cryptography - Special issue: selected areas in cryptography I
Generalized Beimal-Chor schemes for broadcast encryption and interactive key distribution
Theoretical Computer Science
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
SIAM Journal on Discrete Mathematics
Some New Results on Key Distribution Patterns and BroadcastEncryption
Designs, Codes and Cryptography
An application of ramp schemes to broadcast encryption
Information Processing Letters
Efficient dynamic traitor tracing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
New constructions for multicast re-keying schemes using perfect hash families
Proceedings of the 7th ACM conference on Computer and communications security
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Handbook of Applied Cryptography
Handbook of Applied Cryptography
A Secure Re-keying Scheme with Key Recovery Property
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
On the Distribution of a Key Distribution Center
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
The LSD Broadcast Encryption Scheme
CRYPTO '02 Proceedings of the 22nd 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
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Security of the Center in Key Distribution Schemes
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Traitor Tracing with Constant Transmission Rate
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
A Quick Group Key Distribution Scheme with "Entity Revocation"
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
On Unconditionally Secure Robust Distributed Key Distribution Centers
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient Trace and Revoke Schemes
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Proceedings of the First International Workshop on Information Hiding
Self-Healing Key Distribution with Revocation
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
A ramp model for distributed key distribution schemes
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
ELK, a New Protocol for Efficient Large-Group Key Distribution
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
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
Efficient re-keying protocols for multicast encryption
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
A group key distribution scheme with decentralised user join
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Fault tolerant and distributed broadcast encryption
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Communication in key distribution schemes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Combinatorial properties of frameproof and traceability codes
IEEE Transactions on Information Theory
A pairwise key establishment scheme for heterogeneous sensor networks
Proceedings of the 1st ACM international workshop on Heterogeneous sensor and actor networks
Asymmetric key pre-distribution scheme for sensor networks
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
A key distribution scheme is a method by means of which a trusted party distributes pieces of information among a set of users in such a way that each group of them can compute a common key for secure communication. In this paper we present a model for unconditionally secure key distribution schemes, i.e., schemes whose security is independent of the power of the adversary. We prove lower bounds on the amount of information the trusted party has to generate and each user has to keep secret in such schemes, and we show that some previous unconditionally secure models for key distribution fall in our model. As a consequence, the lower bounds given in the literature for these models can be seen as corollaries of our results. Hence, the main contribution of the paper consists in pointing out a sort of common structure underlying some apparently different key distribution techniques.