全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
软件学报  2002 

A Threshold Undeniable Signature Scheme Without a Trusted Party
不需要可信任方的门限不可否认签名方案

Keywords: digital signature,threshold undeniable signature,cryptography,information security
数字签名
,门限不可否认签名,密码学,信息安全

Full-Text   Cite this paper   Add to My Lib

Abstract:

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.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133