CAJ | 학술논문

签密是一个新的密码学构件,能够在一个逻辑步骤内同时实现保密性与认证性.分析了李发根所提出的基于身份的(t,n)门限签密方案的安全缺陷以及验证子签名效率上的不足,在此基础上基于签名批验证算法提出了一个新方案,弥补了李方案的安全缺陷.新方案中,职员在验证t个成员子签名通过时,只需2个双线性对运算,且所需的对运算个数的数学期望值为2(tp+1)(其中p表示成员子签名集合中存在非法签名的概率),而不是李方案所需的2t个.
첨밀시일개신적밀마학구건,능구재일개라집보취내동시실현보밀성여인증성.분석료리발근소제출적기우신빈적(t,n)문한첨밀방안적안전결함이급험증자첨명효솔상적불족,재차기출상기우첨명비험증산법제출료일개신방안,미보료리방안적안전결함.신방안중,직원재험증t개성원자첨명통과시,지수2개쌍선성대운산,차소수적대운산개수적수학기망치위2(tp+1)(기중p표시성원자첨명집합중존재비법첨명적개솔),이불시리방안소수적2t개.
Signcryption is a new cryptographic primitive which simultaneously fulfills both confidentiality and authenticity in a logically single step. The security deficiency and the limitation performance on its signatures verification are analyzed, which existed in the ID-based (t, n) threshold signcryption scheme proposed by Fagen Li. Then a new scheme is proposed based on the batch verification of signatures which could remedy the security deficiency of the primary scheme, and when the particular clerk succeeded in verifying party signatures, two bilinear pairs are needed to be computed only. The expectation of the bilinear pair computation is 2 (tp+1) (p is considered as the illegal rate of the party signatures aggregate), but not 2t in the primary scheme.