Sciweavers

11 search results - page 1 / 3
» Provably Secure Blind Threshold Signatures Based on Discrete...
Sort
View
JISE
2002
86views more  JISE 2002»
13 years 4 months ago
Provably Secure Blind Threshold Signatures Based on Discrete Logarithm
Chin-Laung Lei, Wen-Shenq Juang, Pei-Ling Yu
JOC
2000
181views more  JOC 2000»
13 years 4 months ago
Security Arguments for Digital Signatures and Blind Signatures
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
David Pointcheval, Jacques Stern
IJNSEC
2008
154views more  IJNSEC 2008»
13 years 5 months ago
ID-based Weak Blind Signature From Bilinear Pairings
In a blind signature scheme, the user can get a signature sig(m) on message m generated from the signer's blind signature sig(m ) on blinded message m , but the signer can�...
Ze-mao Zhao
ICICS
2001
Springer
13 years 9 months ago
Threshold Undeniable RSA Signature Scheme
Undeniable signature has been extensively researched after Chaum and Antwerpen first proposed the concept of this special digital signature ten years ago. Up to now, however, almo...
Guilin Wang, Sihan Qing, Mingsheng Wang, Zhanfei Z...
ASIACRYPT
2010
Springer
13 years 3 months ago
Lattice-Based Blind Signatures
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
Markus Rückert