Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families
Aggregate signatures are used to create one short proof of authenticity and integrity from a set of digital signatures. However, one invalid signature in the set invalidates the entire aggregate, giving no information on which signatures are valid. Hartung et al. (PKC 2016) proposed a fault-tolerant aggregate signature scheme based on combinatorial group testing. Given a bound d on the number of invalid signatures, the scheme can determine which signatures are invalid, and guarantees a moderate increase on the size of the aggregate signature when there is an upper bound on the number n of signatures to be aggregated. However, for the case of unbounded n the constructions provided had constant compression ratio, i.e. the signature size grew linearly with n. In this paper we propose a solution to the unbounded scheme with increasing compression ratio for every d. In particular, for \(d=1\) the compression ratio is the best possible and meets the information theoretical bound.
KeywordsAggregate signature Fault-tolerance Cover-free family Digital signature Combinatorial group testing
Thais Bardini Idalino acknowledges funding granted from CNPq-Brazil [233697/2014-4]. Lucia Moura was supported by an NSERC discovery grant.
- 1.Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: EUROCRYPT 2003, pp. 416–432 (2003)Google Scholar
- 3.Idalino, T.B.: Using combinatorial group testing to solve integrity issues. Master’s thesis, Universidade Federal de Santa Catarina, Brazil (2015)Google Scholar
- 7.Ma, D.: Practical forward secure sequential aggregate signatures. In: ASIACCS 2008, pp. 341–352. ACM (2008)Google Scholar
- 12.Wasef, A., Shen, X.: ASIC: aggregate signatures and certificates verification scheme for vehicular networks. In: GLOBECOM 2009, pp. 1–6 (2009)Google Scholar
- 13.Zaverucha, G.M., Stinson, D.R.: Group testing and batch verification. In: ICITS 2009, pp. 140–157 (2009)Google Scholar