On some methods for unconditionally secure key distribution and broadcast encryption
To make full use of cryptographic methods -- especially conventional private-key cryptosystems -- to protect communications in a network, proper keys need to be distributed to network users in a secure fashion. One possible approach is based on key predistribution, i.e. methods whereby a trusted authority distributes secret information in such a way that only specified subsets of network users are able to compute certain keys. The key predistribution problem, while interesting on its own, is closely related to the broadcast encryption problem. Broadcast encryption consists of a key predistribution phase followed at some later time by a broadcast message which is to be decrypted by a specified (but not known ahead of time) subset of network users only. In practice for both problems special attention is paid to the information rate, i.e. to the amount of secret information that needs to be stored by each user. In the paper both problems are studied using the tools of information theory, so the security provided is unconditional. In the first part of the paper the key predistribution problem is studied. First, formal definitions of a Key Predistribution Scheme (KPS) and its information rate are introduced together with the notation used in the rest of the paper. Then some known KPSs are surveyed and their information rate investigated. The attractive idea of Key Distribution Pattern (KDP) is studied more closely and a new technique that makes use of resilient functions and leads to an improvement in the information rate of KDP is presented. In the second part of the paper the one-time broadcast encryption problem is studied. Again, formal definitions of One-Time Broadcast Encryption Scheme (OTBES) and its information rate are introduced and some constructions are given. Then, a general approach to construct OTBES by combining several KPSs with an ideal secret sharing scheme is presented. This approach is then illustrated by using a combination of balanced incomplete block designs and threshold schemes to construct a new broadcast encryption scheme.
- Some new results on key distribution patterns and broadcast encryption
- Key predistribution schemes and one-time broadcast encryption schemes from algebraic geometry codes
- A broadcast key distribution scheme based on block designs
- Trade-offs between communication and storage in unconditionally secure schemes for broadcast encryption and interactive key distribution
- scientific article; zbMATH DE number 1024079
- Some new results on key distribution patterns and broadcast encryption
- Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution
- Generalized cover-free families.
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- A framework for unconditionally secure public-key encryption (with possible decryption errors)
- Constructions for key distribution patterns
- A ramp model for distributed key distribution schemes
- Linear broadcast encryption schemes
- Generation of key predistribution schemes using secret sharing schemes
- Multireceiver authentication codes: Models, bounds, constructions, and extensions
- Linear key predistribution schemes
- Improving the trade-off between storage and communication in broadcast encryption schemes
- On key storage in secure networks
- Complete tree subset difference broadcast encryption scheme and its analysis
- Unconditional secure conference key distribution schemes with disenrollment capability
- Multicast key distribution schemes based on Stinson-Van Trung designs
- On \(\tau\)-time secure key agreement
- Generation of key predistribution schemes using secret sharing schemes
- An application of ramp schemes to broadcast encryption
- Linear Time Constructions of Some d-Restriction Problems
- Unconditionally secure revocable storage: tight bounds, optimal construction, and robustness
- Cryptography for Unconditionally Secure Message Transmission in Networks (Invited Talk)
- UNCONDITIONALLY SECURE CONFERENCE KEY DISTRIBUTION: SECURITY NOTIONS, BOUNDS AND CONSTRUCTIONS
- Trade-offs between communication and storage in unconditionally secure schemes for broadcast encryption and interactive key distribution
- Constructions of unconditionally secure broadcast encryption from key predistribution systems with trade-offs between communication and storage
- Key predistribution schemes and one-time broadcast encryption schemes from algebraic geometry codes
- On optimal cryptographic key derivation
- A broadcast key distribution scheme based on block designs
- Provably secure (broadcast) homomorphic signcryption
- On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks
- RESILIENT LKH: SECURE MULTICAST KEY DISTRIBUTION SCHEMES
- Key distribution system based on Hadamard designs
- Advances in Cryptology - ASIACRYPT 2003
- Broadcast authentication for group communication
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures
- On the construction of \((w,r)\) cover-free codes
- Explicit constructions of separating hash families from algebraic curves over finite fields
This page was built for publication: On some methods for unconditionally secure key distribution and broadcast encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1369720)
