Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
The BiBa one-time signature and broadcast authentication protocol
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Handbook of Applied Cryptography
Handbook of Applied Cryptography
SPINS: security protocols for sensor networks
Wireless Networks
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
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
Efficient Identity Based Signature Schemes Based on Pairings
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Efficient multicast stream authentication using erasure codes
ACM Transactions on Information and System Security (TISSEC)
Analyzing the energy consumption of security protocols
Proceedings of the 2003 international symposium on Low power electronics and design
Efficient Authentication and Signing of Multicast Streams over Lossy Channels
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Energy Analysis of Public-Key Cryptography for Wireless Sensor Networks
PERCOM '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications
State of the Art in Ultra-Low Power Public Key Cryptography for Wireless Sensor Networks
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Securing the deluge Network programming system
Proceedings of the 5th international conference on Information processing in sensor networks
An efficient broadcast authentication scheme in wireless sensor networks
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
An efficient identity-based signature scheme with batch verifications
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Building high accuracy bloom filters using partitioned hashing
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Elliptic curve DSA (ECSDA): an enhanced DSA
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
Mitigating DoS attacks against broadcast authentication in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Hierarchical identity based encryption with constant size ciphertext
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
IEEE Transactions on Wireless Communications - Part 2
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Reliability and security of broadcasting is critical in Wireless Sensor Networks (WSNs). Since reliability and security compete for the same resources, we are interested in jointly solving for error control coding (to achieve reliability) and integrity for a broadcast scenario. We assume Byzantine attacks in which the adversary can compromise nodes and then drop (or modify) the legitimate packets or inject its own packets. For reliable and efficient multihop broadcasting, it is critical to reduce the energy consumption and latency. To prevent the adversary from consuming the scarce network resources by injecting bogus packets, each receiver node should make sure that packets it receives are authentic and it filters out malicious packets immediately. We build our authentication scheme, on top of a reliable and energy efficient broadcasting protocol called Collaborative Rateless Broadcast (CRBcast) to improve efficiency and reliability. On contrary to the previous schemes, our scheme is resilient with respect to Byzantine adversary as well as routing and flooding attacks and protocol exploits. Moreover, we compared our scheme with the previously proposed broadcast authentication schemes and showed that our scheme outperforms them in terms of efficiency and data availability. This is a crucial improvement over the previous schemes that ensure availability by flooding, introducing very large communication overhead and latency.