The general threshold broadcast encryption is not suitable for the networks with the constraints of computation and energy. In this paper, two constructions of the proper threshold broadcast encryption to these networks are proposed. In the proposed schemes, any user can dynamically join the system as a possible recipient, and the sender can dynamically choose the set of recipients S and the th...

We propose a verifiable and anonymous broadcast encryption scheme, where an 'untrusted' gateway can verify incoming communication flows to ensure only the intended anonymous receivers in the target domain can receive them. This scenario is interesting while the privacy of receivers should be considered. The difficulty in this setting is how to achieve both confidentiality of the message and ano...

Identity Based Broadcast Encryption (IBBE) is a cryptographic primitive, which allows a center to transmit encrypted data over a broadcast channel to a large number of users such that only a select subset of privileged users can decrypt it. In this paper, based on bilinear groups, we propose a secure IBBE scheme with a constant-size system parameters, private keys and cipher texts. This constru...

Due to its low communication cost, stateful broadcast encryption is an appealing solution for secure content distribution in mobile ad hoc wireless networks (MANETs). Unfortunately, the inherent limitations of MANETs prevent a standard application of such schemes since they require receivers to be online. In this paper, we present a reliable message delivery mechanism for MANETs that is based o...

Broadcast Encryption (BE) scheme is allows the sender to securely distribute a data to a dynamically changing set of users over a unsecure channel. Attribute based Broadcast Encryption (ABBE) is a excellent approach for broadcasting. Existing BE classical BE approach required an explicitly specified decrypter list. In ABBE differentiate groups of users by their attribute. In ABBE encrypter enfo...

In a threshold broadcast encryption scheme, a sender chooses (ad-hoc) a set of n receivers and a threshold t, and then encrypts a message by using the public keys of all the receivers, in such a way that the original plaintext can be recovered only if at least t receivers cooperate. Previously proposed threshold broadcast encryption schemes have ciphertexts whose length is at least n + O(1). In...

In this paper, we describe a new broadcast encryption scheme for stateless receivers. The main difference between our scheme and the classical ones derived from the complete subtree paradigm is that the group of privileged users is described by attributes. Actually, some real applications have been described where the use of a more adaptable access structure brings more efficiency and ease of d...

With more and more content being produced, distributed, and ultimately rendered and consumed in digital form, devising effective Content Protection mechanisms and building satisfactory Digital Rights Management (DRM) systems have become top priorities for the Publishing and Entertaining Industries. To help tackle this challenge, several cryptographic primitives and constructions have been propo...

Constructing efficient (Hierarchical) identity based signature/signcryption ((H)IBS/IBSC) schemes in the standard model with full security remain as open problems for a long time. Ren et al. constructed efficient (H)IBS/IBSC schemes with full security without random oracle in ISDPE’07 and Chinacrypt’08, . They claimed their schemes can be proved to simultaneously achieve high efficiency, short ...

We propose new constructions for inner product encryption – IPE1 and IPE2, both secure under the eXternal Diffie-Hellman assumption (SXDH) in asymmetric pairing groups. The first scheme has constant-size ciphertexts whereas the second one is weakly attribute hiding. IPE2 is derived from the identity-based encryption scheme of Jutla Roy (Asiacrypt 2013), that was extended from tag-based quasi-ad...