Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
SPINS: security protocols for sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
The BiBa one-time signature and broadcast authentication protocol
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Formalizing GDOI group key management requirements in NPATRL
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Foundations of Security for Hash Chains in Ad Hoc Networks
Cluster Computing
Some Observations on the Theory of Cryptographic Hash Functions
Designs, Codes and Cryptography
Hash chains with diminishing ranges for sensors
International Journal of High Performance Computing and Networking
A one-time signature using run-length encoding
Information Processing Letters
Proceedings of the second ACM conference on Wireless network security
PBES: a policy based encryption system with application to data sharing in the power grid
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Almost optimal hash sequence traversal
FC'02 Proceedings of the 6th international conference on Financial cryptography
Application-aware secure multicast for power grid communications
International Journal of Security and Networks
Survey Paper: A survey on the communication architectures in smart grid
Computer Networks: The International Journal of Computer and Telecommunications Networking
Authenticated in-network programming for wireless sensor networks
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
On the security of public key protocols
IEEE Transactions on Information Theory
Authentication of Digital Streams
IEEE Transactions on Information Theory
HORSIC: An efficient one-time signature scheme for wireless sensor networks
Information Processing Letters
| Hi-index | 0.00 |
Multicasting refers to the transmission of a message to multiple receivers at the same time. To enable authentication of sporadic multicast messages, a conventional digital signature scheme is appropriate. To enable authentication of a multicast data stream, however, an authenticated multicast or multicast authentication (MA) scheme is necessary. An MA scheme can be constructed from a conventional digital signature scheme or a multiple-time signature (MTS) scheme. A number of MTS-based MA schemes have been proposed over the years. Here, we formally analyze four MA schemes, namely BiBa, TV-HORS, SCU+ and TSV+. Among these MA schemes, SCU+ is an MA scheme we constructed from an MTS scheme designed for secure code update, and TSV+ is our patched version of TSV, an MA scheme which we show to be vulnerable. Based on our simulation-validated analysis, which complements and at places rectifies or improves existing analyses, we compare the schemes' computational and communication efficiencies relative to their security levels. For numerical comparison of the schemes, we use parameters relevant for a smart (power) grid component called wide-area measurement system. Our comparison shows that TV-HORS, while algorithmically unsophisticated and not the best performer in all categories, is the most balanced performer. SCU+, TSV+ and by implication the schemes from which they are extended do not offer clear advantages over BiBa, the oldest among the schemes.