An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Codes and cryptography
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
Some New Results on Key Distribution Patterns and BroadcastEncryption
Designs, Codes and Cryptography
An application of ramp schemes to broadcast encryption
Information Processing Letters
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Linear Key Predistribution Schemes
Designs, Codes and Cryptography
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Linear broadcast encryption schemes
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Communication in key distribution schemes
IEEE Transactions on Information Theory
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
Complete tree subset difference broadcast encryption scheme and its analysis
Designs, Codes and Cryptography
| Hi-index | 0.04 |
The most important point in the design of broadcast encryption schemes (BESs) is to obtain a good trade-off between the amount of secret information that must be stored by every user and the length of the broadcast message, which are measured, respectively, by the information rate ρ and the broadcast information rate ρB. In this paper, we present a simple method to combine two given BESs in order to improve the trade-off between ρ and ρB by finding BESs with good information rate ρ for arbitrarily many different values of the broadcast information rate ρB. We apply this technique to threshold (R,T)-BESs and we present a method to obtain, for every rational value 1/R ≤ ρB ≤ 1, a (R,T)-BES with optimal information rate ρ among all (R,T)-BESs that can be obtained by combining two of the (R,T)-BESs proposed by Blundo et al. (Lecture Notes in Comput. Sci. 1190 (1996) 387-400).