Sciweavers

4 search results - page 1 / 1
» On the Impossibility of Three-Move Blind Signature Schemes
Sort
View
EUROCRYPT
2010
Springer
13 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
2001
Springer
13 years 8 months ago
A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
Abstract. Known practical blind signature schemes whose security against adaptive and parallel attacks can be proven in the random oracle model either need five data exchanges bet...
Masayuki Abe
ASIACRYPT
2009
Springer
13 years 11 months ago
A Framework for Universally Composable Non-committing Blind Signatures
A universally composable (UC) blind signature functionality requres users to commit to the message to be blindly signed. It is thereby impossible to realize in the plain model. Th...
Masayuki Abe, Miyako Ohkubo
DSN
2007
IEEE
13 years 8 months ago
Augmenting Branch Predictor to Secure Program Execution
Although there are various ways to exploit software vulnerabilities for malicious attacks, the attacks always result in unexpected behavior in program execution, deviating from wh...
Yixin Shi, Gyungho Lee