A security framework for privacy-preserving data aggregationin wireless sensor networks

ACM Transactions on Sensor Networks

Volumn 7, Issue 4, 2011, Pages

  Chan, Aldar C F ^a   Castelluccia, Claude ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b INRIA   (France)

Author keywords

Adaptive chosen ciphertext attacks; Concealed data aggregation; Cryptography; Privacy preserving data aggregation; Provable security; Semantic security

Indexed keywords

CHOSEN CIPHERTEXT ATTACK; CONCEALED DATA AGGREGATION; PRIVACY-PRESERVING DATA AGGREGATION; PROVABLE SECURITY; SEMANTIC SECURITY;

PUBLIC KEY CRYPTOGRAPHY; SEMANTICS; WIRELESS SENSOR NETWORKS;

DATA PRIVACY;

EID: 79952493402     PISSN: 15504859     EISSN: 15504867     Source Type: Journal    
DOI: 10.1145/1921621.1921623     Document Type: Article

References (47)

1. ABDELZAHER, T., ANOKWA, Y., BODA, P., BURKE, J., ESTRIN, E., GUIBAS, L., KANSAL, A.,MADDEN, S., AND ANDREICH, J. 2007. Mobiscopes for human space. IEEE Pervas. Comput. 6, 2.
2. ACHARYA, M., GIRAO, J., AND WESTHOFF, D. 2005. Secure comparison of encrypted data in wireless sensor networks. In Proceedings of the WiOpt'05 Conference.
3. ARMKNECHT, F., WESTHOFF, D., GIRAO, J., AND HESSLER, A. 2008. A lifetime-optimized end-to-end encryption scheme for sensor networks allowing in-network processing. Comput. Comm. 31, 4, 734-749. (Pubitemid 351248941)
4. BELLARE, M. 1997. Practice-Oriented provable-security. In Proceedings of the International Workshop on Information Security (ISW'97). Lecture Notes in Computer Science, vol. 1396. Springer.
5. BELLARE, M., CANETTI, R., AND KRAWCZYK, H. 1996. Keying hash functions for message authentication. In Proceedings of the Conference on Advances in Cryptology (CRYPTO'96). Lecture Notes in Computer Science, vol. 1109. Springer, 1-15. (Pubitemid 126106226)
6. BELLARE, M.,DESAI, A., POINTCHEVAL, D., AND ROGAWAY, P. 1998. Relations among notions of security for publickey encryption schemes. In Proceedings of the Conference on Advances in Cryptology (CRYPTO'98). Lecture Notes in Computer Science, vol. 1462. Springer, 26-45. (Pubitemid 128118995)
7. BELLARE, M.,GUERIN, R., AND ROGAWAY, P. 1995. XORMACs: New methods for message authentication using finite pseudorandom functions. In Proceedings of the Conference on Advances in Cryptology (CRYPTO'95). Lecture Notes in Computer Science, vol. 963. Springer, 15-28.
8. BELLARE, M., KILIAN, J., AND ROGAWAY, P. 1994. The security of cipher block chaining. In Proceedings of the Conference on Advances in Cryptology (CRYPTO'94). Lecture Notes in Computer Science, vol. 839. Springer, 341-358.
9. BELLARE, M. AND ROGAWAY, P. 1993. Random oracles are practical: A paradigm for designing efficient protocols. In Proceedings of the ACM Conference on Computer and Communication Security (CCS'93). 62-73.
10. BELLARE, M. AND ROGAWAY, P. 1995. Entity authentication and key distribution. In Proceedings of the Conference on Advances in Cryptology (CRYPTO'93). Lecture Notes in Computer Science, vol. 950. Springer, 92-111.
11. CASTELLUCCIA, C.,CHAN, A. C.-F., MYKLETUN, E., AND TSUDIK, G. 2009. Efficient and provably secure aggregation of encrypted data in wireless sensor networks. ACM Trans. Sensor Netw. 5, 3.
12. CASTELLUCCIA, C.,MYKLETUN, E., AND TSUDIK, G. 2005. Efficient aggregation of encrypted data inwireless sensor networks. In Proceedings of the Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services (MobiQuitous'05). 1-9.
13. CHAN, A. C.-F. AND CASTELLUCCIA, C. 2007. On the privacy of concealed data aggregation. In Proceedings of the European Symposium on Research in Computer Security (ESORICS'07). Lecture Notes in Computer Science, vol. 4734. Springer, 390-405.
14. CHAN, H., PERRIG, A., AND SONG, D. 2006. Secure hierarchical in-network aggregation in sensor networks. In Proceedings of the ACM Conference on Computer and Communication Security (CCS'06).
15. DOLEV, D., DWORK, C., AND NAOR, M. 2000. Nonmalleable cryptography. SIAM J. Comput. 30, 2, 391-437. (Pubitemid 32469583)
16. DOMINGO-FERRER, J. 2002. A provably secure additive and multiplicative privacy homomorphism. In Proceedings of the Information Security Conference (ISC'02). Lecture Notes in Computer Science, vol. 2433. Springer, 471-483.
17. ELGAMAL, T. 1985. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory IT-30, 4, 469-472.
18. ESCHENAUER, L. AND GILGOR, V. D. 2002. A key management scheme for distributed sensor networks. In Proceedings of the ACM Conference on Computer and Communication Security (CCS'02). 41-47.
19. FIAT, A. AND NAOR,M. 1993. Broadcast encryption. In Proceedings of the Conference on Advances in Cryptology (CRYPTO'93). Lecture Notes in Computer Science, vol. 773. Springer, 480-491.
20. GANTI, R., PHAM, N., TSAI, T.-E., AND ABDELZAHER, T. 2008. PoolView: Stream privacy for grassroots participatory sensing. In Proceedings of the 6th ACM Conference on Embedded Networked Sensor Systems (Sensys'08).
21. GIRAO, J., WESTHOFF, D., AND SCHNEIDER, M. 2005. CDA: Concealed data aggregation in wireless sensor networks. In Proceedings of the IEEE International Conference on Communications (ICC'05).
22. GOLDREICH, O. 2001. Foundations of Cryptography: Part 1. Cambridge University Press.
23. GOLDREICH, O.,GOLDWASSER, S., ANDMICALI, S. 1986. How to construct random functions. J. ACM 33, 4, 792-807.
24. GOLDWASSER, S. AND MICALI, S. 1984. Probabilistic encryption. J. Comput. Syst. Sci. 28, 2, 270-299.
25. GOLDWASSER, S.,MICALI, S., AND RIVEST, R. 1988. A secure signature scheme secure against adaptive chosenmessage attacks. SIAM J. Comput. 17, 2, 281-308.
26. HE, W., LIU, X., NGUYEN, H., NAHRSTEDT, K., AND ABDELZAHER, T. 2007. PDA: Privacy-Preserving data aggregation in wireless sensor networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'07).
27. HU, L. AND EVANS, D. 2003. Secure aggregation for wireless networks. In Proceedings of the Workshop on Security and Assurance in Ad hoc Networks.
28. KATZ, J. AND YUNG, M. 2006. Characterization of security notions for probabilistic private-key encryption. J. Cryptol. 19, 1, 67-95. (Pubitemid 43023011)
29. KOLBITZ, N. AND MENEZES, A. 2007. Another look at "provable security". J. Cryptol. 20, 1, 3-37.
30. LEMAY, M.,GROSS, G.,GUNTER, C. A., AND GARG, S. 2007. Unified architecture for large-scale attested metering. In Proceedings of the 40thHawaii International Conference on System Sciences (HICSS'07).
31. LUBY, M. 1996. Pseudorandomness and Cryptographic Applications. Princeton University Press, Princeton, NJ.
32. MADDEN, S. R., FRANKLIN, M. J., HELLERSTEIN, J. M., AND HONG, W. 2002. TAG: A tiny aggregation service for ad-hoc sensor networks. In Proceedings of the ACM USENIX Symposium on Operating Systems Design and Implementation (OSDI'02). 131-146.
33. MANULIS, M. AND SCHWENK, J. 2007. Provably secure framework for information aggregation in sensor networks. In Proceedings of the International Conference on Computational Science and Its Applications (ICCSA'07). Lecture Notes in Computer Science, vol. 4705. Springer, 603-621.
34. MANULIS, M. AND SCHWENK, J. 2009. Security model and framework for information aggregation in sensor networks. ACM Trans. Sensor Netw. 5, 2.
35. MICALI, S., RACKOFF, C., AND SLOAN, B. 1988. The notions of security of probabilistic cryptosystems. SIAM J. Comput. 17, 2, 412-426.
36. NAOR, M. AND YUNG, M. 1990. Public-Key cryptosystems provably secure against chosen-ciphertext attacks. In Proceedings of the ACM Symposium on Theory of Computing (STOC'90). 427-437. (Pubitemid 20729148)
37. PAILLIER, P. 1999. Public-Key cryptosystems based on composite degree residuosity classes. In Proceedings of the Conference on Advances in Cryptology (EUROCRYPT'99). Lecture Notes in Computer Science, vol. 1592. Springer, 223-238.
38. PEDERSEN, T. P. 1991. A threshold cryptosystem without a trusted party. In Proceedings of the Conference on Advances in Cryptology (EUROCRYPT'91). Lecture Notes in Computer Science, vol. 547. Springer, 522-526.
39. PETER, S.,WESTHOFF, D., AND CASTELLUCCIA, C. 2008. A survey on the encryption of convergecast traffic with in-network processing. IEEE Trans. Depend. Secur. Comput. 5, 4.
40. PRZYDATEK, B., SONG, D., AND PERRIG, A. 2003. SIA: Secure information aggregation in sensor networks. In Proceedings of the ACM SIGOPS International Conference on Embedded Networked Sensor Systems (SenSys'03).
41. RIVEST, R., SHAMIR, A., AND ADLEMAN, L. 1978. A method for obtaining digital signatures and public-key cryptosystems. Comm. ACM 21, 2, 120-126. (Pubitemid 8591219)
42. SHAMIR, A. 1979. How to share a secret. Comm. ACM 22, 11, 612-613.
43. SHANNON, C. E. 1949. Communication theory of secrecy systems. Bell Syst. Tech. J. 28, 656-715.
44. SHOUP, V. 2004. Sequences of games: A tool for taming complexity in security proofs. Cryptology ePrint Archive, rep. 2004/332.
45. SHOUP, V. AND GENNARO, R. 2002. Securing threshold cryptosystems against chosen ciphertext attack. J. Cryptol. 15, 2, 75-96.
46. VERNAM, G. S. 1926. Cipher printing telegraph systems for secret wire and radio telegraphic communications. J. Amer. Inst. Electric. Engin. 45, 105-115. See also US patent no. 1,310,719.
47. WESTHOFF, D., GIRAO, J., AND ACHARYA, M. 2006. Concealed data aggregation for reverse multicast traffic in sensor networks: Encryption, key distribution, and routing adaption. IEEE Trans. Mobile Comput. 5, 10, 1417-1431. (Pubitemid 44335247)