CAJ | 학술논문

已有的代理重签名方案大多是存在性不可伪造的，攻击者能对已经签名过的消息重新伪造一个有效的签名，但强不可伪造性能阻止攻击者对已经签名过的消息签名对进行重新伪造。为此，利用目标抗碰撞( TCR)杂凑函数，提出一种双向代理重签名方案。基于TCR杂凑函数的抗碰撞性和计算性Diffie-Hellman假设，证明方案在适应性选择消息攻击下是强不可伪造的。分析结果表明，该方案在计算效率上优于现有的强不可伪造代理重签名方案，系统公开参数长度、签名长度和重签名长度更短，且满足更多的安全属性。
이유적대리중첨명방안대다시존재성불가위조적，공격자능대이경첨명과적소식중신위조일개유효적첨명，단강불가위조성능조지공격자대이경첨명과적소식첨명대진행중신위조。위차，이용목표항팽당( TCR)잡주함수，제출일충쌍향대리중첨명방안。기우TCR잡주함수적항팽당성화계산성Diffie-Hellman가설，증명방안재괄응성선택소식공격하시강불가위조적。분석결과표명，해방안재계산효솔상우우현유적강불가위조대리중첨명방안，계통공개삼수장도、첨명장도화중첨명장도경단，차만족경다적안전속성。
Most existing proxy re-signature schemes are existential unforgeability,where an adversary will be able to forge a signature on a new message rather than on a message that has already been signed. However,strong unforgeability can protect the existing message-signature pairs from being forged. By using TCR hash function,a bidirectional proxy re-signature scheme is proposed. Based on collision-resistant Target Collision Resistant ( TCR ) hash function and computational Diffie-Hellman assumption, the proposed scheme is proved to be strongly unforgeable under adaptive chosen message attacks. The results show that the proposed scheme in computational efficiency is superior to the available proxy re-signature schemes with strong unforgeability. Compared with these schemes,the new scheme has short system parameters,short signature,short re-signature and more security properties.