Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
SPINS: security protocols for sensor networks
Wireless Networks
Revocation and Tracing Schemes for Stateless Receivers
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
The LSD Broadcast Encryption Scheme
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Key Establishment in Large Dynamic Groups Using One-Way Function Trees
IEEE Transactions on Software Engineering
An Experimental Analysis of Cryptographic Overhead in Performance-Critical Systems
MASCOTS '99 Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Tamper resistance: a cautionary note
WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
Secure deletion of data from magnetic and solid-state memory
SSYM'96 Proceedings of the 6th conference on USENIX Security Symposium, Focusing on Applications of Cryptography - Volume 6
On optimizing compatible security policies in wireless networks
EURASIP Journal on Wireless Communications and Networking
| Hi-index | 0.00 |
In this paper, we design good security metrology to solve the problem when, in a network, there is a node accusing another one of misbehaving. This problem is not easy because bad nodes tend to use false accusations to disrupt the network and the result is disastrous. We set up a standard, namely the security ratings, and use it to resolve such accusations. We use approaches of negative-credit, and mixed-credit (positive-credit), respectively, to solve this problem. We exclude the use of public key infrastructure and use only symmetric ciphers and hash functions to reduce the computational overhead of the security metrology. Our results prove to be practical and robust against node compromise. The communication and computational overhead also prove to be small and suitable for real world applications.