136 search results - page 10 / 28 » Security Proofs for Identity-Based Identification and Signat... |
IJNSEC
2007
13 years 6 months ago
2007
In 2004, Libert and Quisquater proposed an identity based undeniable signature scheme using pairings over elliptic curves. In this article, we show that the scheme is not secure. ...
AFRICACRYPT
2010
Springer
14 years 1 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...
PKC
2012
Springer
11 years 9 months ago
2012
Springer
We identify a potential weakness in the standard security model for dynamic group signatures which appears to have been overlooked previously. More specifically, we highlight tha...
DCC
2010
IEEE
13 years 6 months ago
2010
IEEE
In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-secure aggregate signature scheme. Their scheme uses bilinear pairings and their security proof is in the...
TCC
2004
Springer
14 years 1 days 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...