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
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 Some Methods for Unconditionally Secure Key Distributionand Broadcast Encryption
Designs, Codes and Cryptography - Special issue: selected areas in cryptography I
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
Efficient and Secure Conference-Key Distribution
Proceedings of the International Workshop on Security Protocols
Communication in key distribution schemes
IEEE Transactions on Information Theory
A Secure Re-keying Scheme with Key Recovery Property
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Unconditionally Secure Key Insulated Cryptosystems: Models, Bounds and Constructions
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Long-Lived Broadcast Encryption
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Unconditionally Secure Anonymous Encryption and Group Authentication
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A New Digital Signature Scheme on ID-Based Key-Sharing Infrastructures
ISW '99 Proceedings of the Second International Workshop on Information Security
ISW '00 Proceedings of the Third International Workshop on Information Security
Efficient Methods for Integrating Traceability and Broadcast Encryption
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
A Practical Revocation Scheme for Broadcast Encryption Using Smart Cards
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
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
An optimal subset cover for broadcast encryption
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Broadcast encryption using efficient key distribution and renewal for ubiquitous environments
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
An intelligent and efficient traitor tracing for ubiquitous environments
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IV
Efficient broadcast encryption scheme with log-key storage
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Collusion resistant self-healing key distribution in mobile wireless networks
International Journal of Wireless and Mobile Computing
| Hi-index | 0.00 |
In 1993, Beimel and Chor presented an unconditionally secure interactive protocol which allows a subset of users in a network to establish it common key. This scheme made use of a key predistribution scheme due to Blom. In this paper, we describe some variations and generalizations of the Beimel-Chor scheme, including broadcast encryption schemes as well as interactive key distribution schemes. Our constructions use the key predistribution scheme of Blundo et al, which is a generalization of the Blom scheme. We obtain families of schemes in which the amount of secret information held by the network users can be traded off against, the amount of information that needs to be broadcast. We also discuss lower bounds on the storage and communication requirements of protocols of these types. Some of our schemes are optimal (or close to optimal) with respect to these bounds.