CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Secure group communications using key graphs
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Revocation and Tracing Schemes for Stateless Receivers
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
The LSD Broadcast Encryption Scheme
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Flexible Access Control with Master Keys
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
A Revocation Scheme with Minimal Storage at Receivers
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Identity-based trace and revoke schemes
ProvSec'11 Proceedings of the 5th international conference on Provable security
Efficient broadcast encryption scheme with log-key storage
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
| Hi-index | 0.00 |
In this paper, we propose a new broadcast encryption method which is a modification of the Complete Subtree method and it reduces the number of keys a receiver stores to one. There have been proposed some methods which minimize the number of keys for a receiver to one. The most efficient one among them uses RSA cryptosystem in order to reduce the number of keys, while the proposed method is based on Rabin cryptosystem. The computational overhead at receivers in our method is around 1 / log2e compared with the most efficient method proposed previously, where e is a public exponent of RSA. We examine this result by experiments. Therefore, the proposed method is the most efficient among tree based one-key methods with respect to the computational overhead at receivers. This reduction in the computational overhead is achieved in exchange for an increase in the size of nonsecret memory by [ log N * few (e. g. eight)] bits, where N is the total number of receivers. The security of the proposed method is equivalent to Rabin cryptosystem in the sense of key-intractability in the random oracle model.