Sciweavers

199 search results - page 3 / 40
» The Digital Signature Scheme MQQ-SIG
Sort
View
IACR
2011
146views more  IACR 2011»
12 years 7 months ago
Identity-based Digital Signature Scheme Without Bilinear Pairings
: Many identity-based digital signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher th...
Debiao He, Jianhua Chen, Jin Hu
ACNS
2008
Springer
132views Cryptology» more  ACNS 2008»
14 years 1 months ago
Generic Security-Amplifying Methods of Ordinary Digital Signatures
We describe two new paradigms on how to obtain ordinary signatures that are secure against existential forgery under adaptively chosen message attacks (fully-secure, in short), fro...
Jin Li, Kwangjo Kim, Fangguo Zhang, Duncan S. Wong
INFORMATICALT
2000
123views more  INFORMATICALT 2000»
13 years 7 months ago
Cryptanalysis of the Batch Verifying Multiple RSA Digital Signatures
Recently, Harn proposed an efficient scheme that can batch verification multiple RSA digital signatures. His scheme can reduce signature verification time. However, there is a weak...
Min-Shiang Hwang, Iuon-Chang Lin, Kuo-Feng Hwang
FC
1998
Springer
134views Cryptology» more  FC 1998»
13 years 11 months ago
Group Blind Digital Signatures: A Scalable Solution to Electronic Cash
In this paper we construct a practical group blind signature scheme. Our scheme combines the already existing notions of blind signatures and group signatures. It is an extension o...
Anna Lysyanskaya, Zulfikar Ramzan
ACISP
2005
Springer
14 years 28 days ago
Two Improved Partially Blind Signature Schemes from Bilinear Pairings
A blind signature scheme is a protocol for obtaining a digital signature from a signer, but the signer can neither learn the messages he/she sign nor the signatures the recipients ...
Sherman S. M. Chow, Lucas Chi Kwong Hui, Siu-Ming ...