Sciweavers

77 search results - page 4 / 16
» Security of Blind Signatures Revisited
Sort
View
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
13 years 9 months ago
Round-Optimal Composable Blind Signatures in the Common Reference String Model
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
Marc Fischlin
EUROCRYPT
2010
Springer
13 years 6 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
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
14 years 4 days 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...
JOC
2000
181views more  JOC 2000»
13 years 5 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
INDOCRYPT
2004
Springer
13 years 11 months ago
Revisiting Fully Distributed Proxy Signature Schemes
In a proxy signature scheme, a potential signer delegates his capabilities to a proxy signer, who can sign documents on behalf of him. The recipient of the signature verifies both...
Javier Herranz, Germán Sáez