Name
Abstract | ||
|---|---|---|
The notion of anonymous signatures has recently been formalized by [18], which captures an interesting property that a digital
signature can sometimes hide the identity of the signer, if the message is hidden from the verifier. However, in many practical
applications, e.g., an anonymous paper review system mentioned in [18], the message for anonymous authentication is actually
known to the verifier. This implies that the effectiveness of previous anonymous signatures may be unjustified in these applications.
In this paper, we extend the previous models, and develop a related primitive called strong anonymous signatures. For strong
anonymous signatures, the identity of the signer remains secret even if the challenge message is chosen by an adversary. We
then demonstrate some efficient constructions and prove their security in our model.
|
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-642-01440-6_7 | Conference on Information Security and Cryptology |
Keywords | Field | DocType |
anonymous authentication,challenge message,anonymous paper review system,previous model,strong anonymous signature,anonymous signature,strong anonymous signatures,interesting property,previous anonymous signature,efficient construction,digital signature | Internet privacy,Authentication,Computer science,Computer security,Digital signature,Anonymity,Adversary | Conference |
Volume | Issue | ISSN |
92-A | 10 | 0302-9743 |
Citations | PageRank | References |
2 | 0.38 | 17 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rui Zhang | 1 | 260 | 18.05 |
| Hideki Imai | 2 | 615 | 43.56 |