Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Towards Fair Leader Election in Wireless Networks
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Repelling Sybil-type attacks in wireless ad hoc systems
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Electronic voting: starting over?
ISC'05 Proceedings of the 8th international conference on Information Security
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We present two protocols for data aggregation in networks consisting of many subsystems run by different and potentially adversarial parties. In such a case the messages from the nodes of a subnetwork are aggregated and transmitted to the sink over intermediate nodes which are not controlled by the subnetwork, and which potentially are influenced by an adversary. The adversary aims at changing the result of computations and/or learning the data processed by the stations of the subnetwork. We develop and formally analyze two protocols that enable to detect adversarial manipulations without sacrificing efficiency of the data aggregation. Our scheme is not protected from adversary attaining to destroy communication. However, any manipulation is detected w.h.p. One of the protocols supports multi-route processing without double counting effects, tolerates failures of intermediate nodes and lack of synchronization. The second one is very efficient in terms of communication volume and computational complexity. Both protocols provide very high level of data confidentiality and protection against different kinds of threats.