Sciweavers

139 search results - page 13 / 28
» Identity-based Threshold Signature Secure in the Standard Mo...
Sort
View
ASIACRYPT
2009
Springer
15 years 11 months ago
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
Vadim Lyubashevsky
CCS
2009
ACM
16 years 4 months ago
A generic construction of useful client puzzles
Denial of Service (DoS) attacks are serious threats for network societies. For dealing with DoS attacks, Jakobsson and Juels first proposed the notion of useful client puzzles (UC...
Rui Zhang 0002, Goichiro Hanaoka, Hideki Imai
EUROCRYPT
2010
Springer
15 years 4 months ago
On the Impossibility of Three-Move Blind Signature Schemes
We investigate the possibility to prove security of the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the standard model, i.e., without random oracle...
Marc Fischlin, Dominique Schröder
EUROCRYPT
2004
Springer
15 years 9 months ago
Short Signatures Without Random Oracles
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in g...
Dan Boneh, Xavier Boyen
CISC
2007
Springer
155views Cryptology» more  CISC 2007»
15 years 8 months ago
ECDSA-Verifiable Signcryption Scheme with Signature Verification on the Signcrypted Message
Abstract. In this paper, we propose a signcryption scheme which provides all the following properties at the same time. (1) forward security: the private key of a sender does not h...
Raylin Tso, Takeshi Okamoto, Eiji Okamoto