On Broadcast Encryption with Random Key Pre-distribution Schemes

  title={On Broadcast Encryption with Random Key Pre-distribution Schemes},
  author={M. Ramkumar},
Broadcast encryption (BE) deals with the problem of establishing a secret, shared by g = G – rprivileged nodes, among a set G nodes. Specifically, a set of rrevoked nodes are denied access to the secret. Many schemes to address this problem, based on key pre-distribution schemes (KPS), have been proposed in the literature. Most state-of-the-art methods employ tree-based techniques. However, random key pre-distribution schemes (RKPS), which have received a lot of attention in the recent past… Expand
Broadcast Encryption Using Probabilistic Key Distribution and Applications
A family of novel broadcast encryption schemes based on probabilistic key pre-distribution are proposed, that enable multiple sources to broadcast secrets, without the use of asymmetric cryptographicExpand
One-Time Broadcast Encryption Schemes in Distributed Sensor Networks
This paper describes several Broadcast encryption schemes from the point of view of WSNs, and presents in details the schemes called onetime, and shows how these methods can be applied in distributed sensor networks. Expand
Efficient User Removal in Broadcast Channel with Symmetric Encryption
  • J. Byrka
  • Mathematics, Computer Science
  • 2006
A broadcast protocol that enables to remove some re ceivers by updating a key used for encrypting transmission and is a good choice for polynomial based protocols like the one of Watanabe et al using asymmetric cryptography. Expand
A DRM based on renewable broadcast encryption
  • M. Ramkumar, N. Memon
  • Computer Science, Engineering
  • Visual Communications and Image Processing
  • 2005
An architecture for digital rights management based on a renewable, random key pre-distribution (KPD) scheme, HARPS (hashed random preloaded subsets), which provides a comprehensive solution for securing interactions between devices taking part in a DRM system. Expand
Security bootstrap model of key pre-sharing by polynomial group in mobile Ad Hoc Network
The experimental results show that the proposed security bootstrap model of key pre-sharing by a polynomial group based on (t, n) threshold schema of Lagrange Polynomial Group (LPG) and one-way hash function to establish a distributive security infrastructure can ensure the security of MANET environment with better performance. Expand
Distributed Fine-Grained Access Control in Wireless Sensor Networks
It is proved that this scheme can tolerate compromising all but one distribution centers, which independently distribute their contributions to a single user key, making it highly desirable for fine grained access control. Expand
Secure collaborations over message boards
The SCMB protocol can serve as a foundation over which a wide range of collaborative applications can be realised and be used to protect group secrets and reduce susceptibility to denial of service attacks. Expand
The future of security in Wireless Multimedia Sensor Networks
This position paper is meant to serve as a brief survey on how the future of this research area, its main challenges, and its future trends are seen. Expand


On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption
  • D. Stinson
  • Mathematics, Computer Science
  • Des. Codes Cryptogr.
  • 1997
This paper provides an exposition of methods by which a trusted authority can distribute keys and/or broadcast a message over a network, so that each member of a privileged subset of users canExpand
A pairwise key pre-distribution scheme for wireless sensor networks
This paper proposes a new key pre-distribution scheme, which substantially improves the resilience of the network compared to the existing schemes, and exhibits a nice threshold property: when the number of compromised nodes is less than the threshold, the probability that any nodes other than these compromised nodes are affected is close to zero. Expand
The LSD Broadcast Encryption Scheme
The "Layered Subset Difference" (LSD) technique is described, which reduces the number of keys given to each user by almost a square root factor without affecting the other parameters, and makes it possible to address any subset defined by a nested combination of inclusion and exclusion conditions by sending less than 4t short messages, and the scheme remains secure even if all the other users form an adversarial coalition. Expand
An efficient key predistribution scheme for ad hoc network security
Many desired properties of HARPS like scalability, computational and storage efficiency, flexibility in deployment modes, renewability, ease of extension to multicast scenarios, ability to cater for broadcast authentication, broadcast encryption, etc., are investigated to support its candidacy as an enabler for ad hoc network security. Expand
Efficient Methods for Integrating Traceability and Broadcast Encryption
A method forAdding any desired level of broadcasting capability to any traceability scheme and a method for adding any desiredlevel of traceability to any broadcast encryption scheme are presented. Expand
Anonymous trust: digital rights management using broadcast encryption
The use of broadcast encryption is extended to solve problems that have been traditionally addressed by public-key cryptography: the xCP cluster protocol, a proposed digital rights management (DRM) system for the home entertainment network, and a broadcast-encryption-based content distribution system, which can work without requiring any secrets in the DRM client. Expand
An efficient random key pre-distribution scheme
  • M. Ramkumar, N. Memon
  • Computer Science
  • IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.
  • 2004
It is argued that random KPD schemes, in general, perform an "advantageous" trade-off which renders them more suitable for practical large scale deployments of resource constrained nodes. Expand
Revocation and Tracing Schemes for Stateless Receivers
The main improvements of these methods over previously suggested methods are reducing the message length to O(r) regardless of the coalition size while maintaining a single decryption at the user's end and providing a seamless integration between the revocation and tracing so that the tracing mechanisms does not require any change to the revocation algorithm. Expand
Random key predistribution schemes for sensor networks
The random-pairwise keys scheme is presented, which perfectly preserves the secrecy of the rest of the network when any node is captured, and also enables node-to-node authentication and quorum-based revocation. Expand
Establishing pairwise keys for secure communication in ad hoc networks: a probabilistic approach
This paper presents a scalable and distributed protocol that enables two nodes to establish a pairwise shared key on the fly, without requiring the use of any on-line key distribution center. Expand