On concealed data aggregation for WSNs

2007 4th Annual IEEE Consumer Communications and Networking Conference, CCNC 2007

Volumn , Issue , 2007, Pages 192-196

  Peter, Steffen ^a   Piotrowski, Krzysztof ^a   Langendoerfer, Peter ^a  

^a IHP   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DATA REDUCTION; PROBLEM SOLVING;

CONCEALED DATA AGGREGATION (CDA); HOMOMORPHIC MESSAGE AUTHENTICATION CODE; POTENTIAL ATTACK SCENARIOS;

WIRELESS SENSOR NETWORKS;

EID: 36348942851     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCNC.2007.45     Document Type: Conference Paper

References (13)

1. Jim Adler et.al. Computational details of the votehere homomorphic election, 2000. http://www.votehere.net.
2. Claude Castelluccia, Einar Mykletun, and Gene Tsudik. Effcient aggregation of encrypted data in wireless sensor networks. In MobiQuitous, pages 109-117. IEEE Computer Society, 2005.
3. Josep Domingo-Ferrer. A provably secure additive and multiplicative privacy homomorphism. In ISC '02: Proceedings of the 5th International Conference on Information Security, 2002.
4. Joao Girao, Dirk Westhoff, and Markus Schneider. Cda: Concealed data aggregation for reverse multicast traffic in wireless sensor networks. In IEEE International Conference on Communications, 2005.
5. Chris Karlof, Naveen Sastry, and David Wagner. Tinysec: A link layer security architecture for wireless sensor networks. In Second ACM Conference on Embedded Networked Sensor Systems (SenSys), 2004.
6. Einar Mykletun, Joao Girao, and Dirk Westhoff. Public key based cryptoschemes for data concealment in wireless sensor networks. In IEEE International Conference on Communications. ICC2006, 2006.
7. David Naccache and Jacques Stern. A new public key cryptosystem based on higher residues. In ACM Conference on Computer and Communications Security, pages 59-66, 1998.
8. T. Okamoto and S. Uchiyama. A new public-key cryptosystem as secure as factoring. Lecture Notes in Computer Science, 1403:308-, 1998.
9. Pascal Paillier. Public-key cryptosystems based on composite degree residuosity classes. Lecture Notes in Computer Science, 1592, 1999.
10. Pascal Paillier. Trapdooring discrete logarithms on elliptic curves over rings. Lecture Notes in Computer Science, 1976:573-7?, 2000.
11. Krzysztof Piotrowski, Peter Langendoerfer, and Steffen Peter. How public key cryptography influences wireless sensor node lifetime. In Proceedings of the 4rd ACM Workshop on Security of ad hoc and Sensor-Networks, SASN 2006, 2006.
12. Ronald L. Rivest, Leonard Adleman, and Michael L. Dertouzos. On data banks and privacy homomorphisms. In R. DeMillo, D. Dobkin, A. Jones, and R. Lipton, editors, Foundations of Secure Computation, pages 169-180. Academic Press, 1978.
13. David Wagner. Cryptanalysis of an algebraic privacy homomorphism. In Information Security, 6th International Conference, ISC 2003, Bristol, UK, Proceedings, pages 234-239, 2003.