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
Simple and fault-tolerant key agreement for dynamic collaborative groups
Proceedings of the 7th ACM conference on Computer and communications security
Cryptographic solution to a problem of access control in a hierarchy
ACM Transactions on Computer Systems (TOCS)
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Light Weight Broadcast Exclusion Using Secret Sharing
ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
An Efficient Public Key Traitor Tracing Scheme
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Coding Constructions for Blacklisting Problems without Computational Assumptions
CRYPTO '99 Proceedings of the 19th 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
Flexible Access Control with Master Keys
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
A Quick Group Key Distribution Scheme with "Entity Revocation"
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Efficient Trace and Revoke Schemes
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Number-theoretic constructions of efficient pseudo-random functions
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Efficient communication-storage tradeoffs for multicast encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Broadcast encryption with short keys and transmissions
Proceedings of the 3rd ACM workshop on Digital rights management
Multicast key distribution schemes based on Stinson-Van Trung designs
Cybernetics and Systems Analysis
Efficient key management for cryptographically enforced access control
Computer Standards & Interfaces
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Establishing the broadcast efficiency of the Subset Difference Revocation Scheme
Designs, Codes and Cryptography
Ternary Subset Difference Method and Its Quantitative Analysis
Information Security Applications
Variations on a theme by Akl and Taylor: Security and tradeoffs
Theoretical Computer Science
An efficient revocation scheme with minimal message length for stateless receivers
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
The interval revocation scheme for broadcasting messages to stateless receivers
Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
Lower bounds for subset cover based broadcast encryption
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Identity-based trace and revoke schemes
ProvSec'11 Proceedings of the 5th international conference on Provable security
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
A tree based one-key broadcast encryption scheme with low computational overhead
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Dynamic fingerprinting over broadcast using revocation scheme
WISA'04 Proceedings of the 5th international conference on Information Security Applications
Generic transformation for scalable broadcast encryption schemes
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Efficient broadcast encryption scheme with log-key storage
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Fast algorithms for the free riders problem in broadcast encryption
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Key management for multicast fingerprinting
ICISS'05 Proceedings of the First international conference on Information Systems Security
Complete tree subset difference broadcast encryption scheme and its analysis
Designs, Codes and Cryptography
| Hi-index | 0.00 |
A revocation or a broadcast encryption technology allows a sender to transmit information securely over a broadcast channel to a select group of receivers excluding some revoked receivers. In this paper we propose two efficient revocation methods which are suitable for stateless receivers. The proposed methods use an a-ary key tree structure and require at most r (log (N/r) / log a + 1) ciphertexts broadcast. Our Method 1 requires only one key to be stored and O (2a log5 N / log a) computational overhead at a receiver, whereas Method 2 requires log N / log a keys and O (2a) computational overhead, where N and r respectively denote the total number of receivers and the number of revoked receivers. Our methods are very efficient with respect to the number of keys each receiver stores, especially Method 1 minimizes it.