PROVABLY SECURE IDENTITYBASED THRESHOLD SIGNATURE WITHOUT RANDOM ORACLES

Author(s):  
H. Xiong ◽  
F. Li ◽  
Z. Qin
2012 ◽  
Vol 7 (1) ◽  
pp. 708-713
Author(s):  
Haiwei Fan ◽  
Xiangmo Zhao ◽  
Yang Ming

2014 ◽  
Vol 22 (2) ◽  
pp. 366-375
Author(s):  
Naoto Yanai ◽  
Eikoh Chida ◽  
Masahiro Mambo ◽  
Eiji Okamoto

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.


2018 ◽  
Vol 61 (9) ◽  
Author(s):  
Wenjie Yang ◽  
Weiqi Luo ◽  
Xizhao Luo ◽  
Jian Weng ◽  
Anjia Yang

2014 ◽  
Vol 25 (01) ◽  
pp. 1-23 ◽  
Author(s):  
JIA FAN ◽  
YULIANG ZHENG ◽  
XIAOHU TANG

Identity-based signcryption is a primitive that combines the functions of identity-based encryption and identity-based signature. In this paper, we first attack two of the existing identity-based signcryption schemes which are claimed to be provably secure without random oracles. Then we construct a new identity-based signcryption scheme and proves its security without random oracles.


Sign in / Sign up

Export Citation Format

Share Document