Efficient Anonymous Identity-Based Broadcast Encryption without Random Oracles

2014 ◽  
Vol 6 (2) ◽  
pp. 40-51 ◽  
Author(s):  
Xie Li ◽  
Ren Yanli

Broadcast encryption provides a method of secure multi-receiver communications, where a broadcaster can encrypt a message for a set S of users who are listening to a broadcast channel. Most identity-based broadcast encryption (IBBE) schemes are not anonymous, which means the attacker can obtain the identities of all receivers from the ciphertext. In this paper, the authors propose an efficient anonymous IBBE scheme in bilinear groups of prime order, where any attacker cannot get the identities of the receivers from the ciphertext. The scheme has constant size ciphertext and achieves adaptive security based on the asymmetric decisional bilinear Diffie-Hellman Exponent (DBDHE) assumption without random oracles. The proposed scheme improves efficiency and security of anonymous IBBE schemes simultaneously.

2010 ◽  
Vol 143-144 ◽  
pp. 347-352
Author(s):  
Le You Zhang ◽  
Yu Pu Hu ◽  
Qing Wu

A mobile ad hoc network has the computational and energy constraints, the general threshold cryptography does not suit it. In this paper, we consider a new kind of proper public encryption to the ad hoc networks: threshold broadcast encryption. A new construction of identity-based threshold broadcast encryption is proposed. In the proposed scheme, any user can dynamically join the system as a possible recipient, and the sender can dynamically choose the set of recipients and the threshold value t. Our new scheme achieves constant size private keys and O(n-t)-size ciphertexts. This is the first scheme which achieves short ciphertexts and full security in the standard model. Finally, we also show that it is provable security under n+1-Weak Decision Bilinear Diffie-Hellman Exponent (n+1-wDBDHE) assumption.


2020 ◽  
Vol 809 ◽  
pp. 73-87 ◽  
Author(s):  
Zhen Zhao ◽  
Fuchun Guo ◽  
Jianchang Lai ◽  
Willy Susilo ◽  
Baocang Wang ◽  
...  

2018 ◽  
Vol 62 (8) ◽  
pp. 1087-1091
Author(s):  
Xi-Jun Lin ◽  
Lin Sun ◽  
Haipeng Qu ◽  
He-Qun Xian

AbstractRecently, Zhang et al. proposed a new anonymous hierarchical identity-based encryption (anonymous HIBE) over prime order groups to achieve both constant size private key and constant size ciphertext. Moreover, a double exponent technique was used to provide anonymity. They proved that their scheme is secure and anonymous against chosen plaintext attacks in the standard model. In this paper, we point out that their scheme is insecure.


2011 ◽  
Vol 474-476 ◽  
pp. 1356-1361
Author(s):  
Qing Wu ◽  
Su Xia Sun

In this paper, a new construct of hierarchical identity-based signature(HIBS) scheme is proposed at first. It has many advantages over those available, such as fully secure without using random oracles, efficient signing algorithm. Additionally, it is provably secure under the computational Diffie-Hellman(CDH) assumption. This assumption is more natural than many of the hardness assumptions recently introduced to HIBS in the standard model. However, the length of its private key and signature increases as the hierarchy depth expands. Then a modified scheme is presented. The signature of modified scheme consists of three group elements and the private keys size shrinks as the identity depth increases. Under the h-CDH assumption, it is provable security in full security model without using random oracles.


2011 ◽  
Vol 111 (10) ◽  
pp. 461-464 ◽  
Author(s):  
Xu An Wang ◽  
Jian Weng ◽  
Xiaoyuan Yang ◽  
Yanjiang Yang

Sign in / Sign up

Export Citation Format

Share Document