783 search results - page 69 / 157 » On security proof of McCullagh |
AFRICACRYPT
2010
Springer
14 years 4 months ago
2010
Springer
A fair blind signature is a blind signature with revocable anonymity and unlinkability, i.e., an authority can link an issuing session to the resulting signature and trace a signat...
CRYPTO
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We show that only languages in BPP have public-coin, blackbox zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. Thi...
TCC
2004
Springer
14 years 3 months ago
2004
Springer
In earlier work, we described a “pathological” example of a signature scheme that is secure in the Random Oracle Model, but for which no secure implementation exists. For that...
CRYPTO
2001
Springer
14 years 2 months ago
2001
Springer
d Abstract) Philip MacKenzie and Michael K. Reiter Bell Labs, Lucent Technologies, Murray Hill, NJ, USA We describe a means of sharing the DSA signature function, so that two parti...
ESORICS
2008
Springer
13 years 11 months ago
2008
Springer
In authorization, there is often a wish to shift the burden of proof to those making requests, since they may have more resources and more specific knowledge to construct the requi...