How to construct random functions
Journal of the ACM (JACM)
An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
The security of the cipher block chaining message authentication code
Journal of Computer and System Sciences
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
The Security of Cipher Block Chaining
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
MDx-MAC and Building Fast MACs from Hash Functions
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
TinySec: a link layer security architecture for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Anonymous Secure Routing in Mobile Ad-Hoc Networks
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
A pairwise key predistribution scheme for wireless sensor networks
ACM Transactions on Information and System Security (TISSEC)
AO2P: Ad Hoc On-Demand Position-Based Private Routing Protocol
IEEE Transactions on Mobile Computing
Telos: enabling ultra-low power wireless research
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Share the secret: enabling location privacy in ubiquitous environments
LoCA'05 Proceedings of the First international conference on Location- and Context-Awareness
Computer Networks: The International Journal of Computer and Telecommunications Networking
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Privacy-aware traffic monitoring
IEEE Transactions on Intelligent Transportation Systems
Location privacy and resilience in wireless sensor networks querying
Computer Communications
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
Attack detection vs. privacy --- how to find the link or how to hide it?
SP'11 Proceedings of the 19th international conference on Security Protocols
An efficient anonymous communication protocol for wireless sensor networks
Wireless Communications & Mobile Computing
| Hi-index | 0.00 |
In this paper, we propose two simple and efficient schemes for establishing anonymity in Clustered Wireless Sensor Networks (CWSNs). The first scheme Simple Anonymity Scheme (SAS), uses a range of pseudonyms as identifiers for a node to ensure concealment of its true identifier (ID). After deployment, neighbouring nodes share their individual pseudonyms and use them for anonymous communication. The second scheme Cryptographic Anonymity Scheme (CAS), uses a Keyed Cryptographic one way Hash Function (KCHF) for ID concealment. In CAS, neighbouring nodes securely share the information used by the KCHF to generate pseudonyms. Even when many nodes in a neighbourhood are compromised and are colluding, our schemes guarantee complete anonymity to non-compromised nodes during their mutual communication. Our schemes have reasonably low memory and computation costs. They can be embedded into any wireless sensor network routing protocol to ensure anonymity and privacy during node discovery, routing and data delivery.