Secure and Trusted Information Brokering In Cloud Computing

Authors

  • Jayalakshmi Kanagasabapathy  Department of Computer Science and Engineering, Vels University, Chennai, Tamil Nadu, India
  • C. Swaraj Paul  Department of Computer Science and Engineering, Vels University, Chennai, Tamil Nadu, India

Keywords:

Information Broking System, Automation segmentation, coordinates broker, privacy preserving, and Attribute-correlation attack

Abstract

To facilitate extensive collaborations, today's organizations raise increasing needs for information sharing via on-demand information access. Information Brokering System (IBS) a top a peer-to-peer overlay has been proposed to support information sharing among loosely federated data sources. It consists of diverse data servers and brokering components, which help client queries to locate the data servers. However, many existing IBSs adopt server side access control deployment and honest assumptions on brokers, and shed little attention on privacy of data and metadata stored and exchanged within the IBS. In this article, we study the problem of privacy protection in information brokering process. We first give a formal presentation of the threat models with a focus on two attacks: attribute-correlation attack and inference attack. Then, we propose a broker-coordinator overlay, as well as two schemes, automaton segmentation scheme and query segment encryption scheme, to share the secure query routing function among a set of brokering servers. With comprehensive analysis on privacy, end to- end performance, and scalability, we show that the proposed system can integrate security enforcement and query routing while preserving system-wide privacy with reasonable overhead. Finally, T-broker uses a lightweight feedback mechanism, which can effectively reduce networking risk and improve system efficiency. The experimental results show that, compared with the existing approaches, our T-broker yields very good results in many typical cases, and the proposed system is robust to deal with various numbers of dynamic service behavior from multiple cloud sites.

References

  1. Hamid Sadeghi (2011), “Empirical Challenges and solutions in constructing a high-performance metasearch engine”, emeraldinsight.
  2. C.Swaraj Paul , G. Gunasekaran, “A Descriptive Literature Survey on Search of Data inCloud “ in International Journal of Applied Engineering Research IJAER, pp. 13112-13114, Volume 10, Number 17 (2015) Special Issues, ISSN 0973-4562.
  3. Leonidas Akritidis, Dimitrios Katsaros ∗, Panayiotis Bozanis (2011), “Effective rank aggregation for metasearching”, The Journal of Systems and Software 84 (2011) 130–143
  4. Craswell, N. and Hawking, D. (2002), “Overview of the TREC-2002 web track”, Proceedings of the 11th Text Retrieval Conference(TREC), National Institute of Standards and Technology, Gaithersburg, MD, pp.86-95.
  5. Dwork, C., Kumar, R., Naor, M., Sivakumar, D., 2001. Rank aggregation methods for the Web. In: Proceedings of the ACM International Conference on World Wide Web (WWW), pp. 613–622.
  6. Farah, M., Vanderpooten, D., 2007. An outranking approach for rank aggregation in information retrieval. In: Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR).
  7. H. Kim, H. Lee, W. Kim, and Y. Kim, “A trust evaluation model for QoS guarantee in cloud systems,” Int. J. Grid Distrib. Comput., vol. 3, no. 1, pp. 1–10, Mar. 2010.
  8. Renda, M.E., Straccia, U., 2003. Web metasearch: rank vs score based rank aggregation methods. In: Proceedings of the ACM International Symposium on Applied Computing (SAC), pp. 841–846.
  9. C.Swaraj Paul , G. Gunasekaran, “An Optimized Attribute Based Similarity Search In Metric Database “ in International Journal of Applied Engineering Research IJAER, pp. 15631-15641, Volume 10, Number6 (2015) Special Issues, ISSN 0973-4562.
  10. Vogt, C.C., Cottrell, G.W., 1999. Fusion via a linear combination of scores. Information Retrieval 1(3), 151-173.
  11. Aslam, J.A., Montague, M.H., 2001a. Metasearch consistency. In: Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR), pp. 386–387.
  12. P. Jain, D. Rane, and S. Patidar, “A novel cloud bursting brokerage and aggregation (CBBA) algorithm for multi cloud environment,” in Proc. 2nd Int. Conf. Adv. Comput. Commun. Technol. (ACCT), Jan. 2012, pp. 383–387.

Downloads

Published

2016-04-30

Issue

Section

Research Articles

How to Cite

[1]
Jayalakshmi Kanagasabapathy, C. Swaraj Paul, " Secure and Trusted Information Brokering In Cloud Computing, International Journal of Scientific Research in Science and Technology(IJSRST), Online ISSN : 2395-602X, Print ISSN : 2395-6011, Volume 2, Issue 2, pp.210-217, March-April-2016.