Volume 56
–
No.5, October 2012
29
5. CONCLUSION
This paper presents a review of privacy-preserving techniques for wireless sensor networks WSN against a local
eavesdropper. Two main categories of privacy preserving techniques have been presented; data oriented and context-
oriented respectively. The existing techniques have been compared in terms of context privacy preservation with
respect to efficiency, overhead, delay, power consumption adversary, location, scalability against a local eavesdropper.
In future these techniques can be modified and can be used to protect against a global eavesdropper who has a global view
of the traffic at a time.
6. ACKNOWLEDGEMENT
Our thanks to the experts who have contributed towards the development of this paper.
7. REFERENCES
[1] K. Sohraby, D. Minoli and T. Znati. , “Wireless Sensor
Network: Technology, Protocols and Applications: ” John
Wiley Sons, 2007,pg10-11. [2] C. Ozturk, Y. Zhang, and W. Trappe.
“Source-location privacy in energy constrained sensor network routing
”: In Proceedings of the 2nd ACM workshop on Security of
Adhoc and Sensor Networks, 2004 [3]
R. Agrawal, A. Evfimievski, R. Srikant,, “Information sharing across private databases in:” : Proceedings of the
2003 ACM SIGMOD International Conference on Management of Data, 2003, pp. 86
–97. [4]
L. Sweeney, “ K-anonymity: a model for protecting privacy, International Journal on Uncertainty, Fuzziness
and Knowledge based Systems ” 2 2 2002 557–570.
pp. 86 – 97.
[5] Na Li, Nan Zhang, Sajal K. Das, and Bhavani Thuraisingham,” Privacy preservation in wireless sensor
networks: A state-of-the-art survey ”. Ad Hoc Networks 7
2009 1501 –1514.
[6] Jean-Franois Raymond. Traffic analysis: Protocols, attacks, design issues and open problems. In Proceedings
of International Workshop on Design Issues in Anonymity and Unobservability, pages 10-29. Springer-
Verlag New York, Inc., 2001. [7] Celal Ozturk, Yanyong Zhang, and Wade Trappe,
“Source location privacy in energy-constrained sensor network routing
”. In SASN 04: Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor
networks, pages 88-93, New York, NY, USA, 2004. ACM.
[8] Y. Xi, L. Schwiebert, W.S. Shi, Preserving source location privacy in monitoring-based wireless sensor
networks, in: Proceedings of the 20th International Parallel and Distributed Processing Symposium IPDPS
2006, April 2006.
[9] K. Mehta, Donggang Liu, and M. Wright. “Location
privacy in
sensor networks
against a
global eavesdropper”. In IEEE International Conference on
Network Protocols, 2007. ICNP 2007, pages 31-323, October 2007
[10] Jing Deng, Richard Han, and Shivakant Mishra. Intrusion tolerance and anti-traffic analysis strategies for wireless
sensor networks. In DSN 04: Proceedings of the 2004 International Conference on Dependable Systems and
Networks, pages 637-646, Washington, DC, USA, 2004.IEEE Computer Society.
[11] Yi Ouyang Zhengyi Le, Guanling Chen, James Ford, and Fillia Makedon.,“Entrapping adversaries for source
protection in sensor networks ”. In WOWMOM 06:
Proceedings of the 2006 International Symposium on World of Wireless, Mobile and Multimedia Networks,
pages 23-34,Washington, DC, USA, 2006. IEEE Computer Society.
[12] Jing Deng, Richard Han, and Shivakant Mishra. ,”
Intrusion tolerance and anti-traffic analysis strategies for wireless sensor networks
” . In DSN 04: Proceedings of the 2004 International Conference on Dependable
Systems and Networks, pages 637-646, Washington, DC, USA, 2004. IEEE Computer Society.
[13] Y. Jian, S. Chen, Z. Zhang, a nd L. Zhang,”Protecting
receiver-location privacy in wireless sensor networks. May 2007, pp. 1955-1963.
[14] D. Liu and P. Ning, “Establishing pair wise keys in distributed sensor networks,” in Proceedings of 10
th
ACM Conference on Computer and Communications Security CCS03, October 2003, pp. 52
–61.
Volume 56
–
No.5, October 2012
30
Efficiency Privacy Preservation Scheme for Distributed Digital Document using Cache-Cache Mechanism
Shiny Malar F.R.
Dept. Of Computer Science Engineering Noorul Islam University, Kumaracoil
Kanyakumari District, India
Jeya Kumar M.K
Dept.Of Computer Application Noorul Islam University, Kumaracoil
Kanyakumari District, India
ABSTRACT
In data mining, Privacy preservation plays a major role to provide an efficient communication for the users. Several
methods have been employed for privacy preservation scheme they are Secured Multiparty Computation SMC, Data
Transformation
Technique DTT
and Cryptographic
Technique. Most of the recent works concentrated on SMC and DTT as the data mining sources are mainly distributed in
nature. However cryptographic techniques need more overhead for preserving privacy in distributed data mining
context. All these existing techniques are worked and concentrated on data sharing and not concerned about the
privacy preservation between the participants on distributed data mining. To address these issues more sensitively, in this
work, present a privacy preservation scheme using cache- cache mechanism for distributed digital document which
includes text, images, etc.,. In the proposed effective privacy preservation scheme for distributed digital document using
cache-cache mechanism [PPS-CCM], digital document sharing is done with cache-cache mechanism to reduce the
overhead on increasing document sizes. The cache-cache mechanism maintains a cache inside a cache to preserve the
details about the users who shared the secret parts of digital document which has been splitted in a scheme of visual
cryptography. An experimental evaluation is done with sample set of digital documents and will be processed with the
proposed PPS-CCM to estimate the performance of the proposed work in terms of privacy overhead, intensity of
cache-cache for digital document sharing, Participant density with an existing texture overlapping and Fourier filtering
schemes for color images in visual cryptography.
Keywords
Privacy preservation, Cache-cache mechanism, Digital document DD, Visual cryptography, distributed data, Secure
Multi party computation, Color images.
1. INTRODUCTION
Kategori