针对分级身份密码(HIBC)批验签过程中的错误签名快速识别问题,设计实现了一种错误签名混合筛选算法。针对HIBC签名算法不完全聚合的特点,首先将所有签名作为树叶构造平衡二叉树,然后通过拆分攻克与指数测试方法查找错误签名,并且利用计算中间值的关联性减少计算开销。算法性能分析表明,当批验签中错误签名数大于2时,该算法计算开销低于独立测试、通用折半拆分、指数测试以及裁剪搜索算法,能够有效筛选出HIBC批验签中的错误签名,可以应用在云计算认证等应用场景中。
Focusing on the issue of identifying error signatures in Hierarchical Identity Based Cryptography (HIBC) batch verification, a hybrid algorithm of identifying the error signatures was proposed. Firstly, a balanced binary tree was built which used all signatures as the leaves. Secondly, divide-and-conquer and exponent testing methods were used to find error signatures. Meanwhile, the relevance of temporary computing values was used to reduce computing cost. The performance analyses show that the proposed algorithm costs less computation than the individual, the generalized binary splitting, the exponential and the triple pruning search algorithms when there are more than two error signatures. The proposed algorithm can effectively identify error signatures in HIBC batch verification and can be applied in cloud computing authentication.