Improved Fault-Tolerant Aggregate Signatures. (29th March 2019)

• Record Type: Journal Article
• Authors: Wang, Gaoli; Cao, Zhenfu; Dong, Xiaolei
• Editors: Liu, Joseph
• Is Part Of: Computer journal. Volume 62:Number 4(2019)
• Page Start: 481
• Page End: 489
• Publication Date: 2019-03-29
• Subjects: aggregate signatures -- fault-tolerance -- uniform (k, n)-set -- finite set theory -- security; Computers -- Periodicals; 005.1
• DOI: 10.1093/comjnl/bxy108
• Languages: English
• ISSNs: 0010-4620

Abstract

Abstract: Fault-tolerant aggregate signatures allow the verification algorithm to recognize and verify all the valid individual signatures in an aggregate signature. However, in ordinary aggregate signature schemes, if there is a single faulty individual signature in the valid aggregate, the whole aggregate will be invalid. This will make great difficulties in many applications including secure logging and batch verification in vehicular ad hoc network et al. In this paper, inspired by the finite set theory called uniform ( k, n )-set proposed by Cao, we put forward a novel fault-tolerant aggregate signature scheme. Our new scheme is more efficient compared with previous fault-tolerant aggregate signature scheme based on cover-free family. It is noted that our scheme is quite easy to be implemented in the real scenario.