EFFICIENT CERTIFICATELESS THRESHOLD SIGNATURES WITHOUTRANDOM ORACLES

Piyi YANG;Zhenfu CAO;Xiaolei DONG

Journal of Systems Science & Complexity ›› 2010, Vol. 23 ›› Issue (6) : 1167-1182.

PDF(354 KB)
中国科学院数学与系统科学研究院期刊网
JSSC
PDF(354 KB)
Journal of Systems Science & Complexity ›› 2010, Vol. 23 ›› Issue (6) : 1167-1182. DOI: 10.1007/s11424-010-7274-y
article

EFFICIENT CERTIFICATELESS THRESHOLD SIGNATURES WITHOUTRANDOM ORACLES

  • Piyi YANG, Zhenfu CAO, Xiaolei DONG
Author information +
History +

Abstract

This paper defines the security notion for Certificateless
Threshold Signatures (CLTHS). Different from the adversarial model
defined by Wang, et al.\,(2007), our definition considers Type I and
Type II adversary separately. At the same time, the authors develop
the simulatability and relationship between certificateless
threshold signature and the underlying certificateless signature. We
also propose the first CLTHS scheme which is proved existentially
unforgeable against adaptively chosen message attack without random
oracles. Compared with the previous scheme by Wang, et al.\,(2007),
our scheme does not use hash function and is more efficient.

Key words

Certificateless / digital signature / key escrow / provable security / threshold / robustness / simulatabiltiy.

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
Piyi YANG , Zhenfu CAO , Xiaolei DONG. EFFICIENT CERTIFICATELESS THRESHOLD SIGNATURES WITHOUTRANDOM ORACLES. Journal of Systems Science and Complexity, 2010, 23(6): 1167-1182 https://doi.org/10.1007/s11424-010-7274-y
PDF(354 KB)

200

Accesses

0

Citation

Detail
Sections
Recommended

/

〈 〉