Broadcast encryption based non-interactive key distribution in MANETs

We propose a new efficient identity-based broadcast encryption scheme without random oracles and prove that it achieves selective identity, chosen plaintext security. Our scheme is constructed based on bilinear Diffie-Hellman inversion assumption and it is a good efficient hybrid encryption scheme, which achieves O (1) -size ciphertexts, public parameters and constant size private keys. In our scheme, either ciphertexts or public parameters has no relation with the number of receivers, moreover, both the encryption and decryption only require one pairing computation. Compared with other identity-based broadcast encryption schemes, our scheme has comparable properties, but with a better efficiency.

/pdf/efficient-identity-based-broadcast-encryption-without-random-3x2u1qs9y9.pdf

Efficient Identity-based Broadcast Encryption without Random Oracles

Fully CCA2 secure identity-based broadcast encryption with black-box accountable authority

Accountable authority identity-based broadcast encryption with constant-size private keys and ciphertexts

Mobile Ad hoc Networks (MANETs) are considered as the most promising terminal networks in future wireless communications and characterized by flexibility, fast and easy deployment, which make them an interesting technology for various applications. Group communication is one of the main concerns in MANETs. To provide the secure group communication in wireless networks, a group key is required so that efficient symmetric encryption can be performed. In this paper, we propose a constant round group key agreement scheme to enable secure group communications, which adopts the Identity Based Broadcast Encryption (IBBE) methodology. When a new Ad hoc network is constructed, the suggested scheme requires no message exchange to establish a group key if the receivers' identities are known to the broadcaster, which is an advantage that outperforms most of the existing key agreement schemes. The proposed scheme can build a new group and establish a new group key with ease when member joins or leaves. In addition, our scheme is efficient in computation and only one bilinear pair computation is required for group members to obtain his/her session key. A highlight property of the scheme is that communication cost remains unchanged as group size grows. Furthermore, we show that the new scheme is proved secure without random oracle. Thus, the scheme can not only meet security demands of larger mobile Ad hoc networks but also improve executing performance .

An Efficient Group Key Agreement Scheme for Mobile Ad Hoc Networks

An identity-based broadcast encryption cryptosystem enable senders to efficiently broadcast cipher texts to a large set of receivers, which can use arbitrary strings as public keys. In this kind of cryptosystem, if the Private Key Generator (PKG) is untrusted, you may suddenly learn that a private key corresponding to your Identity is used to decrypt some ciphertexts. What causes it happens? Except a key compromise, perhaps it must be the PKG who is acting dishonestly and trying to make malicious activities by selling your key, which is a key escrow problem. In order to solve it, we introduce the concept of Accountable Authority Identity Based Broadcast Encryption (AA-IBBE) and design a concrete scheme, which is a new approach to mitigate the key escrow problem existing by restricting the ways in which the PKG can misbehave in identity based broadcast encryption schemes. Lastly we also give its correctness proof and security analysis.

Chunhua Zhang

Papers

Identity-based Broadcast Encryption Scheme with Untrusted PKG