%0 Journal Article
%T A Threshold Undeniable Signature Scheme Without a Trusted Party<br>不需要可信任方的门限不可否认签名方案
%A WANG Gui-lin
%A QING Si-han
%A <br>王贵林
%A 卿斯汉
%J 软件学报
%D 2002
%I 
%X At Auscrypt'92, Harn and Yang first proposed the conception of (t,n) threshold undeniable signature, in which only subsets with at least t members can represent a group to generate, confirm or disavow a signature. Later, several schemes are proposed, but none of them is secure. So up to now, how to design a secure (t,n) threshold undeniable signature scheme is remained an open problem. In this paper, based on discrete logarithm cryptosystem, a secure and efficient (t,n) threshold undeniable signature scheme without a trusted party is presented. This scheme has an attractive property that member's honesty is verifiable because a publicly verifiable secret sharing scheme is used to distribute secrets and two discrete logarithm equality protocols are used to provide necessary proofs of correctness, which are proposed by Schoenmakers at Crypto'99.
%K digital signature
%K threshold undeniable signature
%K cryptography
%K information security<br>数字签名
%K 门限不可否认签名
%K 密码学
%K 信息安全
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=C688603C3EA643E5&yid=C3ACC247184A22C1&vid=FC0714F8D2EB605D&iid=9CF7A0430CBB2DFD&sid=43E2C08889D1FABC&eid=961EEFF36C7AED30&journal_id=1000-9825&journal_name=软件学报&referenced_num=2&reference_num=19