会议专题

Attacks on a Universal Designated Verifier Signature Scheme

In literature 3, two new universal designated verifier signature proof schemes (UDVSP) based on hardness assumption of the discrete-logarithm problem were proposed at Asiacrypt 05. The UDVSP scheme were proven secure against impersonation attacks in random oracle under Type-1 attack and Type-2 attack. Unfortunately, these schemes are totally breakable by any attacker if the attacker is allowed to interact concurrently with many different prover “instances as well as with the verifier (concurrent reset attacks for short). In this paper, the UDVSP schemes are shown insecure against impersonation under Type-1 attack and are also proven transferable, which contradicts the design goal of universal designated verifier signature scheme.

universal designated verifier signature proof (UDVSP) impersonation bilinear pairing

Li Yanping Pang Liaojun Wang Yumin

College of Mathematics and Information Science Shaanxi Normal University,Xian,China,710062 Key Laboratory of Integrated Service Network Xidian University Key Laboratory of Integrated Service Network Xidian University Xian,China,710062

国际会议

The Fifth International Conference on Information Assurance and Security(第五届信息保障与安全国际会议)

西安

英文

27-30

2009-08-18(万方平台首次上网日期,不代表论文的发表时间)