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
Coding Constructions for Blacklisting Problems without Computational Assumptions
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Long-Lived Broadcast Encryption
CRYPTO '00 Proceedings of the 20th 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
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
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
Efficient Methods for Integrating Traceability and Broadcast Encryption
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Fault tolerant and distributed broadcast encryption
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
On the security of group communication schemes based on symmetric key cryptosystems
Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
New broadcast encryption scheme using tree-based circle
Proceedings of the 5th ACM workshop on Digital rights management
A Mechanism for Communication-Efficient Broadcast Encryption over Wireless Ad Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
On the security of group communication schemes
Journal of Computer Security - Special Issue on Security of Ad-hoc and Sensor Networks
Public-key traitor tracing from efficient decoding and unbounded enrollment: extended abstract
Proceedings of the 8th ACM workshop on Digital rights management
IWDW '07 Proceedings of the 6th International Workshop on Digital Watermarking
Birthday Paradox Based Security Analysis of Certain Broadcast Encryption Schemes
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Ternary Subset Difference Method and Its Quantitative Analysis
Information Security Applications
Tracing and Revoking Pirate Rebroadcasts
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Fingercasting-joint fingerprinting and decryption of broadcast messages
Transactions on data hiding and multimedia security II
Pirate evolution: how to make the most of your traitor keys
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Lower bounds for subset cover based broadcast encryption
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
How to construct interval encryption from binary tree encryption
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
On the effects of pirate evolution on the design of digital content distribution systems
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
A generic transformation from symmetric to asymmetric broadcast encryption
ISC'06 Proceedings of the 9th international conference on Information Security
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
A practical clumped-tree multicast encryption scheme
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
Generic transformation for scalable broadcast encryption schemes
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Security weaknesses of certain broadcast encryption schemes
DRMTICS'05 Proceedings of the First international conference on Digital Rights Management: technologies, Issues, Challenges and Systems
A broadcast encryption scheme with free-riders but unconditional security
DRMTICS'05 Proceedings of the First international conference on Digital Rights Management: technologies, Issues, Challenges and Systems
A novel broadcast encryption based on time-bound cryptographic keys
DRMTICS'05 Proceedings of the First international conference on Digital Rights Management: technologies, Issues, Challenges and Systems
Efficient broadcast encryption scheme with log-key storage
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Fingercasting—Joint fingerprinting and decryption of broadcast messages
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Property-Based broadcast encryption for multi-level security policies
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Complete tree subset difference broadcast encryption scheme and its analysis
Designs, Codes and Cryptography
| Hi-index | 0.00 |
We propose a new broadcast encryption scheme based on the idea of ‘one key per each punctured interval'. Let r be the number of revoked users. In our scheme with p-punctured c-intervals, the transmission overhead is roughly $\frac{r}{p+1}$ as r grows. Our scheme is very flexible with two parameters p and c. We may take p as large as possible if a user device allows a large key storage, and set c as small as possible if the storage size and the computing power is limited. As variants of the proposed scheme, we further study a combination of a one-way chain and a hierarchical ring. This combination provides a fine-grained trade-off between user storage and transmission overhead. As one specific instance, the combination includes the subset difference (SD) scheme which is considered the most efficient one in the literature.