SPINS: security protocols for sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Stochastic Complexity in Statistical Inquiry Theory
Stochastic Complexity in Statistical Inquiry Theory
Executing SQL over encrypted data in the database-service-provider model
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
A Provably Secure Additive and Multiplicative Privacy Homomorphism
ISC '02 Proceedings of the 5th International Conference on Information Security
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Order preserving encryption for numeric data
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
TinySec: a link layer security architecture for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
IEEE Transactions on Mobile Computing
Relaxed authenticity for data aggregation in wireless sensor networks
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Secure encrypted-data aggregation for wireless sensor networks
Wireless Networks
A security framework for privacy-preserving data aggregation in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Low-cost two-hop anchor node-based distributed range-free localization in wireless sensor networks
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part III
An attack on privacy preserving data aggregation protocol for wireless sensor networks
NordSec'11 Proceedings of the 16th Nordic conference on Information Security Technology for Applications
On the privacy of concealed data aggregation
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
| Hi-index | 0.00 |
End-to-end encryption schemes that support operations over ciphertext are of utmost importance for commercial private party Wireless Sensor Network implementations to become meaningful and profitable. For Wireless Sensor Networks, we demonstrated in our previous work that Privacy Homomorphisms, when used for this purpose, offer two striking advantages apart from end-to-end concealment of data and ability to operate on ciphertexts: flexibility by keyless aggregation and conservation and balancing of aggregator backbone energy. We offered proof of concept by applying a certain Privacy Homomorphism for sensor network applications that rely on the addition operation. But a large class of aggregator functions like median computation or finding maximum/minimum rely exclusively on comparison operations. Unfortunately, as shown by Rivest, et. al., any Privacy Homomorphism is insecure even against ciphertext only attacks, if they support comparison operations. In this paper we show that a particular order preserving encryption scheme achieves the above mentioned energy benefits and flexibility when used to support comparison operations over encrypted texts for Wireless Sensor Networks, while also managing to hide the plaintext distribution and being secure against ciphertext only attacks. The scheme is shown to have reasonable memory and computation overhead when applied for Wireless Sensor Networks.