Publication IEICE TRANSACTIONS on Information and SystemsVol.E99-DNo.12pp.3181-3184 Publication Date: 2016/12/01 Publicized: 2016/09/01 Online ISSN: 1745-1361 DOI: 10.1587/transinf.2016EDL8136 Type of Manuscript: LETTER Category: Information Network Keyword: identity-based signature, computational complexity, paring based cryptography,
Full Text: PDF(248.4KB)>>
Summary: The key escrow problem and high computational cost are the two major problems that hinder the wider adoption of hierarchical identity-based signature (HIBS) scheme. HIBS schemes with either escrow-free (EF) or online/offline (OO) model have been proved secure in our previous work. However, there is no much EF or OO scheme that has been evaluated experimentally. In this letter, several EF/OO HIBS schemes are considered. We study the algorithmic complexity of the schemes both theoretically and experimentally. Scheme performance and practicability of EF and OO models are discussed.
