CFP last date
20 May 2024
Reseach Article

Efficiency Privacy Preservation Scheme for Distributed Digital Document using Cache-Cache Mechanism

by Shiny Malar F.r, Jeya Kumar M.k
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 56 - Number 5
Year of Publication: 2012
Authors: Shiny Malar F.r, Jeya Kumar M.k
10.5120/8889-2890

Shiny Malar F.r, Jeya Kumar M.k . Efficiency Privacy Preservation Scheme for Distributed Digital Document using Cache-Cache Mechanism. International Journal of Computer Applications. 56, 5 ( October 2012), 28-38. DOI=10.5120/8889-2890

@article{ 10.5120/8889-2890,
author = { Shiny Malar F.r, Jeya Kumar M.k },
title = { Efficiency Privacy Preservation Scheme for Distributed Digital Document using Cache-Cache Mechanism },
journal = { International Journal of Computer Applications },
issue_date = { October 2012 },
volume = { 56 },
number = { 5 },
month = { October },
year = { 2012 },
issn = { 0975-8887 },
pages = { 28-38 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume56/number5/8889-2890/ },
doi = { 10.5120/8889-2890 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:58:21.109829+05:30
%A Shiny Malar F.r
%A Jeya Kumar M.k
%T Efficiency Privacy Preservation Scheme for Distributed Digital Document using Cache-Cache Mechanism
%J International Journal of Computer Applications
%@ 0975-8887
%V 56
%N 5
%P 28-38
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
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.

References
  1. C. Yao. Protocols for secure computations (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science. IEEE, 1982.
  2. D. Chaum. Blind signatures for untraceable payments. In Proceedings of Advances in Cryptology, pages 199-203. Plenum Press, 1982.
  3. Manuel Blum. Coin flipping by telephone a protocol for solving impossible problems. SIGACT News, 15(1):23-27, 1983.
  4. A. Yao. How to generate and exchange secrets. In Proceedings of the twenty-seventh annual IEEE Symposium on Foundations of Computer Science, pages 162-167. IEEE Computer Society, 1986.
  5. O. Goldreich, S. Micali, and A. Wigderson. How to play ANY mental game. In Proceedings of the nineteenth annual ACM conference on Theory of computing, pages 218-229. ACM Press, 1987.
  6. Michael Ben-Or and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the twentieth annual ACM symposium on Theory of computing, pages 1-10. ACM Press, 1988.
  7. David Chaum, Claude Cropeau, and Ivan Damgard. Multiparty unconditionally secure protocols. In Proceedings of the twentieth annual ACM symposium on Theory of computing, pages 11-19. ACM Press, 1988.
  8. Michael Ben-Or, Ran Canetti, and Oded Goldreich. Asynchronous secure computation. In Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pages 52-61. ACM Press, 1993.
  9. Josh Cohen Benaloh and Michael de Mare. One-way accumulators: A decentralized alternative to digital signatures. Lecture Notes in Computer Science, 765:274-286, 1994.
  10. Ran Canetti, Uri Feige, Oded Goldreich, and Moni Naor. Adaptively secure multi-party computation. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pages 639-648. ACM Press, 1996.
  11. R. Agrawal and R. Srikant. Privacy-preserving data mining. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, May 16-18, 2000, Dallas, Texas, USA, pages 439–450. ACM, 2000.
  12. Y. Lindell and B. Pinkas. Privacy preserving data mining. In Advances in Cryptology (CRYPTO'00), volume 1880 of Lecture Notes in Computer Science, pages 36–53. Springer-Verlag, 2000.
  13. InKoo Kang, Member, IEEE, Gonzalo R. Arce, Fellow, IEEE, and Heung-Kyu Lee, Member, IEEE," Color Extended Visual Cryptography Using Error Diffusion," IEEE Transactions on image processing, vol. 20, no. 1, pp. 132-145, January 2011.
  14. D. Jin, W. Q. Yan, and M. S. Kankanhalli, "Progressive color visual cryptography," J. Electron. Imag. , vol. 14, no. 3, p. 033019, 2005.
  15. W. P. Fang and J. C. Lin, "Progressive viewing and sharing of sensitive images," Pattern Recogniti. Image Anal. , vol. 16, no. 4, pp. 632–636, 2006.
  16. A. C. Yao. How to generate and exchange secrets. In Proceedings of the entyseventh annual IEEE Symposium on Foundations of Computer Science, pages 162–167. IEEE Computer Society, 1986.
  17. C. N. Yang and T. S. Chen, "Aspect ratio invariant visual secret sharing schemes with minimum pixel expansion," Pattern Recogniti. Lett. , vol. 26, pp. 193–206, 2005.
  18. Z. Zhou, G. R. Arce, and G. D. Crescenzo, "Halftone visual cryptography,"IEEE Trans. Image Process. , vol. 18, no. 8, pp. 2441–2453, Aug. 2006.
  19. D. S. Tsai, T. H. Chen, G. Horng, "A Cheating Prevention Scheme for Binary Visual Cryptography with Homogeneous Secret Images," Pattern Recognition, Vol. 40, No. 8, pp. 2356-2366, 2007.
  20. Zhongmin Wang, Gonzalo R. Arce,, and Giovanni Di Crescenzo ,"Halftone Visual Cryptography Via Error Diffusion",IEEE Transactions on information forensics and security, Vol. 4, No. 3, 383-395, September 2009.
  21. Zhen He ,"Hierarchical Error Diffusion", IEEE Transactions on image processing, Vol. 18, No. 7, pp. 1524-1534, July 2009
  22. Dash,A. Demsky,B. , "Integrating Caching and Prefetching Mechanisms in a DistributedTransactionalMemory", IEEE Transactions on Parallel and Distributed Systems, Volume: 22 , Issue: 8 , 2011
  23. Kharbutli,M. , Yan Solihin et. Al. , "Counter-Based Cache Replacement and Bypassing Algorithms", IEEE Transactions on Computers, Volume: 57 , Issue: 4 , April 2008
  24. C. Blundo, P. D. Arco, A. De Santis, and D. R. Stinson, "Contrast Optimal Threshold Visual Cryptography Schemes" , SIAM J. on Discrete Math. 16, pp. 224-261, 2003.
  25. Wang,C. Xiao, L. et. Al. , "DiCAS: An Efficient Distributed Caching Mechanism for P2P Systems", IEEE Transactions on Parallel and Distributed Systems, Volume: 17 , Issue: 10 , oct. , 2006
Index Terms

Computer Science
Information Sciences

Keywords

Privacy preservation Cache-cache mechanism Digital document (DD) Visual cryptography distributed data Secure Multi party computation Color images