Refine your search
Collections
Co-Authors
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Parameswari, D.
- k-anonymity Based Privacy Preserving for Data Collection in Wireless Sensor Networks
Abstract Views :476 |
PDF Views:0
Authors
Affiliations
1 Bharath University, Chennai-600073
2 Dept of MCA, Jerusalem College of Engineering, Chennai
3 Dept. of Information Technology, Bharath University, Chennai-600073
1 Bharath University, Chennai-600073
2 Dept of MCA, Jerusalem College of Engineering, Chennai
3 Dept. of Information Technology, Bharath University, Chennai-600073
Source
Indian Journal of Science and Technology, Vol 6, No S5 (2013), Pagination: 4604-4614Abstract
In this paper, k-anonymity notion is adopted to be used in wireless sensor networks (WSN) as a security Framework with two levels of privacy. A base level of privacy is provided for the data shared with semi trusted sink and a deeper level of privacy is provided against eavesdroppers. In the proposed method, some portions of data are encrypted and the rest is generalized. Generalization shortens the size of the data transmitted in the network causing energy saving at the cost of information loss. On the other hand, encryption provides anonymization with no information loss and without saving energy. Thus, there is a tradeoff between information loss and energy saving. In our system, this tradeoff is intelligently managed by a system parameter, which adjusts the amount of data portions to be encrypted. We use a method based on bottom up clustering that chooses the data portions to be encrypted among the ones that cause maximum information loss when generalized. In this way, a high degree of energy saving is realized within the given limits of information loss. Our analysis shows that the proposed method achieves the desired privacy levels with low information loss and with considerable energy saving.Keywords
Anonymity, Wireless Sensor Networks, Data PrivacyFull Text
References
- Pfitzmann A, and Khntopp M (2000). Anonymity, unobservability, and pseudonymity - A proposal for terminology, Designing Privacy Enhancing Technologies, Lecture Notes in Computer Science, vol 2009/2001, 1–9.
- Chaum D (1988). The dining cryptographers problem: Unconditional sender and receipent untraceability, Journal of Cryptology, vol 1(1), 65–75.
- Chaum D (1981). Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the Associations for Computing Machinery, vol 24(2), 84–88.
- Pfitzmann A, Pfitzmann B et al. (1991). ISDN-Mixes: untraceable communication with very small bandwidth overhead, Proceedings of the GI/ITG Conference on Communication in Distributed Systems, 451–463.
- Gulcu C, and Tsudik G (1996). Mixing e-mail with BABEL, Symposium on Network and Distributed Systems Security (NDDS ’96).
- Reiter M K, and Rubin A D (1999). Anonymous web transactions with crowds, Communications of the ACM, vol 42(2), 32–48.
- Reed M G, and Syverson P F (1998). Anonymous connections and onion routing, IEEE Journal on Selected Areas in Communications, vol 16 (4), 482–494.
- Kong J, Hong X et al. (2003). An anonymous on demand routing protocol with untraceable routes for mobile ad hoc networks, Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing, 291–302.
- Samarati P, and Sweeney L (1998). Generalizing data to provide anonymity when disclosing information, Proceedings of the 17th ACM SIGMOD-SIGACT-SIGART Symposium on the Principles of Database Systems.
- Fung B C M, Wang K et al. (2009). Privacy-preserving data publishing: a survey on recent developments, ACM Computing Surveys.
- Meyerson A, and Williams R (2004). On the complexity of optimal k-anonymity, Proceedings of the 23rd ACM SIGMOD-SIGACTSIGART Symposium on the Principles of Database Systems, 223–228.
- Yick J, Mukherjee B et al. (2008). Wireless sensor network survey, Computer Networks, vol 52(12), 2292–2330.
- Carman D W, Kruus P S et al. (2000). Constraints and approaches for distributed sensor network security, NAI Laboratories, Technical Report 00-010.
- Michener C D, and Sokal R R (1957). A quantitative approach to a problem in classification, Evolution, vol 11, No. 2, 130–162.
- Chan H, Perrig A et al. (2003). Random key predistribution schemes for sensor networks, Proceedings of 2003 Symposium on Security and Privacy, 197–213.
- Du W, Deng J et al. (2005). A pairwise key predistribution scheme for wireless sensor networks, ACM Transactions on Information and System Security (TISSEC), vol 8(2), 228–258.
- Heinzelman W, Kulik J et al. (1999). Adaptive protocols for information dissemination in wireless sensor networks, Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom’99).
- Intanagonwiwat C, Govindan R et al. (2000). Directed diffusion: a scalable and robust communication paradigm for sensor networks, Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom’00).
- Fung B C M, Wang K et al. (2005). Top-down specialization for information and privacy preservation, Proceedings of the 21st International Conference on Data Engineering, 205–216.
- Sweeney L (2002). Achieving k-anonymity privacy protection using generalization and suppression, International Journal of Uncertain, Fuzziness Knowledge-Based Systems, vol 10(5), 571–588.
- Culler D, and Estrin M S D (2004). Overview of Sensor Network, Computer, vol 37(8), 41–49.
- Sweeney L (2002). A model for protecting privacy, International Journal on Uncertainty Fuzziness and Knowledge-based System, vol 10(5), 557–570.
- QOS Aware Privacy Preserving Location Monitoring in Wireless Sensor Network
Abstract Views :445 |
PDF Views:0
Authors
Affiliations
1 Dept. of IT, Bharath University, Chennai-600 073
2 Dept. of Computer Applications, Jerusalem College of Engg., Chennai-600 100
3 Department of Information Technology, Bharath University, Chennai-600073
1 Dept. of IT, Bharath University, Chennai-600 073
2 Dept. of Computer Applications, Jerusalem College of Engg., Chennai-600 100
3 Department of Information Technology, Bharath University, Chennai-600073
Source
Indian Journal of Science and Technology, Vol 6, No S5 (2013), Pagination: 4648-4652Abstract
Sensor networks have been widely employed in many real-time applications. One of the most obvious challenges appearing to threaten the successful deployment of sensor networks is privacy issues including source-location privacy which cannot be adequately addressed by general security mechanisms. Focusing on this important kind of privacy, among many approaches proposed in literatures, self-adjusting phantom routing is a very successful one. But it still has some weaknesses. In this paper, we propose an improved version of it to enhance its performance. This method can decrease energy consumption and communication cost while increase the accuracy of the aggregate locations by minimizing their monitored areas.Keywords
Sensor Network, Privacy, Context Privacy, Source-LocationFull Text
References
- Ozturk C, Zhang Y et al. (2004). Source-location privacy in energy-constrained sensor network routing, Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks SASN ‘04, 88–93.
- Kamat P, Zhang Y et al. (2005). Enhancing source-location privacy in sensor network routing, Distributed Computing Systems, ICDCS 2005, Proceeding 25th IEEE International Conference, 599–608.
- Zhang L (2006). A self-adjusting directed random walk approach for enhancing source-location privacy in sensor network routing, Proceedings of the 2006 International Conference on Wireless communications and mobile computing IWCMC ‘06, 33–38.
- Son B, Shin S et al. (2007). Implementation of the realtime people counting system using wireless sensor networks, International Journal of Multimedia and Ubiquitous Engineering (IJMUE), vol 2, No. 3, 63–80.
- Culler D, and Estrin M S D (2004). Overview of sensor networks, IEEE Computer, vol 37, No. 8, 41–49.
- Gedik B, and Liu L (2008). Protecting location privacy with personalized k-anonymity: Architecture and algorithms, IEEE TMC, vol 7, No. 1, 1–18.
- Kalnis P, Ghinita G et al. (2007). Preventing location-based identity inference in anonymous spatial queries, IEEE TKDE, vol 19, No. 12, 1719–1733.
- Samarati P (2001). Protecting respondent’s privacy in microdata release, IEEE Transactions on Knowledge and Data Engineering, vol 13, No. 6, 1010–1027.
- Sweeney L (2002). k-Anonymity: A model for protecting privacy, International Journal of Uncertainty, Fuzziness, and Knowledge-Based Systems, vol 10, No. 5, 557–570.
- Gedik B, and Liu L (2005). A customizable k-anonymity model for protecting location privacy, Proceedings of IEEE International Conference on Distributed Computing Systems (ICDCS ’05), 620–629.
- Meyerson A, and Williams R (2004). On the complexity of optimal k-anonymity, Proceedings of ACM Symposium, Principles of Database Systems (PODS ’04), 223–228.
- Aggarwal G, Feder T et al. (2005). Anonymizing Tables, Proceedings of International Conference on Database Theory (ICDT ’05), 246–258.
- Gedik B, and Liu L (2005). Location privacy in mobile systems: a personalized anonymization model, Proceedings of 25th IEEE International Conference on Distributed Computing Systems (ICDCS ’05), 620–629.
- Hoh B, Gruteser M et al. (2006). Enhancing Security and Privacy in Traffic-Monitoring Systems, IEEE Pervasive Computing, vol 5, No. 4, 38–46.
- Terrovitis M, and Mamoulis N (2008). Privacy preservation in the publication of trajectories, Proceedings of Ninth International Conference on Mobile Data Management (MDM ’08), 65–72.
- Highly Secured Online Voting System over Network
Abstract Views :791 |
PDF Views:0
Authors
Source
Indian Journal of Science and Technology, Vol 6, No S6 (2013), Pagination: 4831-4836Abstract
Internet voting systems have gained popularity and have been used for government elections and referendums in the United Kingdom, Estonia and Switzerland as well as municipal elections in Canada and party primary elections in the United States. Voting system can involve transmission of ballots and votes via private computer networks or the Internet. Electronic voting technology can speed the counting of ballots and can provide improved accessibility for disabled voters. The aim of this paper is to people who have citizenship of India and whose age is above 18 years and of any sex can give their vote through online without going to any physical polling station. Election Commission Officer (Election Commission Officer who will verify whether registered user and candidates are authentic or not) to participate in online voting. This online voting system is highly secured, and its design is very simple, ease of use and also reliable. The proposed software is developed and tested to work on Ethernet and allows online voting. It also creates and manages voting and an election detail as all the users must login by user name and password and click on his favorable candidates to register vote. This will increase the voting percentage in India. By applying high security it will reduce false votes.Keywords
Internet Voting, e-voting, Face Recognition, Image Processing, Secured Network, JDBCFull Text
- Remote Sensing Imaging for Satellite Image Segmentation
Abstract Views :159 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science Engineering, Bharath University, Agharam Road, Selaiyur, Chennai – 600073, Tamil Nadu, IN
1 Department of Computer Science Engineering, Bharath University, Agharam Road, Selaiyur, Chennai – 600073, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 31 (2015), Pagination:Abstract
Satellite image segmentation contains a most significant role to play within the field of remote sensing imaging, for effectively detective work the Surface of the planet. But a lot of satellite image segmentation techniques are out there. This paper work presents a picture segmentation supported color feature with unattended FCM formula, that yields higher results. the complete work is split into 2 stages, 1st one to boost the colour separation of satellite mental imagery victimization color transformation. Another step to method the regions is sorted into a group of FCM clump formula. Finally, the performance of the planned theme is calculated visually and quantitatively. The results show that the planned technique will be used for segmentation and additionally enhances the longer term analysis with the image quality for mental imagery.Full Text