论文部分内容阅读
一些特殊的数字签名因其本身具有特殊性,所以在把它们改造成为批量数字签名的时候往往就会出现问题。比如在把环签名改造成批量签名的时候,其原本具有的不可关联性往往就会丢失。基于澳大利亚学者C.J.Pavlovski与C.Boyd所提出的Bi-tree批量签名算法,本文给出了一个批量环签名方案,并对它的不可关联性进行了分析。
Because of their particularity, some special digital signatures often have problems in transforming them into batch digital signatures. For example, when converting a ring signature into a batch signature, the irrelevance that it originally possesses often gets lost. Based on the Bi-tree batch signature algorithm proposed by Australian scholar C.J.Pavlovski and C.Boyd, this paper gives a batch ring signature scheme and analyzes its non-relevancy.