Sciweavers

PKC
2012
Springer
212views Cryptology» more  PKC 2012»
11 years 9 months ago
Security of Blind Signatures Revisited
We revisit the deļ¬nition of unforgeability of blind signatures as proposed by Pointcheval and Stern (Journal of Cryptology 2000). Surprisingly, we show that this established deļ¬...
Dominique Schröder, Dominique Unruh
IJNSEC
2011
143views more  IJNSEC 2011»
13 years 2 months ago
Probable Security Proof of A Blind Signature Scheme over Braid Groups
In this paper, we reinvestigate the security analysis of blind signature scheme over braid groups proposed by Verma in 2008. A blind signature scheme is a cryptographic primitive ...
Girraj Kumar Verma
IJNSEC
2008
154views more  IJNSEC 2008»
13 years 7 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
IJNSEC
2008
106views more  IJNSEC 2008»
13 years 7 months ago
Comments on the Security Flaw of Hwang et al.'s Blind Signature Scheme
In 2003, Hwang et al. proposed a new blind signature based on the RSA cryptosystem by employing Extended Euclidean algorithm. They claimed that the proposed scheme was untraceable...
Fang-Ping Chiang, Yi-Mien Lin, Ya-Fen Chang
PKC
2000
Springer
132views Cryptology» more  PKC 2000»
13 years 11 months ago
The Composite Discrete Logarithm and Secure Authentication
For the two last decades, electronic authentication has been an important topic. The first applications were digital signatures to mimic handwritten signatures for digital document...
David Pointcheval
PET
2010
Springer
13 years 11 months ago
Making a Nymbler Nymble Using VERBS
In this work, we propose a new platform to enable service providers, such as web site operators, on the Internet to block past abusive users of anonymizing networks (for example, T...
Ryan Henry, Kevin Henry, Ian Goldberg
ICICS
2003
Springer
14 years 19 days ago
ID-Based Distributed "Magic Ink" Signature from Pairings
The advantage of ID-based system is the simpliļ¬cation of key distribution and certiļ¬cation management; a user can directly use his identity as his public key instead of an arbi...
Yan Xie, Fangguo Zhang, Xiaofeng Chen, Kwangjo Kim
ACISP
2005
Springer
14 years 1 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 ...
WISTP
2007
Springer
14 years 1 months ago
Linkability of Some Blind Signature Schemes
Unforgeability and blindness are two important properties of blind signature. The latter means that after interacting with various users, the signer is unable to link a valid messa...
Swee-Huay Heng, Wun-She Yap, Khoongming Khoo
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
14 years 1 months ago
Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
Abstract. We show a new protocol for blind signatures in which security is preserved even under arbitrarily-many concurrent executions. The protocol can be based on standard crypto...
Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda...