Name
Abstract | ||
|---|---|---|
A server-aided verification signature scheme consists of a standard signature scheme and a server-aided verification protocol. Signatures can be verified by executing the server-aided verification protocol with the server, which is generally untrusted. Therefore, it is suitable for low-power computation devices. In 2011, Wu et al. defined three security notions for server-aided verification signatures, i.e., existential unforgeability, security against collusion attacks and security against strong collusion attacks. In this paper, we propose a new server-aided verification signature, which is provably secure against strong collusion attacks. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/EIDWT.2013.65 | EIDWT |
Keywords | Field | DocType |
security notion,collusion attack,bilinear pairings,server-aided verification signature scheme,server-aided verification,existential unforgeability,strong collusion attack,new server-aided verification signature,low-power computation devices,low-power computation device,provable security,provably secure server-aided verification,standard signature scheme,digital signatures,cryptographic protocols,random oracle,server-aided verification protocol,strong collusion attacks security,server-aided verification signature,provably secure server-aided verification signature | Cryptographic protocol,Cryptography,Computer science,Computer security,Server,Random oracle,Digital signature,Collusion,Provable security,Schnorr signature | Conference |
ISBN | Citations | PageRank |
978-1-4799-2140-9 | 0 | 0.34 |
References | Authors | |
0 | 1 | |