Sciweavers

121 search results - page 3 / 25
» A Ring Signature Scheme Using Bilinear Pairings
Sort
View
INDOCRYPT
2004
Springer
13 years 11 months ago
New ID-Based Threshold Signature Scheme from Bilinear Pairings
ID-based public key systems allow the user to use his/her identity as the public key, which can simplify key management procedure compared with CA-based public key systems. However...
Xiaofeng Chen, Fangguo Zhang, Divyan M. Konidala, ...
IJNSEC
2011
108views more  IJNSEC 2011»
13 years 1 months ago
Cryptanalysis and Fixed of Short Signature Scheme without Random Oracle from Bilinear Parings
We first analyze the security of a short signature scheme without random oracles called ZCSM scheme and point out that it cannot support unforgeable under the chosen message and ...
Mingwu Zhang, Bo Yang, Yusheng Zhong, Pengcheng Li...
ACISP
2005
Springer
13 years 12 months 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 ...
IJNSEC
2006
85views more  IJNSEC 2006»
13 years 6 months ago
Security Analysis of Some Batch Verifying Signatures from Pairings
Batch verification can provide large computational savings when multiple signatures are verified together. Recently, some batch verifying signature schemes have been proposed from...
Tianjie Cao, Dongdai Lin, Rui Xue
AMC
2005
158views more  AMC 2005»
13 years 6 months ago
Attack on Han et al.'s ID-based confirmer (undeniable) signature at ACM-EC'03
At the fourth ACM conference on electronic commerce (EC'03), S. Han, K.Y. Yeung and J. Wang proposed an ID-based confirmer signature scheme using pairings (actually, this is a...
Fangguo Zhang, Reihaneh Safavi-Naini, Willy Susilo