%0 Journal Article
%T One-More Paillier Inversion and Concurrent Secure Identification<br>多一次Paillier求逆问题与并发安全的鉴别方案
%A SONG Yan
%A <br>宋焰
%J 软件学报
%D 2008
%I 
%X This paper revisits Paillier's trapdoor one-way function,focusing on the computational problem underlying its one-wayness.A new computational problem called the one-more Paillier inversion problem is formulated.It is a natural extension of Paillier inversion problem to the setting where adversaries have access to an inversion oracle and a challenge oracle.The relation between the one-more Paillier inversion problem and the one-more RSA problem introduced by Bellare,et al.It is shown that the one-more Paillier inversion problem is hard if and only if the one-more RSA problem is hard.Based on this,a new identification scheme is proposed.It is shown that the assumed hardness of the one-more Paillier inversion problem leads to a proof that the proposed identification scheme achieves security against concurrent impersonation attack.
%K trapdoor one-way function
%K Pallier inversion
%K RSA problem
%K hardness
%K identification
%K concurrent security<br>陷门单向函数
%K Paillier求逆
%K RSA问题
%K 难解性
%K 鉴别方案
%K 并发安全性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=2FC0EC9DB79DA277B09A47B5935571CD&yid=67289AFF6305E306&vid=2A8D03AD8076A2E3&iid=DF92D298D3FF1E6E&sid=EC1380648154B673&eid=0B2B64BA93B3A889&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=17