Scalable Data Sharing in Cloud Storage Using Ciphertext Poling Attribute Base Encryption
Authors: Prajakta D.Patil, Chhaya Nayak
Published in: IJRRETAS, Volume 2, Issue 3, pp. 1-7 (01 Mar 2016)
Impact Factor: 2.3 (2016)
License:
CC BY 4.0 (Open Access)
Certificate: View Certificate
Abstract
Abstract -with the recent adoption and diffusion of the information sharing paradigm in distributed systems like online social networks or cloud computing, there are increasing demands and considerations for distributed knowledge security. One in every of the foremost difficult problems in knowledge sharing systems is that the social control of access policies and therefore the support of policies updates. With the event of cryptography, the attribute-based encoding (ABE) attracts widespread attention of the researchers in recent years. The ABE theme that belongs to the general public key encoding mechanism takes attributes as public key and associates them with the cipher text or the user’s secret key. it\'s associate economical thanks to solve open issues in access management situations, as an example, the way to provide knowledge confidentiality and expressive access management at the same time. Cipher text policy attribute-based encoding (CP-ABE) is changing into a promising cryptologic answer to the current issue. It allows knowledge house owners to outline their own access policies over user attributes and enforce the policies on the information to be distributed. Therefore, during this study, we have a tendency to propose a completely unique CP-ABE scheme for an information sharing system by exploiting the characteristic of the system design. The proposed scheme options the subsequent achievements: 1) the key written agreement drawback may well be solved by escrow-free key supplying protocol, that is made using the secure two-party computation between the key generation centre and also the data-storing centre, and 2) fine-grained user revocation per every attribute may be done by proxy cryptography that takes advantage of the selective attribute group key distribution on high of the ABE. The performance and security analyses indicate that the proposed scheme is economical to securely manage the data distributed within the data sharing system. Index Terms--Data sharing, attribute-based cryptography, revocation, access management, removing written agreement. Keywords— Data sharing, attribute-based encryption,revocation, access control, removing escrow.
Keywords
- Scalable Data Sharing in Cloud Storage Using Ciphertext Poling Attribute Base Encryption
References
- H. Bast, S. Funke, D. Matijevic, P. Sanders, and D. Schultes, “In Transit to Constant Time Shortest-Path Queries in Road Networks,” Proc. Workshop Algorithm Eng. and Experiments(ALENEX), 2007.
- P. Sanders and D. Schultes, “Engineering Highway Hierarchies,”Proc. 14th Conf. Ann. European Symp. (ESA), pp. 804-816, 2006.
- G. Dantzig, Linear Programming and Extensions,series Rand Corporation Research Study Princeton Univ. Press, 1963.
- R.J. Gutman, “Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks,” Proc. Sixth Workshop Algorithm Eng. and Experiments and the First Workshop Analytic Algorithmics and Combinatorics (ALENEX/ANALC),pp. 100-111, 2004.
- B. Jiang, “I/O-Efficiency of Shortest Path Algorithms: An Analysis,”Proc. Eight Int’l Conf. Data Eng. (ICDE), pp. 12-19, 1992.
- P. Sanders and D. Schultes, “Highway Hierarchies Hasten Exact Shortest Path Queries,”Proc. 13th Ann. European Conf. Algorithms(ESA), pp. 568-579, 2005.
- D. Schultes and P. Sanders, “Dynamic Highway-Node Routing,” Proc. Sixth Int’l Conf. Experimental Algorithms (WEA), pp. 66-79,2007.
- F. Zhan and C. Noon, “Shortest Path Algorithms: An Evaluation Using Real Road Networks,”Transportation Science, vol. 32, no. 1,pp. 65-73, 1998.
- “Google Maps,” http://maps.google.com, 2014.
- “NAVTEQ Maps and Traffic,” http://www.navteq.com, 2014.
- “INRIX Inc. Traffic Information Provider,” http://www.inrix.com, 2014.
- “TomTom NV,” http://www.tomtom.com, 2014.
- “Cisco Visual Networking Index: Global Mobile Data Traffic Forecast Update, 2010-2015,” 2011.
- D. Stewart, “Economics of Wireless Means Data Prices Bound toRise,” The Global and Mail, 2011.
- W.-S. Ku, R. Zimmermann, and H. Wang, “Location-Based Spatial Query Processing in Wireless Broadcast Environments,”IEEETrans. Mobile Computing, vol. 7, no. 6, pp. 778-791, June 2008.
- N. Malviya, S. Madden, and A. Bhattacharya, “A Continuous Query System for Dynamic Route Planning,”Proc. IEEE 27th Int’lConf Data Eng. (ICDE), pp. 792-803, 2011.
- G. Kellaris and K. Mouratidis, “Shortest Path Computation on AirIndexes,”Proc. VLDB Endowment, vol. 3, no. 1, pp. 741-757, 2010.
- Y. Jing, C. Chen, W. Sun, B. Zheng, L. Liu, and C. Tu, EnergyEfficient Shortest Path Query Processing on Air,”Proc. 19th ACM SIGSPATIAL Int’l Conf. Advances in Geographic Information Systems(GIS), pp. 393-396, 2011.
- R. Goldman, N. Shivakumar, S. Venkatasubramanian, and H. Garcia-Molina, “Proximity Search in Databases,”Proc. Int’l Conf. Very Large Databases (VLDB), pp. 26-37, 1998.
- N. Jing, Y.-W. Huang, and E.A. Rundensteiner, “Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation,”IEEE Trans. Knowledgeand Data Eng., vol. 10, no. 3, pp. 409-432, May 1998.
- S. Jung and S. Pramanik, “An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps,” IEEE Trans. Knowledge and Data Eng., vol. 14, no. 5, pp. 1029-1046, Sept.2002.
- E.P.F. Chan and Y. Yang, “Shortest Path Tree Computation inDynamic Graphs,”IEEE Trans. Computers, vol. 58, no. 4, pp. 541-557, Apr. 2009.
- T. Imielinski, S. Viswanathan, and B.R. Badrinath, “Data on Air: Organization and Access,”IEEE Trans. Knowledge and Data Eng.,vol. 9, no. 3, pp. 353-372, May/June 1997.
- J.X. Yu and K.-L. Tan, “An Analysis of Selective Tuning Schemes for Nonuniform Broadcast,” Data and Knowledge Eng., vol. 22,no. 3, pp. 319-344, 1997.
- A.V. Goldberg and R.F.F. Werneck, “Computing Point-to-PointShortest Paths from External Memory,”Proc. SIAM Workshop Algorithms Eng. and Experimentation and the Workshop Analytic Algorithmics and Combinatorics (ALENEX/ANALCO), pp. 26-40, 2005.
- M. Hilger, E. K€ ohler, R. M€ ohring, and H. Schilling, “Fast Point-toPoint Shortest Path Computations with Arc-Flags,”The Shortest Path Problem: Ninth DIMACS Implementation Challenge, vol. 74,pp. 41-72, American Math. Soc., 2009.
- A.V. Goldberg and C. Harrelson, “Computing the Shortest Path: Search Meets Graph Theory,”Proc. 16th Ann. ACM-SIAM Symp.Discrete Algorithms (SODA), pp. 156-165, 2005.
- D. Delling and D. Wagner, “Landmark-Based Routing in Dynamic Graphs,”Proc. Sixth Int’l Workshop Experimental Algorithms (WEA), pp. 52-65, 2007. 7
How to Cite
More from this Issue
- Pacify based Video Retrieval System by Using Adaptive Search AlgorithmRishikesh S Patil, Chhaya Nayak
- “An Improved Hybrid Filtering Approach for Recommender System”Nitika Kadam, Shraddha Kumar
- “To Predict Web User’s Future Request using Improved FP Algorithm & HMM”Rahul Kaul, Shraddha Kumar
- A Review of Performance Evaluation & Enhancement of Proactive and Reactive Routing Protocols of MANETPooja Sugandhi, Chhaya Nayak
More by these Authors
- Review on Deep CNN-Based Blind Image Quality Prediction Techniques2020 • Vol. 6, Issue 4
- Implement Encryption Using Improved CP-ABE System To Achieve data Confidentiality2016 • Vol. 2, Issue 6
- Password authentication using AES and SHA in Cloud Environment for two Servers2016 • Vol. 2, Issue 6
- Sturdy Reversible Watermarking Using Composite Technique With Emboss Filter2016 • Vol. 2, Issue 6