Name
Title | ||
|---|---|---|
Another Look at Aggregate Signatures: Their Capability and Security on Network Graphs. |
Abstract | ||
|---|---|---|
Aggregate signatures are digital signatures where n signers sign n individual documents and can aggregate individual signatures into a single short signature. Although aggregate signatures are expected to enhance the security of network applications, the capability and the security of aggregate signatures have not yet been discussed when the signatures are generated by a group of signers whose relationships are expressed as network. In this paper, we take into account the fact that various network applications can be mathematically idealized as network called network graphs, and discuss the properties of aggregate signatures on network graphs. We show that it is difficult to apply aggregate signatures to the network graphs. More precisely, we show that sequential aggregate signatures Eurocrypt 2004 are incompatible with the network graphs and also general aggregate signatures Crypto 2003 are broken by some generic attack. Additionally, we propose two generic approaches to overcoming the problems: restricting the number of signers and utilizing ring homomorphism, and give a security proof of aggregate signatures in each of these approaches. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-31550-8_3 | INTRUST |
Field | DocType | Citations |
Graph theory,Data mining,Graph,Cryptographic protocol,Computer science,Ring homomorphism,Digital signature,Theoretical computer science,Short signature,Provable security | Conference | 0 |
PageRank | References | Authors |
0.34 | 24 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Naoto Yanai | 1 | 31 | 15.31 |
| Masahiro Mambo | 2 | 821 | 70.77 |
| Kazuma Tanaka | 3 | 2 | 0.83 |
| Takashi Nishide | 4 | 357 | 27.86 |
| eiji okamoto | 5 | 1009 | 118.60 |