An Efficient File Hierarchy Attribute-Based Encryption Scheme in Cloud Computing

An Efficient File Hierarchy Attribute-Based Encryption Scheme in Cloud Computing

An Efficient File Hierarchy Attribute-Based Encryption Scheme in Cloud Computing

ABSTRACT:

Ciphertext-policy attribute-based encryption (CP-ABE) has been a preferred encryption technology to solve the challenging problem of secure data sharing in cloud computing. The shared data files generally have the characteristic of multilevel hierarchy, particularly in the area of healthcare and the military. However, the hierarchy structure of shared files has not been explored in CP-ABE. In this paper, an efficient file hierarchy attribute-based encryption scheme is proposed in cloud computing. The layered access structures are integrated into a single access structure, and then, the hierarchical files are encrypted with the integrated access structure. The ciphertext components related to attributes could be shared by the files. Therefore, both ciphertext storage and time cost of encryption are saved. Moreover, the proposed scheme is proved to be secure under the standard assumption. Experimental simulation shows that the proposed scheme is highly efficient in terms of encryption and decryption. With the number of the files increasing, the advantages of our scheme become more and more conspicuous.

PROJECT OUTPUT VIDEO:

EXISTING SYSTEM:

  • Sahai and Waters proposed fuzzy Identity-Based Encryption (IBE) in 2005, which was the prototype of ABE. Latterly, a variant of ABE named CP-ABE was proposed.
  • Since Gentry and Silverberg proposed the first notion of hierarchical encryption scheme, many hierarchical CP-ABE schemes have been proposed. For example, Wang et al. proposed a hierarchical ABE scheme by combining the hierarchical IBE and CP-ABE.
  • Wan et al. proposed hierarchical ABE scheme. Later, Zou gave a hierarchical ABE scheme, while the length of secret key is linear with the order of the attribute set. A ciphertextpolicy hierarchical ABE scheme with short ciphertext is also studied.
  • In these schemes, the parent authorization domain governs its child authorization domains and a top-level authorization domain creates secret key of the next-level domain. The work of key creation is distributed on multiple authorization domains and the burden of key authority center is lightened.

DISADVANTAGES OF EXISTING SYSTEM:

  • In Existing System time and cost for encryption is high.
  • No any special multiple hierarchical files are used.
  • Decryption system time and computation cost are very high.

PROPOSED SYSTEM:

  • In this study, an efficient encryption scheme based on layered model of the access structure is proposed in cloud computing, which is named file hierarchy CP-ABE scheme (or FH-CP-ABE, for short). FH-CP-ABE extends typical CP-ABE with a hierarchical structure of access policy, so as to achieve simple, flexible and fine-grained access control.
  • The contributions of our scheme are three aspects.
  • Firstly, we propose the layered model of access structure to solve the problem of multiple hierarchical files sharing. The files are encrypted with one integrated access structure.
  • Secondly, we also formally prove the security of FH-CP-ABE scheme that can successfully resist chosen plaintext attacks (CPA) under the Decisional Bilinear Diffie-Hellman (DBDH) assumption.
  • Thirdly, we conduct and implement comprehensive experiment for FH-CP-ABE scheme, and the simulation results show that FH-CP-ABE has low storage cost and computation complexity in terms of encryption and decryption.

ADVANTAGES OF PROPOSED SYSTEM:

  • CP-ABE feasible schemes which has much more flexibility and is more suitable for general applications
  • Multiple hierarchical files sharing are resolved using layered model of access structure.
  • In proposed system both ciphertext storage and time cost of encryption are saved.
  • The proposed scheme has an advantage that users can decrypt all authorization files by computing secret key once. Thus, the time cost of decryption is also saved if the user needs to decrypt multiple files.
  • The computation cost of decryption can also be reduced if users need to decrypt multiple files at the same time.

SYSTEM ARCHITECTURE:

An Efficient File Hierarchy Attribute-Based Encryption Scheme in Cloud Computing

An Efficient File Hierarchy Attribute-Based Encryption Scheme in Cloud Computing

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

  • System : Pentium Dual Core.
  • Hard Disk : 120 GB.
  • Monitor : 15’’ LED
  • Input Devices : Keyboard, Mouse
  • Ram : 1 GB

SOFTWARE REQUIREMENTS:

  • Operating system : Windows 7.
  • Coding Language : JAVA/J2EE
  • Tool :         Netbeans 7.2.1
  • Database : MYSQL

REFERENCE:

Shulan Wang, Junwei Zhou, Member, IEEE, Joseph K. Liu, Member, IEEE, Jianping Yu, Jianyong Chen, and Weixin Xie, “An Efficient File Hierarchy Attribute-Based Encryption Scheme in Cloud Computing”, IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 11, NO. 6, JUNE 2016.

PROJECT OUTPUT VIDEO:

 

 

Privacy-Preserving Relative Location Based Services for Mobile Users

Privacy-Preserving Relative Location Based Services for Mobile Users

Privacy-Preserving Relative Location Based Services for Mobile Users

[youtube]https://youtu.be/OX6ZlqZ6yi8[/youtube]

ABSTRACT:

Location-aware applications have been used widely with the assistance of the latest positioning features in Smart Phone such as GPS, AGPS, etc. However, all the existing applications gather users’ geographical data and transfer them into the pertinent information to give meaning and value. For this kind of solutions, the user’s privacy and security issues might be raised because the geographical location has to be exposed to the service provider. A novel and practical solution is proposed in this article to provide the relative location of two mobile users based on their WiFi scanned results without any additional sensors. There is no privacy concern in this solution because end users will not collect and send any sensitive information to the server. This solution adopts a Client/Server (C/S) architecture, where the mobile user as a client reports the ambient WiFi APs and the server calculates the distances based on the WiFi AP’s topological relationships. A series of technologies are explored to improve the accuracy of the estimated distance and the corresponding algorithms are proposed. We also prove the feasibility with the prototype of “Circle Your Friends” System (CYFS) on Android phone which lets the mobile user know the distance between him and his social network friends.

EXISTING SYSTEM:

The rapid proliferation of smart phone technology in urban communities has enabled mobile users to utilize context aware services on their devices. Service providers take advantage of this dynamic and ever-growing technology landscape by proposing innovative context-dependent services for mobile subscribers. Location-based Services (LBS), for example, are used by millions of mobile subscribers every day to obtain location-specific information .Two popular features of location-based services are location check-ins and location sharing. By checking into a location, users can share their current location with family and friends or obtain location-specific services from third-party providers, the obtained service does not depend on the locations of other users. The other types of location-based services, which rely on sharing of locations (or location preferences) by a group of users in order to obtain some service for the whole group, are also becoming popular. According to a recent study, location sharing services are used by almost 20% of all mobile phone users. One prominent example of such a service is the taxi-sharing application, offered by a global telecom operator, where smart phone users can share a taxi with other users at a suitable location by revealing their departure and destination locations. Similarly, another popular service enables a group of users to find the most geographically convenient place to meet.

DISADVANTAGES OF EXISTING SYSTEM:

  1. Privacy of a user’s location or location preferences, with respect to other users and the third-party service provider, is a critical concern in such location-sharing-based applications. For instance, such information can be used to de-anonymize users and their availabilities, to track their preferences or to identify their social networks. For example, in the taxi-sharing application, a curious third-party service provider could easily deduce home/work location pairs of users who regularly use their service.
  2. Without effective protection, evens parse location information has been shown to provide reliable information about a users’ private sphere, which could have severe consequences on the users’ social, financial and private life. Even service providers who legitimately track users’ location information in order to improve the offered service can inadvertently harm users’ privacy, if the collected data is leaked in an unauthorized fashion or improperly shared with corporate partners.

 PROPOSED SYSTEM:

  • In the proposed system, Problem in a privacy-preserving fashion, where each user participates by providing only a single location preference to the CYFS solver or the service provider.
  • In this significantly extended version of our earlier conference paper, we evaluate the security of our proposal under various passive and active adversarial scenarios, including collusion.
  • We also provide an accurate and detailed analysis of the privacy properties of our proposal and show that our algorithms do not provide any probabilistic advantage to a passive adversary in correctly guessing the preferred location of any participant.
  • In addition to the theoretical analysis, we also evaluate the practical efficiency and performance of the proposed algorithms by means of a prototype implementation on a test bed of Nokia mobile devices. We also address the multi-preference case, where each user may have multiple prioritized location preferences.
  • We highlight the main differences, in terms of   performance, with the single preference case, and also present initial experimental results for the multi-preference implementation. Finally, by means of a targeted user study, we provide insight into the usability of our proposed solutions.

ADVANTAGES OF PROPOSED SYSTEM:

We address the privacy issue in LSBSs by focusing on a specific problem called the CYFS. Given a set of user location preferences, the CYFS is to determine a location among the proposed ones such that the maximum distance between this location and all other users’ locations is minimized, i.e. it is fair to all users.

SYSTEM ARCHITECTURE:

Privacy-Preserving Relative Location Based Services for Mobile Users

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

  • System :         Pentium IV 2.4 GHz.
  • Hard Disk           : 40 GB.
  • Floppy Drive : 44 Mb.
  • Monitor : 15 VGA Colour.
  • Mouse :
  • Ram : 512 Mb.
  • MOBILE : ANDROID

SOFTWARE REQUIREMENTS:

  • Operating system : Windows 7.
  • Coding Language : Java 1.7
  • Tool Kit : Android 2.3 ABOVE
  • IDE : Eclipse

REFERENCE:

Fei Ning, Zhuang Yi, Gu Jingjing, Cao Jiannong, Yang Liang, “Privacy-Preserving Relative Location Based Services for Mobile Users”, IEEE SECURITY SCHEMES AND SOLUTIONS, 2015.

Extend Your Journey: Considering Signal Strength and Fluctuation in Location-Based Applications

Extend Your Journey: Considering Signal Strength and Fluctuation in Location-Based Applications

Extend Your Journey: Considering Signal Strength and Fluctuation in Location-Based Applications

[youtube]https://youtu.be/5JmHRWj7-Ac[/youtube]

ABSTRACT:

Reducing the communication energy is essential to facilitate the growth of emerging mobile applications. In this paper, we introduce signal strength into location-based applications to reduce the energy consumption of mobile devices for data reception. First, we model the problem of data fetch scheduling, with the objective of minimizing the energy required to fetch location-based information without impacting the application’s semantics adversely. To solve the fundamental problem, we propose a dynamic-programming algorithm and prove its optimality in terms of energy savings. Then, we perform post-optimal analysis to explore the tolerance of the algorithm to signal strength fluctuations. Finally, based on the algorithm, we consider implementation issues. We have also developed a virtual tour system integrated with existing Web applications to validate the practicability of the proposed concept. The results of experiments conducted based on real-world case studies are very encouraging and demonstrate the applicability of the proposed algorithm toward signal strength fluctuations.

PROJECT OUTPUT VIDEO: (Click the below link to see the project output video):

EXISTING SYSTEM:

Location-based applications will become more diverse and pervasive due to the potential for a range of highly personalized and context-aware services. However, the trend will lead to a significant boost in mobile data traffic and, consequently, result in further pressure on the limited battery capacity of mobile devices. Thus, reducing the communication energy is an imminent challenge in stimulating the development of emerging location-based applications. Many existing approaches leverage the complementary characteristics of Wi-Fi and 3G—i.e., WiFi to improve energy efficiency, and 3G to maintain ubiquitous connectivity. Recently, it has been observed that signal strength has a direct impact on the communication energy consumption. The communication energy per bit when the signal is weak could be as much as six times more than that when the signal is strong. This phenomenon has proved evident in both Wi-Fi and 3G. The reason for such a phenomenon results mainly from the adaptive modulation and power control employed in wireless network systems. Based on the observation, it could be promising to exploit signal strength information to reduce the communication energy of mobile devices. However, the challenge is how to exploit this observation to gain energy efficiency. In particular, signal strength may fluctuate with time due to multipath fading, so attention has to be paid to the impact of signal fluctuations on the practicability of the proposed approaches in real-world environments.

DISADVANTAGES OF EXISTING SYSTEM:

  • The significant boost in mobile data traffic and, consequently, result in further pressure on the limited battery capacity of mobile devices.
  • The communication energy per bit when the signal is weak could be as much as six times more than that when the signal is strong. This phenomenon has proved evident in both Wi-Fi and 3G. The reason for such a phenomenon results mainly from the adaptive modulation and power control employed in wireless network systems. Based on the observation, it could be promising to exploit signal strength information to reduce the communication energy of mobile devices. However, the challenge is how to exploit this observation to gain energy efficiency. In particular, signal strength may fluctuate with time due to multipath fading, so attention has to be paid to the impact of signal fluctuations on the practicability of the proposed approaches in real-world environments.

PROPOSED SYSTEM:

  • In this paper, our major contribution is to introduce signal strength into location-based applications to reduce the energy consumption of mobile devices for data reception.
  • To validate the practicability of the concept, we developed a virtual tour system comprised of an online server and a mobile application program based on Android.
  • First, we model the fundamental problem in the virtual tour system as a data fetch scheduling problem.
  • Second, we propose a dynamic-programming algorithm to solve the fundamental problem. The solution involves scheduling the fetching of location-based information at appropriate locations so as to minimize the total energy consumption. We prove that the algorithm is optimal in terms of energy savings.
  • Third, we perform post optimal analysis to explore how the algorithm responds to signal strength fluctuations, especially the fluctuation range within which the derived solution remains optimal or feasible. The analysis helps to understand the impact of signal fluctuations on the practicability of this new concept in real-world environments.
  • Fourth, we discuss technical implementation issues that arise when introducing signal strength into location-based applications for energy savings.
  • Fifth, we conducted a series of experiments in Taipei City, Taiwan, for real-world case studies. The results show that an Android smartphone of HTC EVO 3D can achieve a significant energy reduction when accessing location-based applications.
  • Finally, we discuss the limitations of our work and highlight issues that require further investigation. The concept, once proved practicable and embraced gradually, could be extended and applied to other variants of location-based applications based on the knowledge learned from this work.

ADVANTAGES OF PROPOSED SYSTEM:

  • Exploitation signal strength information has been done to reduce the communication energy of mobile devices.
  • A feasible fetch schedule that minimizes the total energy consumption for data reception
  • Through real-world case studies, we have demonstrated the practicability of introducing signal strength into location-based applications.

 SYSTEM ARCHITECTURE:

Extend Your Journey Considering Signal Strength and Fluctuation in Location-Based Applications

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

  • System :         Pentium IV 2.4 GHz.
  • Hard Disk           : 40 GB.
  • Floppy Drive : 44 Mb.
  • Monitor : 15 VGA Colour.
  • Mouse :
  • Ram : 512 Mb.
  • MOBILE : ANDROID

SOFTWARE REQUIREMENTS:

  • Operating system : Windows 7.
  • Coding Language : Java 1.7
  • Tool Kit : Android 2.3 ABOVE
  • IDE : Eclipse

REFERENCE:

Chih-Chuan Cheng and Pi-Cheng Hsiu, “Extend Your Journey: Considering Signal Strength and Fluctuation in Location-Based Applications”, IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 23, NO. 2, APRIL 2015.

ieee projects for cse 2015 with abstract and base paper

IEEE Projects for CSE /IT / ECE / EEE 2015 with Abstracts and Base papers

Dear Student,

Greetings from JP INFOTECH. JP INFOTECH (an ISO 9001-2008 Certified Company) is one of the leading Software development & Research Division located at Puducherry & Chennai. As part of the Training division of JP INFOTECH, we assist you in the final year projects in all major domains. We also assure you to publish your papers in International Journals and International Conferences.

We develop software and IEEE academic projects for CSE, IT, ECE, EEE Departments of Ph.D., M.Phil., M.E., M.Tech., MCA, MBA, B.E., B.Tech., Diploma. Our major Domains are:

  • Cloud computing / Big Data / Networking / Wireless Communications / Mobile Computing / Network Security/Secure & Dependable Computing / Data Mining / Knowledge and Data Engg./ Image processing / Parallel & Distributed Systems / Information Security / Power Electronics/ Power Systems / ROBOTICS / EMBEDDED SYSTEMS And many more.

Implementation technologies in

        JAVA/J2EE/ HADOOP / DOTNET / ANDROID / MATLAB / NS2 / OMNET++ / ROBOTICS / EMBEDDED / SIMULINK AND MANY MORE

For Project titles visit: www.jpinfotech.org

You can download the project titles from http://jpinfotech.org/download-ieee-projects/

For our Project Demos visit: https://www.youtube.com/user/jpinfotechprojects

The project deliverables for JAVA / HADOOP / DOTNET /ANDROID / NS2 / MATLAB are:

1) PROJECT BASEPAPER, Abstract Document

2) Complete Source code, Database

3) Final Report / Document

(Document consists of basic contents of about Abstract, Bibilography, Conclusion, Implementation, I/P & O/P Design, Introduction, Literature Survey, Organisation Profile, Screen Shots, Software Environment, System Analysis, System Design, System Specification, System Study, System Testing)

(The chapter System Design consists of 5 diagrams: Data Flow, Use Case, Sequence, Class, Activity Diagram)

3) Review Documents and PPT (for 4 Reviews)

4) How to run Help file/Video file.

OUR OTHER SALIENT FEATURES:

  • Number 1 Project Master in Puducherry/Chennai.
  • Successfully conducted more than 15 International Conferences in all over South India in the year 2013 & 2014.
  • For the year 2015- 2016, we have Signed MoU with 15 Engineering Colleges in all over South India to Conduct International Conferences in year 2015 – 2016.
  • Published more than 1000 Research Articles of Our Ph.D./M.Phil/ME/M.Tech./BE/B.Tech. Students in Leading International Conferences and International Journals for the year 2014- 2015.
  • For the year 2013- 2014 Recognized and Awarded from “PONDICHERRY UNIVERSITY”, “Paavai College of Engg”, “Arjun College of Technology” and many leading institutions.
  • For the year 2014-2015 Recognized and Awarded from the following colleges:
    • “V.P.Muthaiah Pillai Meenakshi Ammal Engineering College for Women”
    • “Muthayammal Arts and Science College”
    • “Sri Raaja Raajan College of Engineering and Technology”
    • “Latha Mathavan Engineering College”
    • “SKR engineering college”
    • “Dr Pauls Engineering College”
    • “Jaya Engineering College”
    • “Jain College of Engineering”
  • Recognized and published article about JP INFOTECH and our director in “THE HINDU”, “DINAKARAN” and many more newspapers and Media.
  • Leaders with more than 7+ years of experience
  • Guided more than 15,000 students.
  • We assist and guarantee you to publish a paper on your project in INTERNATIONAL JOURNAL PUBLICATIONS / INTERNATIONAL CONFERENCE PUBLICATIONS.
  • We provide REVIEW DOCUMENTS AND PPTS for each review
  • NO FALSE PROMISES
  • 100% Assurance for Project Execution
  • 100% LIVE EXPLANATION
  • VIVA-VOCE QUESTIONS & ANSWERS
  • VALID TRAINEE CERTIFICATION (ISO Certification)
  • 100% PLACEMENT SUPPORT
  • Own Projects are also welcomed.

So don’t wait any more!!! Join us and be a part of us. Walk-in to our Office and Register your projects.

For any queries Contact:

R.JAYAPRAKASH BE,MBA,M.Tech., (Ph.D.)

Managing Director

www.jpinfotech.blogspot.com
www.jpinfotech.org

FOLLOW US ON FACEBOOK @ https://www.facebook.com/jpinfotechresearch

MOBILE: (0)9952649690

 Chennai Office: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai – 83. Landmark: Next to Kotak Mahendra Bank / Bharath Scans.

Landline: (044) – 43012642 / Mobile: (0)9952649690

Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry – 9. Landmark: Opp. To Thattanchavady Industrial Estate & Next to VVP Nagar Arch.

Landline: (0413) – 4204066 / (0)9952649690

Vampire Attacks: Draining Life from Wireless Ad Hoc Sensor Networks

Vampire Attacks: Draining Life from Wireless Ad Hoc Sensor Networks

ABSTRACT:

Ad hoc low-power wireless networks are an exciting research direction in sensing and pervasive computing. Prior security work in this area has focused primarily on denial of communication at the routing or medium access control levels. This paper explores resource depletion attacks at the routing protocol layer, which permanently disable networks by quickly draining nodes’ battery power. These “Vampire” attacks are not specific to any specific protocol, but rather rely on the properties of many popular classes of routing protocols. We find that all examined protocols are susceptible to Vampire attacks, which are devastating, difficult to detect, and are easy to carry out using as few as one malicious insider sending only protocol-compliant messages. In the worst case, a single Vampire can increase network-wide energy usage by a factor of O (N), where N in the number of network nodes. We discuss methods to mitigate these types of attacks, including a new proof-of-concept protocol that provably bounds the damage caused by Vampires during the packet forwarding phase.

PROJECT OUTPUT VIDEO: (Click the below link to see the project output video):

EXISTING SYSTEM:

Existing work on secure routing attempts to ensure that adversaries cannot cause path discovery to return an invalid network path, but Vampires do not disrupt or alter discovered paths, instead using existing valid network paths and protocol compliant messages. Protocols that maximize power efficiency are also inappropriate, since they rely on cooperative node behavior and cannot optimize out malicious action.

DISADVANTAGES OF EXISTING SYSTEM:

ü Power outages

ü Due to Environmental disasters, loss in the information

ü Lost productivity

ü Various DOS attacks

ü Secure level is low

ü They do not address attacks that affect long-term availability.

PROPOSED SYSTEM:

This paper makes three primary contributions. First, we thoroughly evaluate the vulnerabilities of existing protocols to routing layer battery depletion attacks. We observe that security measures to prevent Vampire attacks are orthogonal to those used to protect routing infrastructure, and so existing secure routing protocols such as Ariadne, SAODV and SEAD do not protect against Vampire attacks. Existing work on secure routing attempts to ensure that adversaries cannot cause path discovery to return an invalid network path, but Vampires do not disrupt or alter discovered paths, instead using existing valid network paths and protocol-compliant messages. Protocols that maximize power efficiency are also inappropriate, since they rely on cooperative node behavior and cannot optimize out malicious action. Second, we show simulation results quantifying the performance of several representative protocols in the presence of a single Vampire (insider adversary). Third, we modify an existing sensor network routing protocol to provably bound the damage from Vampire attacks during packet forwarding.

 In proposed system we show simulation results quantifying the performance of several representative protocols in the presence of a single Vampire. Then, we modify an existing sensor network routing protocol to provably bound the damage from Vampire attacks during packet forwarding.

ADVANTAGES OF PROPOSED SYSTEM:

ü Protect from the vampire attacks

ü Secure level is high

ü Boost up the Battery power

SYSTEM CONFIGURATION:-

HARDWARE CONFIGURATION:-

ü Processor             –        Pentium –IV

ü Speed                             –        1.1 Ghz

ü RAM                    –        256 MB(min)

ü Hard Disk            –        20 GB

ü Key Board            –        Standard Windows Keyboard

ü Mouse                  –        Two or Three Button Mouse

ü Monitor                –        SVGA

 

SOFTWARE CONFIGURATION:-

ü Operating System                    : Windows XP

ü Programming Language           : JAVA

ü Java Version                           : JDK 1.6 & above.

ü Database                                 : MYSQL

 

REFERENCE:

Eugene Y. Vasserman and Nicholas Hopper “Vampire Attacks: Draining Life from

Wireless Ad Hoc Sensor Networks”- IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 12, NO. 2, FEBRUARY 2013.