Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
How to construct random functions
Journal of the ACM (JACM)
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the generation of cryptographically strong pseudorandom sequences
ACM Transactions on Computer Systems (TOCS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
On Some Methods for Unconditionally Secure Key Distributionand Broadcast Encryption
Designs, Codes and Cryptography - Special issue: selected areas in cryptography I
A ramp model for distributed key distribution schemes
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Efficient self-healing group key distribution with revocation capability
Proceedings of the 10th ACM conference on Computer and communications security
Design of Self-Healing Key Distribution Schemes
Designs, Codes and Cryptography
Anonymous Membership Broadcast Schemes
Designs, Codes and Cryptography
A DRM security architecture for home networks
Proceedings of the 4th ACM workshop on Digital rights management
Sliding-window self-healing key distribution
Proceedings of the 2003 ACM workshop on Survivable and self-regenerative systems: in association with 10th ACM Conference on Computer and Communications Security
A Novel High-Order Tree for Secure Multicast Key Management
IEEE Transactions on Computers
A Public-Key Traitor Tracing Scheme with Revocation Using Dynamic Shares
Designs, Codes and Cryptography
Key management for high bandwidth secure multicast
Journal of Computer Security
A group key recovery mechanism based on logical key hierarchy
Journal of Computer Security
Remote revocation of smart cards in a private DRM system
ACSW Frontiers '05 Proceedings of the 2005 Australasian workshop on Grid computing and e-research - Volume 44
New broadcast encryption scheme using tree-based circle
Proceedings of the 5th ACM workshop on Digital rights management
Distributed Ring Signatures from General Dual Access Structures
Designs, Codes and Cryptography
IBM Systems Journal
Scalable public-key tracing and revoking
Distributed Computing
Secret sharing schemes with partial broadcast channels
Designs, Codes and Cryptography
The advanced access content system's use of digital watermarking
Proceedings of the 4th ACM international workshop on Contents protection and security
Searchable symmetric encryption: improved definitions and efficient constructions
Proceedings of the 13th ACM conference on Computer and communications security
A fully collusion resistant broadcast, trace, and revoke system
Proceedings of the 13th ACM conference on Computer and communications security
Improved efficiency for revocation schemes via Newton interpolation
ACM Transactions on Information and System Security (TISSEC)
A Mechanism for Communication-Efficient Broadcast Encryption over Wireless Ad Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Ad-Hoc Threshold Broadcast Encryption with Shorter Ciphertexts
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient key management for cryptographically enforced access control
Computer Standards & Interfaces
Bayesian Methods for Practical Traitor Tracing
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Horus: fine-grained encryption-based security for large-scale storage
FAST'13 Proceedings of the 11th USENIX conference on File and Storage Technologies
| Hi-index | 0.00 |
We introduce new theoretical measures for the qualitative and quantitative assessment of encryption schemes designed for broadcast transmissions. The goal is to allow a central broadcast site to broadcast secure transmissions to an arbitrary set of recipients while minimizing key management related transmissions. We present several schemes that allow a center to broadcast a secret to any subset of privileged users out of a universe of size n so that coalitions of k users not in the privileged set cannot learn the secret. The most interesting scheme requires every user to store O(klog klog n) keys and the center to broadcast O(k2 log2 k log n) messages regardless of the size of the privileged set. This scheme is resilient to any coalition of k users. We also present a scheme that is resilient with probability p against a random subset of k users. This scheme requires every user to store O(log k log(l/p)) keys and the center to broadcast O(klog2 fclog(l/p)) messages.