Sciweavers

17 search results - page 3 / 4
» Two Improved Partially Blind Signature Schemes from Bilinear...
Sort
View
EUROCRYPT
1995
Springer
15 years 1 months ago
Fair Blind Signatures
Abstract. A blind signature scheme is a protocol for obtaining a signature from a signer such that the signer's view of the protocol cannot be linked to the resulting message-...
Markus Stadler, Jean-Marc Piveteau, Jan Camenisch
DCC
2010
IEEE
14 years 9 months ago
Comparing two pairing-based aggregate signature schemes
In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-secure aggregate signature scheme. Their scheme uses bilinear pairings and their security proof is in the...
Sanjit Chatterjee, Darrel Hankerson, Edward Knapp,...
76
Voted
ASIACRYPT
2010
Springer
14 years 7 months ago
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
sion of an extended abstract published in Proceedings of Asiacrypt 2010, Springer-Verlag, 2010. Available from the IACR Cryptology ePrint Archive as Report 2010/474. Beginning wit...
Sarah Meiklejohn, Hovav Shacham, David Mandell Fre...
PKC
2000
Springer
132views Cryptology» more  PKC 2000»
15 years 1 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
ACNS
2003
Springer
130views Cryptology» more  ACNS 2003»
15 years 2 months ago
Generalized Key-Evolving Signature Schemes or How to Foil an Armed Adversary
Key exposures, known or inconspicuous, are a real security threat. Recovery mechanisms from such exposures are required. For digital signatures such a recovery should ideally —an...
Gene Itkis, Peng Xie