Sciweavers

91 search results - page 6 / 19
» Lattice-Based Blind Signatures
Sort
View
EUROCRYPT
2010
Springer
13 years 10 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
TIT
1998
121views more  TIT 1998»
13 years 10 months ago
Blind Multiuser Detection: A Subspace Approach
—A new multiuser detection scheme based on signal subspace estimation is proposed. It is shown that under this scheme, both the decorrelating detector and the linear minimummean-...
Xiaodong Wang, H. Vincent Poor
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
14 years 4 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...
JOC
2000
181views more  JOC 2000»
13 years 10 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
FC
2006
Springer
139views Cryptology» more  FC 2006»
14 years 2 months ago
Defeating Malicious Servers in a Blind Signatures Based Voting System
In this paper, we present two failures in the blind signatures based voting system Votopia [2] which has been tested during the last World Soccer Cup. We then propose a fix which r...
Sébastien Canard, Matthieu Gaud, Jacques Tr...