Sciweavers

963 search results - page 9 / 193
» Conditional Digital Signatures
Sort
View
CISIM
2007
IEEE
14 years 1 months ago
Universally Composable Key-Evolving Signature
The standard digital signature scheme can be easily subject to key exposure problem In order to overcome this problem; a feasible and effective approach is employed by key-evolving...
Jin Zhou, Yuefei Zhu, TingMao Chang, YaJuan Zhang
CRYPTO
1997
Springer
207views Cryptology» more  CRYPTO 1997»
13 years 11 months ago
Public-Key Cryptosystems from Lattice Reduction Problems
We present a new proposal for a trapdoor one-way function, from which we derive public-key encryption and digital signatures. The security of the new construction is based on the ...
Oded Goldreich, Shafi Goldwasser, Shai Halevi
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 ...
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
ACNS
2004
Springer
133views Cryptology» more  ACNS 2004»
13 years 11 months ago
Limited Verifier Signature from Bilinear Pairings
Motivated by the conflict between authenticity and privacy in the digital signature, the notion of limited verifier signature was introduced [1]. The signature can be verified by a...
Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim