Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Revocation and Tracing Schemes for Stateless Receivers
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Toward Hierarchical Identity-Based Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Hierarchical ID-Based Cryptography
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Collusion resistant broadcast encryption with short ciphertexts and private keys
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Hierarchical identity based encryption with constant size ciphertext
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Public key broadcast encryption with low number of keys and constant decryption time
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Hi-index | 0.00 |
In this paper, we present three new public key broadcast encryption (PKBE) schemes using the receiver's particular identifier. Our schemes are based on PKBE schemes (called BGW schemes) introduced by Boneh et al. The first two schemes have a similar structure to the BGW schemes. However, our schemes provide more flexible trade-offs between public key size and ciphertext size because the public keys for each subgroup in the BGW schemes are replaced with group identifiers. In addition, we extend our scheme to the hierarchical structure which can efficiently treat the large number of receivers. Our schemes are provably secure under the BDHE assumption in the random oracle model.