IEEE projects 2015 for CSE/IT in coimbatore,ieee 2015 project list, BULK IEEE projects at low cost

Inplant Training in coimbatore for CSE/IT/ECE/EEE

2017-04-26T02:58:00.003-07:00

About training Program:

Inplant training provides the industrial exposure to the students how to face the industry once they foot out from the campus. The industrial knowledge is essential for all students to get success in their job. Once student step in to the industry they should be ready to face competitive world with knowledge. The core competence area extending its boundary daily as technology grows.

Student need to update day to day stuff from various innovative technologies. The difference between “Inplant training” and “Implant training” is often misunderstood. It’s actually “Implant training”, the basic awareness starts from here. Start from basic till the edge of skill we provide the best content practically to the students.

On successful completion of our implant training students will be skilled enough and ready to shine. Job opportunity for students who has certificate on Implant training is high compared to non trained students, because the companies will know that student’s knowledge will be boosted by Implant training.

Objective of training program:

To promote students technical career towards the new technological developments that happens in the industry.
To bring students of various streams in to one roof and chance those to broaden technical knowledge of the students with
the latest trends and technologies followed in the industry.
Participating in this training program gives an opportunity for the Students to interact with the technocrats.
Technocrats are capable to train the students and provide the awareness for students on various latest technologies used by the industry experts.

Training Highlights:

Learn & interact with renowned industry experts
Receive an unparalleled education with personal attention
Students will get “TOOL KIT” at free of cost
E-Book will also be provided to the students during the training.

KEY Benefits:
Participants will be receiving the following from the workshop:

Tools CD
Participation Certificate
Stationary kit

Participation is open to:

STUDENTS

Registration Fees:

Rs.1000 per delegate from institute (ONLY STUDENTS).
Registration charges include course material, certificate, CD & tools kit.
The Number of participants is limited to 200 based on first come first serve basis.

Registration can be made through CASH or DD at following place:
Payment through DD drawn in favor of
“LansA Informatics Pvt Ltd”, Payable at Coimbatore.
Send DD to the following address before 03.06.2017 to confirm your registration.
LansA Informatics Pvt Ltd
No 165, 5th Cross street,
Gandhipuram,
Coimbatore – 641 012
Tamilnadu,India.
Landline: 0422 – 420 43 73
Mobile Number:
+91 90 953 953 33 / +91 91 591 159 69 / +91 84 282 774 07
Email ID: inplanttraining.org.in@gmail.com

The Impact of API Change- And Fault-Proneness on the User Ratings of Android Apps

2015-10-20T00:47:00.002-07:00

ABSTRACT

The mobile apps market is one of the fastest growing areas in the information technology. In digging their market share, developers must pay attention to building robust and reliable apps. In fact, users easily get frustrated by repeated failures, crashes, and other bugs; hence, they abandon some apps in favor of their competition. In this paper we investigate how the fault- and change-proneness of APIs used by Android apps relates to their success estimated as the average rating provided by the users to those apps. First, in a study conducted on 5,848 (free) apps, we analyzed how the ratings that an app had received correlated with the fault- and change-proneness of the APIs such app relied upon. After that, we surveyed 45 professional Android developers to assess (i) to what extent developers experienced problems when using APIs, and (ii) how much they felt these problems could be the cause for unfavorable user ratings. The results of our studies indicate that apps having high user ratings use APIs that are less fault- and change-prone than the APIs used by low rated apps. Also, most of the interviewed Android developers observed, in their development experience, a direct relationship between problems experienced with the adopted APIs and the users’ ratings that their apps received.

AIM

The aim of this paper is investigate how the fault- and change-proneness of APIs used by Android apps relates to their success estimated as the average rating provided by the users to those apps

SCOPE

The scope of this paper is analyzed how the ratings that an app had received correlated with the fault- and change-proneness of the APIs such app relied upon.

EXISTING SYSTEM

Stability and fault-proneness in the Android API is a sensitive and timely topic, given the frequent releases and the number of applications that use these APIs. Therefore, the goal of this paper is to provide solid empirical evidence and shed some light on the relationship between the success of apps (in terms of user ratings), and the change- and fault-proneness of the underlying APIs (i.e., Android API and third-party libraries). We designed two case studies. In the first study we analyzed to what extent the APIs fault- and change-proneness affect the user ratings of the Android apps using them, while in the second we investigated to what extent Android developers experience problems when using APIs and how much they feel these problems can be causes of unfavorable user ratings/comments

DISADVANTAGES

· Users easily get frustrated by repeated failures, crashes, and other bugs

· They abandon some apps in favor of their competition.

PROPOSED SYSTEM

In this project, the purpose of our study is to investigate whether the change- and fault-proneness of APIs used by the app relates (or not) to the app success, measured by its ratings. That is, a heavy usage of fault-prone APIs can lead to repeated failures or even crashes of the apps, hence encouraging users to give low ratings and possibly even abandoning the apps. Similarly, the use of unstable APIs that undergo numerous changes in their interfaces can cause backward compatibility problems or require frequent updates to the apps using those APIs. Such updates, in turn, can introduce defects into the applications using unstable APIs. Results of our first study demonstrate that Android apps having higher user ratings generally use APIs that are less fault- and change-prone than APIs used by low rated apps.

ADVANTAGES

· APIs used by apps having high user ratings are significantly less fault-prone than APIs used by low rated apps

· Our findings highlight the importance of avoiding change-and fault-prone APIs, it must be clear that selecting the best APIs to use is far from trivial

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System :Android OS

· Front End : JAVA

· Database : SqLite

· Tool :Eclipse

REFERENCES

Linares-Vasquez, M., Bernal-Cardenas, C.E., Bavota, G, Di Penta, M. “The Impact of API Change- and Fault-Proneness on the User Ratings of Android Apps” IEEE Transactions on Software Engineering, Volume 41, Issue 4 November 2014

A Location- And Diversity-Aware News Feed System for Mobile Users

2015-10-20T00:44:00.002-07:00

ABSTRACT

A location-aware news feed (LANF) system generates news feeds for a mobile user based on her spatial preference (i.e., her current location and future locations) and non-spatial preference (i.e., her interest). Existing LANF systems simply send the most relevant geo-tagged messages to their users. Unfortunately, the major limitation of such an existing approach is that, a news feed may contain messages related to the same location (i.e., point-of-interest) or the same category of locations (e.g., food, entertainment or sport). We argue that diversity is a very important feature for location-aware news feeds because it helps users discover new places and activities. In this paper, we propose D-MobiFeed; a new LANF system enables a user to specify the minimum number of message categories (h) for the messages in a news feed. In D-MobiFeed, our objective is to efficiently schedule news feeds for a mobile user at her current and predicted locations, such that (i) each news feed contains messages belonging to at least h different categories, and (ii) their total relevance to the user is maximized. To achieve this objective, we formulate the problem into two parts, namely, a decision problem and an optimization problem. For the decision problem, we provide an exact solution by modeling it as a maximum flow problem and proving its correctness. The optimization problem is solved by our proposed three-stage heuristic algorithm. We conduct a user study and experiments to evaluate the performance of D-MobiFeed using a real data set crawled from Foursquare. Experimental results show that our proposed three-stage heuristic scheduling algorithm outperforms the brute-force optimal algorithm by at least an order of magnitude in terms of running time and the relative error incurred by the heuristic algorithm is below 1%. D-MobiFeed with the location prediction method effectively improves the relevance, diversity, and efficiency of news feeds.

AIM

The aim of this paper is is to efficiently schedule news feeds for a mobile user at her current and predicted locations, such that (i) each news feed contains messages belonging to at least h different categories, and (ii) their total relevance to the user is maximized.

SCOPE

The scope of this paper is to achieve this objective, we formulate the problem into two parts, namely, a decision problem and an optimization problem.

EXISTING SYSTEM

MobiFeed the state-of-the-art location-aware news feed system schedules news feeds for mobile users. In MobiFeed, the relevance of a message m to Bob is measured by both the content similarity between m and Bob’s submitted messages (i.e., a non-spatial factor) and the distance between m and Bob (i.e., a spatial factor). MobiFeed is motivated by the fact that, if the news feeds are only computed based on a user’s location at the query time (i.e., it does not consider the user’s future locations, e.g., GeoFeed), the total relevance of news feeds is not optimized With the geographical distance between a message and a mobile user in a relevance measure model, the relevance of a message to a mobile user is changing as the user is moving. Such a dynamic environment gives us an opportunity to employ location prediction technique to improve the quality of news feeds and the system efficiency. Existing diversification problems focus on retrieving an individual list of items with a certain level of diversity. In contrast, with our location prediction techniques, we aim at improving the quality of news feeds by scheduling multiple location- and diversity-aware news feeds for mobile users simultaneously.

DISADVANTAGES

· A news feed may contain messages related to the same location (i.e., point-of-interest) or the same category of locations (e.g., food, entertainment or sport).

· In MobiFeed considers a mobile environment that makes our location- and diversity-aware news feed system unique and more challenging.

PROPOSED SYSTEM

In this project, propose D-MobiFeed; a new LANF system enables a user to specify the minimum number of message categories (h) for the messages in a news feed. In D-MobiFeed, our objective is to efficiently schedule news feeds for a mobile user at her current and predicted locations, such that (i) each news feed contains messages belonging to at least h different categories, and (ii) their total relevance to the user is maximized. To achieve this objective, we formulate the problem into two parts, namely, a decision problem and an optimization problem. For the decision problem, we provide an exact solution by modeling it as a maximum flow problem and proving its correctness. The optimization problem is solved by our proposed three-stage heuristic algorithm. We conduct a user study and experiments to evaluate the performance of D-MobiFeed using a real data set crawled from Foursquare. Experimental results show that our proposed three-stage heuristic scheduling algorithm outperforms the brute-force optimal algorithm by at least an order of magnitude in terms of running time and the relative error incurred by the heuristic algorithm is below 1%. D-MobiFeed with the location prediction method effectively improves the relevance, diversity, and efficiency of news feeds.

ADVANTAGES

· D-MobiFeed with the location prediction method effectively improves the relevance, diversity, and efficiency of news feeds.

· D-MobiFeed can efficiently provide location- and diversity-aware news feeds when maintaining their high quality in terms of relevance

SYSTEM ARCHITECTURE

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System :Android OS

· Front End : JAVA

· Database : SqLite

· Tool :Eclipse

REFERENCES

Chow, C.Xu, W. “A Location- and Diversity-aware News Feed System for Mobile Users” IEEE Transactions ON Services Computing, Volume PP, Issue 99 MAY 2015.

Vulhunter: Toward Discovering Vulnerabilities In Android Applications

2015-10-20T00:36:00.000-07:00

ABSTRACT:

With the prosperity of the Android app economy, many apps have been published and sold in various markets. However, short development cycles and insufficient security development guidelines have led to many vulnerable apps. Although some systems have been developed for automatically discovering specific vulnerabilities in apps, their effectiveness and efficiency are usually restricted because of the exponential growth of paths to examine and simplified assumptions. In this article, the authors propose a new static-analysis framework for facilitating security analysts to detect vulnerable apps from three aspects. First, they propose an app property graph (APG), a new data structure containing detailed and precise information from apps. Second, by modeling app-related vulnerabilities as graph traversals, the authors conduct graph traversals over APGs to identify vulnerable apps for easing the identification process. Third, they reduce the workload of manual verification by removing infeasible paths and generating attack inputs whenever possible. They have implemented the framework in a system named VulHunter with 9,145 lines of Java code and modeled five types of vulnerabilities. Checking 557 popular apps that are randomly collected from Google Play and have at least 1 million installations, the authors found that 375 apps (67.3 percent) have at least one vulnerability.

AIM

The aim of this paper is a new static-analysis framework for facilitating security analysts to detect vulnerable apps from three aspects.

SCOPE

The scope of this tends to implemented the framework in a system named VulHunter with 9,145 lines of Java code and modeled five types of vulnerabilities.

EXISTING SYSTEM:

Existing research on automatic vulnerability discovery for applications (“apps”) usually focuses on several specific types of vulnerabilities because of the undecidability of the generic problem of spotting program vulnerabilities For example, ComDroid aims at Intent related issues (that is, unauthorized Intent receipt and Intent spoofing). SMV-Hunter detects SSL and Transport Layer Security (TLS) man-in-the-middle vulnerabilities., Content Scope examines the vulnerabilities of an unprotected content provider. Android Leaks uncovers potential private information leakages. Woodpecker targets capability leak vulnerabilities. CHEX discovers component hijacking vulnerabilities. However, these systems’ effectiveness and efficiency are usually restricted in practice due to the exponential growth of paths to examine, simplified assumptions, and the limited number of vulnerability patterns.1,8 Moreover, it is not easy to extend these systems to capture new vulnerabilities, although they share some common, components (such as constructing control-flow graphs and dataflow graphs).

DISADVANTAGES:

It is not easy to extend these systems to capture new vulnerabilities, although they share some common, components (such as constructing control-flow graphs and dataflow graphs).
They did not discover vulnerable apps, and it is not clear how SCA processes those apps.

PROPOSED SYSTEM:

In this project, propose a new static-analysis framework to facilitate vulnerability discovery for apps by extracting detailed and precise information from apps and easing the identification process. Moreover, the framework can reduce the manual-verification workload by performing slicing and filtering out infeasible paths. To our knowledge, existing approaches cannot achieve these goals simultaneously. Moreover, defining app property graphs (APGs) and employing graph databases can scale up the vulnerability discovery process. Researchers are exploring an alternative vulnerability-discovery approach of facilitating security analysts by providing detailed and precise information and expert knowledge. The work closest to our approach is the code property graph (CPG),1 which combines an abstract syntax tree (AST), control-flow graph (CFG), and program dependency graph (PDG) to represent C source codes and model common vulnerabilities as graph traversals. Therefore, finding potential vulnerabilities is turned into performing graph traversals over CPGs with much better performance in terms of accuracy and flexibility. Although we also model vulnerabilities as graph traversals and conduct graph traversals to find vulnerable apps, significant differences exist between the two approaches.

ADVANTAGES

Capturing vulnerabilities is made easy and alsomodeling vulnerabilities become easy as per graph traversals.
It reduces false positives and optimizes queries according to vulnerabilities pattern.

SYSTEM ARCHITECTURE:

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System :Android OS

· Front End : JAVA

· Database : SqLite

· Tool :Eclipse

REFERENCE:

Chenxiong Qian Xiapu Luo ; Yu Le ; Guofei Gu “VULHUNTER: TOWARD DISCOVERING VULNERABILITIES IN ANDROID APPLICATIONS”, IEEE Transactions on Micro, Volume 35 , Issue 1,Jan.-Feb. 2015

REAL: A RECIPROCAL PROTOCOL FOR LOCATION PRIVACY IN WIRELESS SENSOR NETWORKS

2015-10-20T00:33:00.001-07:00

ABSTRACT

K -anonymity has been used to protect location privacy for location monitoring services in wireless sensor networks (WSNs), where sensor nodes work together to report k -anonymized aggregate locations to a server. Each k -anonymized aggregate location is a cloaked area that contains at least k persons. However, we identify an attack model to show that overlapping aggregate locations still pose privacy risks because an adversary can infer some overlapping areas with less than k persons that violates the k -anonymity privacy requirement. In this paper, we propose a reciprocal protocol for location privacy (REAL) in WSNs. In REAL, sensor nodes are required to autonomously organize their sensing areas into a set of non-overlapping and highly accurate k -anonymized aggregate locations. To confront the three key challenges in REAL, namely, self-organization, reciprocity property and high accuracy, we design a state transition process, a locking mechanism and a time delay mechanism, respectively. We compare the performance of REAL with current protocols through simulated experiments. The results show that REAL protects location privacy, provides more accurate query answers, and reduces communication and computational costs.

AIM

The aim of this paper in REAL, sensor nodes are required to autonomously organize their sensing areas into a set of non-overlapping and highly accurate k -anonymized aggregate locations

SCOPE

The scope of this paper is to show that REAL protects location privacy, provides more accurate query answers, and reduces communication and computational costs.

EXISTING SYSTEM

With the advancement of sensor and wireless communication technologies, location monitor- ing applications have been developed for surveillance and location systems. Basically, location monitoring applications use sensors to gather personal locations and provide location-based services. However, with an untrustworthy server, an adversary may abuse its received location information to infer personal sensitive information. As a result, monitor- ing personal locations poses privacy threats to the monitored individuals

DISADVANTAGES

Self-organization
reciprocity property
high accuracy

PROPOSED SYSTEM

In this paper, we propose a reciprocal protocol for location privacy (REAL) in WSNs. In REAL, sensor nodes are required to autonomously organize their sensing areas into a set of non-overlapping and highly accurate k -anonymized aggregate locations. To confront the three key challenges in REAL, namely, self-organization, reciprocity property and high accuracy, we design a state transition process, a locking mechanism and a time delay mechanism, respectively.

ADVANTAGES

The state transition process to accomplish self-organization among sensor nodes
The locking mechanism to guarantee the reciprocity property.
The delay mechanism to improve the accuracy of aggregate locations.

SYSTEM ARCHITECTURE

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System :Android OS

· Front End : JAVA

· Database : SqLite

· Tool :Eclipse

REFERENCE:

Jia-Dong Zhang, and Chi-Yin Chow, “REAL: A RECIPROCAL PROTOCOL FOR LOCATION PRIVACY IN WIRELESS SENSOR NETWORKS” IEEE Transactions on Dependable and Secure Computing, Year: 2015, Volume: 12, Issue: 4

CONTEXT-BASED ACCESS CONTROL SYSTEMS FOR MOBILE DEVICES

2015-10-20T00:30:00.002-07:00

ABSTRACT:

Mobile Android applications often have access to sensitive data and resources on the user device. Misuse of this data by malicious applications may result in privacy breaches and sensitive data leakage. An example would be a malicious application surreptitiously recording a confidential business conversation. The problem arises from the fact that Android users do not have control over the application capabilities once the applications have been granted the requested privileges upon installation. In many cases, however, whether an application may get a privilege depends on the specific user context and thus we need a context-based access control mechanism by which privileges can be dynamically granted or revoked to applications based on the specific context of the user. In this paper we propose such an access control mechanism. Our implementation of context differentiates between closely located sub-areas within the same location. We have modified the Android operating system so that context-based access control restrictions can be specified and enforced. We have performed several experiments to assess the efficiency of our access control mechanism and the accuracy of context detection.

AIM

The aim of this paper is our implementation of context differentiates between closely located sub-areas within the same location.

SCOPE

The scope of this paper tends to have performed several experiments to assess the efficiency of our access control mechanism and the accuracy of context detection.

EXISTING SYSTEM:

Security for mobile operating systems focuses on restricting applications from accessing sensitive data and resources, but mostly lacks efficient techniques for enforcing those restrictions according to fine-grained contexts that differentiate between closely located subareas. Moreover, most of this work has focused on developing policy systems that do not restrict privileges per application and are only effective system-wide. So User disable all applications from using the camera and any device resources and privileges that employers restrict while at work, while the user device can retain all its original privileges outside the work area.

DISADVANTAGES

· Do not cover all the possible ways in which applications can access user data and device resources.

· The User leakage of Their privacy.

· Existing location-based policy systems are not accurate enough to differentiate between nearby locations without extra hardware or location devices.

PROPOSED SYSTEM:

In this paper, we propose a context-based access control (CBAC) mechanism for Android systems that allows smartphone users to set configuration policies over their applications’ usage of device resources and services at different contexts. Through the CBAC mechanism, users can, for example, set restricted privileges for device applications when using the device at work, and device applications may re-gain their original privileges when the device is used at home. This change in device privileges is automatically applied as soon as the user device matches a pre-defined context of a user-defined policy. The user can also specify a default set of policies to be applied when the user is located in a non-previously defined location. Configured policy restrictions are defined according to the accessible device resources, services, and permissions that are granted to applications at installation time. Such policies define which services are offered by the device and

limit the device and user information accessibility. Policy restrictions are linked to context and are configured by the device user. We define context according to location and time.

ADVANTAGES

Applications should not be able to fake the location or time of the device.

Can develop securer and more acceptable applications for end users.

SYSTEM ARCHITECTURE:

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System :Android OS

· Front End : JAVA

· Database : SqLite

· Tool :Eclipse

REFERENCE:

Oluwatimi, O. Bertino, E., “CONTEXT-BASED ACCESS CONTROL SYSTEMS FOR MOBILE DEVICES”, IEEE Transactions on Dependable and Secure Computing Volume 12 , Issue 2 April 2014

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

2015-10-20T00:28:00.002-07:00

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.

AIM

The aim of this paper is propose a dynamic-programming algorithm and prove its optimality in terms of energy savings.

SCOPE

The scope of this paper is perform post optimal analysis to explore the tolerance of the algorithm to signal strength fluctuations
EXISTING SYSTEM

Many existing approaches leverage the complementary characteristics of WiFi and 3Gi.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 WiFi 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

· The problem of data fetches scheduling, with the objective of minimizing the energy required to fetch location-based information without impacting the application’s semantics adversely.

· Reducing the communication energy

PROPOSED SYSTEM

In this project, 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 smart phone 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

· Smartphone can achieve energy savings of 46%–70% and 35%–60% for pedestrian users along the two routes,

· The algorithm can tolerate signal strength fluctuations very well when the objects along a route is sparse.

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System :Android OS

· Front End : JAVA

· Database : SqLite

· Tool :Eclipse

REFERENCES

Pi-Cheng Hsiu, Chih-Chuan Cheng “Extend Your Journey: Considering Signal Strength and Fluctuation in Location-Based Applications” IEEE/ACM Transactions on Networking, Volume:23, Issue: 2 February 2014.

User-Defined Privacy Grid System for Continuous Location-Based Services

2015-10-20T00:25:00.001-07:00

ABSTRACT

Location-based services (LBS) require users to continuously report their location to a potentially untrusted server to obtain services based on their location, which can expose them to privacy risks. Unfortunately, existing privacy-preserving techniques for LBS have several limitations, such as requiring a fully - trusted third party, offering limited privacy guarantees and incurring high communication overhead. In this paper, we propose a user-defined privacy grid system called dynamic grid system (DGS); the first holistic system that fulfills four essential requirements for privacy-preserving snapshot and continuous LBS. (1) The system only requires a semi-trusted third party, responsible for carrying out simple matching operations correctly. This semi-trusted third party does not have any information about a user’s location. (2) Secure snapshot and continuous location privacy is guaranteed under our defined adversary models. (3) The communication cost for the user does not depend on the user’s desired privacy level, it only depends on the number of relevant points of interest in the vicinity of the user. (4) Although we only focus on range and k-nearest-neighbor queries in this work, our system can be easily extended to support other spatial queries without changing the algorithms run by the semi-trusted third party and the database server, provided the required search area of a spatial query can be abstracted into spatial regions. Experimental results show that our DGS is more efficient than the state-of-the-art privacy-preserving technique for continuous LBS.

AIM

The aim of this paper is propose a user-defined privacy grid system called dynamic grid system (DGS); the first holistic system that fulfills four essential requirements for privacy-preserving snapshot and continuous LBS

SCOPE

The scope of this paper is show that our DGS is more efficient than the state-of-the-art privacy-preserving technique for continuous LBS.

EXISTING SYSTEM

LBS can be very valuable and as such users should be able to make use of them without having to give up their location privacy. A number of approaches have recently been proposed for preserving the user location privacy in LBS. In general, these approaches can be classified into two main categories.

· Fully-trusted third party (TTP).

· Privacy leakage.

· Service termination

DISADVANTAGES

· Requiring a fully - trusted third party

· Offering limited privacy guarantees

· Incurring high communication overhead

PROPOSED SYSTEM

In this project, propose a user-defined privacy grid system called dynamic grid system (DGS) to provide privacy-preserving snapshot and continuous LBS. The main idea is to place a semitrusted third party, termed query server (QS), between the user and the service provider (SP). QS only needs to be semi-trusted because it will not collect/store or even have access to any user location information. Semi-trusted in this context means that while QS will try to determine the location of a user, it still correctly carries out the simple matching operations required in the protocol, i.e., it does not modify or drop messages or create new messages. An untrusted QS would arbitrarily modify and drop messages as well as inject fake messages, which is why our system depends on a semi-trusted QS.

ADVANTAGES

· The system only requires a semi-trusted third party, responsible for carrying out simple matching operations correctly. This semi-trusted third party does not have any information about a user’s location.

· The communication cost for the user does not depend on the user’s desired privacy level, it only depends on the number of relevant points of interest in the vicinity of the user

SYSTEM ARCHITECTURE

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System :Android OS

· Front End : JAVA

· Database : SqLite

· Tool :Eclipse

REFERENCES

Chow, C. ; Huang, Q. ; Wong, D. ; Schlegel, R “USER-DEFINED PRIVACY GRID SYSTEM FOR CONTINUOUS LOCATION-BASED SERVICES” Mobile Computing, IEEE Transactions on (Volume:PP , Issue: 99 ) January 2015

User Privacy and Data Trustworthiness in Mobile Crowd Sensing

2015-10-20T00:23:00.000-07:00

ABSTRACT

Smart phones and other trendy mobile wearable devices are rapidly becoming the dominant sensing, computing and communication devices in peoples’ daily lives. Mobile crowd sensing is an emerging technology based on the sensing and networking capabilities of such mobile wearable devices. MCS has shown great potential in improving peoples’ quality of life, including healthcare and transportation, and thus has found a wide range of novel applications. However, user privacy and data trustworthiness are two critical challenges faced by MCS. In this article, we introduce the architecture of MCS and discuss its unique characteristics and advantages over traditional wireless sensor networks, which result in inapplicability of most existing WSN security solutions. Furthermore, we summarize recent advances in these areas and suggest some future research directions.

AIM

The aim of this paper is we introduce the architecture of MCS and discuss its unique characteristics and advantages over traditional wireless sensor networks, which result in inapplicability of most existing WSN security solutions

SCOPE

The scope of this paper is user privacy and data trustworthiness are two critical challenges faced by MCS.

EXISTING SYSTEM

MCS can provide fine grained monitoring of interested parameters without setting up the sensing infrastructure beforehand. Moreover, with the proliferation of mobile wearable devices and the ubiquity of wireless broadband connections, MCS can operate in an environment which is not feasible or economical for WSNs. Second, since mobile wearable devices have much more resources than sensor nodes in terms of computing power, memory, and energy, more requirements can be met by MCS applications. Third, sensing devices in MCS are mobile in nature. Therefore, they can collect spatio-temporal data in a much easier way than traditional WSNs. Fourth, the sensing process is more intelligent as participants can take control of the sensing process. Fifth, sometimes WSNs have high installation and maintenance cost, and possibly insufficient node coverage. However, as MCS leverages existing sensing devices and communication infrastructure, there is virtually no establishment cost.

DISADVANTAGES

User privacy
Data trustworthiness

PROPOSED SYSTEM

In this project, Although a lot of research and development activities on MCS have taken place, they mainly focus on new applications and the solution of data collection. There are a number of other issues that need to be addressed. Among these are user privacy and data trustworthiness. As MCS applications involve data collection across wide geographical areas, spatial-temporal information is invariably associated with the data uploaded by participants. This imposes possible threats to user privacy because the collected data may disclose their locations and trajectories. Other possible privacy invasions include recording intimate discussions and capturing private scenes. Such threats would discourage people from becoming participants in MCS. Since altruistic data collection is a critical element of MCS, this issue of privacy invasion needs to be addressed immediately before the success of MCS is explored further. Another security issue of MCS is the reliability of the uploaded data. As data are reported by participants, they could possibly be falsified. Hence, this raises the issue of data trustworthi-ness. Furthermore, this issue inherently conflicts with the privacy issue. This is because if participants’ identities are not disclosed, those participants reporting falsified or even fabricated data cannot be identified and eliminated. In other words, if full anonymity is provided to MCS participants, guaranteeing the trustworthiness of reported data is difficult. Hence, data trustworthiness in MCS becomes more crucial than in traditional wireless sensor networks (WSNs), which deploy a large number of wireless sensor devices managed by the network owner.

ADVANTAGES

· Protecting the data trustworthiness counteracts the mechanisms for preserving privacy.

· A good privacy-preserving reputation system for MCS should consider the link ability exposed by reputation values

SYSTEM ARCHITECTURE

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System :Android OS

· Front End : JAVA

· Database : SqLite

· Tool :Eclipse

REFERENCES

Suarez-Tangil, G.,Tapiador, J.E. ; Lombardi, F. ; Di Pietro, R. “ALTERDROID: Differential Fault Analysis of Obfuscated Smartphone Malware”, IEEE Transactions on Mobile Computing Volume PP , Issue 99 June 2015

Smart Photo: A Resource-Aware Crowd Sourcing Approach for Image Sensing With Smart Phones

2015-10-20T00:20:00.002-07:00

ABSTRACT

Photos obtained via crowd sourcing can be used in many critical applications. Due to the limitations of communication bandwidth, storage and processing capability, it is a challenge to transfer the huge amount of crowd sourced photos. To address this problem, we propose a framework, called Smart Photo, to quantify the quality (utility) of crowd sourced photos based on the accessible geographical and geometrical information (called metadata) including the Smartphone’s orientation, position and all related parameters of the built-in camera. From the metadata, we can infer where and how the photo is taken, and then only transmit the most useful photos. Four optimization problems regarding the tradeoffs between photo utility and resource constraints, namely Max-Utility, online Max-Utility, Min-Selection and Min-Selection with k-coverage, are studied. Efficient algorithms are proposed and their performance bounds are theoretically proved. We have implemented Smart Photo in a test bed using Android based smart phones, and proposed techniques to improve the accuracy of the collected metadata by reducing sensor reading errors and solving object occlusion issues. Results based on real implementations and extensive simulations demonstrate the effectiveness of the proposed algorithms.

AIM

The aim of this paper is propose a framework, called Smart Photo, to quantify the quality (utility) of crowd sourced photos based on the accessible geographical and geometrical information (called metadata) including the Smartphone’s orientation, position and all related parameters of the built-in camera.

SCOPE

The scope of this paper is implemented Smart Photo in a test bed using Android based smart phones, and proposed techniques to improve the accuracy of the collected metadata by reducing sensor reading errors and solving object occlusion issues.
EXISTING SYSTEM

The major challenges faced by these applications are as follows. The first is how to characterize the quality (usefulness) of crowd sourced photos in a way that is both meaningful and resource friendly. Most content-based image processing techniques such as may demand too much computational and communication resources at both user and server end. On the other hand, existing solutions from description based techniques either categorize photos based on user defined tags, or prioritize them by the GPS location . Obviously, tagging each photo manually is not convenient and may discourage public participation. GPS location itself may not be sufficient to reveal the real point of interest. Even at the same location, smart phones facing different directions will have different views.

DISADVANTAGES

· Limitations of communication bandwidth, storage and processing capability.

· To identify the most relevant data and eliminate redundancy becomes an important issue.

PROPOSED SYSTEM

In this project, propose Smart Photo, a novel framework to evaluate and optimize the selection of crowd sourced photos, based on the collected metadata from the smart phones. We formulate the Max-Utility problem for bandwidth constrained networks, and then extend it into an online optimization problem. We study the Min-Selection problem for redundancy reduction, and also extend it to the case where better coverage (e.g., k-coverage) is desired. Moreover, we propose efficient solutions, and find the performance bounds in terms of approximation or competitive ratios for the proposed algorithms. We have implemented Smart Photo in a test bed using Android based smart phones. We make use of multiple embedded sensors in off-the-shelf smart phones, and propose a series of methods to fuse data, correct errors, and filter out false information, to improve the accuracy of the collected metadata. Finally, the performance of the proposed algorithms is evaluated through real implementations and extensive simulations.

ADVANTAGES

· Resource constraint of bandwidth, storage and processing capability limits the number of photos that can be uploaded to the server.

· Consider having certain level of redundancy in case better coverage is needed.

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System :Android OS

· Front End : JAVA

· Database : SqLite

· Tool :Eclipse

REFERENCES

Wang, Y. , Hu, W. , Cao, G. Wu, Y. “Smart Photo: A Resource-Aware Crowd sourcing Approach for Image Sensing with Smart phones” IEEE Transactions on Mobile Computing, Volume PP , Issue 99 June 2015

SBVLC: Secure Barcode-Based Visible Light Communication For Smartphone’s

2015-10-20T00:19:00.001-07:00

ABSTRACT

As an alternative to NFC technology, 2D barcodes have been increasingly used for security-sensitive applications including payments and personal identification. However, the security of barcode-based communication in mobile applications has not been systematically studied. Due to the visual nature, 2D barcodes are subject to eavesdropping when they are displayed on the screen of a smart phone. On the other hand, the fundamental design principles of 2D barcodes make it difficult to add security features. In this paper, we propose SBVLC - a secure system for barcode-based visible light communication (VLC) between smartphones. We formally analyze the security of SBVLC based on geometric models and propose physical security enhancement mechanisms for barcode communication by manipulating screen view angles and leveraging user-induced motions. We then develop two secure data exchange schemes. These schemes are useful in many security-sensitive mobile applications including private information sharing, secure device pairing, and mobile payment. SBVLC is evaluated through extensive experiments on both Android and iOS smartphones.

AIM

The aim of this paper is formally analyze the security of SBVLC based on geometric models and propose physical security enhancement mechanisms for barcode communication by manipulating screen view angles and leveraging user-induced motions.

SCOPE

The scope of this paper is SBVLC is evaluated through extensive experiments on both Android and iOS smart phones.

EXISTING SYSTEM

The proliferation of smart phones puts a portable camera in everyone’s pocket, making eavesdropping much easier. This is exacerbated by widely spread use of surveillance cameras in public areas like shopping malls. On the other hand, the fundamental design principles of 2D barcodes make it difficult to add security features. First, a 2D barcode only contains a small amount of information and hence cannot simply adopt advanced encryption primitives. Moreover, most existing barcode applications are based on a single barcode exchange, which is insufficient for establishing a secure communication channel. Recently, several systems are designed to stream a series of barcodes between a LCD screen and smart phone camera. These systems can enable high-throughput ad hoc communication between smart phones; however, they are designed based on highly customized barcodes which are not widely adopted in practice

DISADVANTAGES

· Due to the visual nature, 2D barcodes are subject to eavesdropping when they are displayed on the screen of a smart phone

· The fundamental design principles of 2D barcodes make it difficult to add security features

PROPOSED SYSTEM

In this project, we investigate secure barcode based communication for smart phones. Due to the inherent directionality, the visible light communication (VLC) channel of barcode exchanges yields interesting security properties. We formally analyze the security of VLC based on geometric models and propose security enhancement mechanisms such as manipulating view angles and leveraging user-induced motions. We then develop three secure data exchange protocols that encode information in barcode streams. We believe that the proposed protocols are useful in many mobile applications including private information sharing, device pairing, and mobile payment systems, etc. further propose two secure communication schemes. The first scheme, two-phase message transfer scheme, is an ultra-lightweight solution to secure smart phone data exchange and mobile payment. The second scheme, all-or-nothing data streaming scheme, is tailored for secure temporary data transfer without key exchange. It adopts the secret sharing scheme to enhance the channel security it preserves the confidentiality of all the transmitted data, if the eavesdropper misses at least one barcode frame during the entire communication. Both proposed schemes are evaluated through extensive experiments on both Android and iOS smartphone platforms

ADVANTAGES

· Our system achieves high level security and NFC-comparable throughput

· The system can be used for private information sharing, secure device pairing and secure mobile payment, etc.

SYSTEM ARCHITECTURE

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System :Android OS

· Front End : JAVA

· Database : SqLite

· Tool :Eclipse

REFERENCES

Kui Ren, Guoliang Xing, Xinwen Fu, Bingsheng Zhang, “SBVLC: Secure Barcode-based Visible Light Communication for Smart phones”, IEEE INFOCOM 2014 Proceedings

ALTERDROID: Differential Fault Analysis of Obfuscated Smartphone Malware

2015-10-20T00:16:00.000-07:00

ABSTRACT

Malware for smart phones has rocketed over the last years. Market operators face the challenge of keeping their stores free from malicious apps, a task that has become increasingly complex as malware developers are progressively using advanced techniques to defeat malware detection tools. One such technique commonly observed in recent malware samples consists of hiding and obfuscating modules containing malicious functionality in places that static analysis tools overlook (e.g., within data objects). In this paper, we describe ALTERDROID, a dynamic analysis approach for detecting such hidden or obfuscated malware components distributed as parts of an app package. The key idea in ALTERDROID consists of analyzing the behavioral differences between the original app and a number of automatically generated versions of it, where a number of modifications (faults) have been carefully injected. Observable differences in terms of activities that appear or vanish in the modified app are recorded, and the resulting differential signature is analyzed through a pattern-matching process driven by rules that relate different types of hidden functionalities with patterns found in the signature. A thorough justification and a description of the proposed model are provided. The extensive experimental results obtained by testing ALTERDROID over relevant apps and malware samples support the quality and viability of our proposal.

AIM

The aim of this paper is ALTERDROID consists of analyzing the behavioral differences between the original app and a number of automatically generated versions of it, where a number of modifications (faults) have been carefully injected

SCOPE

The scope of this paper is Observable differences in terms of activities that appear or vanish in the modified app are recorded, and the resulting differential signature is analyzed through a pattern-matching process driven by rules that relate different types of hidden functionalities with patterns found in the signature

EXISTING SYSTEM

Smartphone malware has become a rather profitable business due to the existence of a large number of potential targets and the availability of reuse-oriented malware development methodologies that make exceedingly easy to produce new samples. Smartphone malware is becoming increasingly stealthy and recent specimens are relying on advanced code obfuscation techniques to evade detection by security analysts. More sophisticated obfuscation techniques, particularly in code, are starting to materialize (e.g., stegomalware ). These techniques and trends create an additional obstacle to malware analysts, who see their task further complicated and have to ultimately rely on carefully controlled dynamic analysis techniques to detect the presence of potentially dangerous pieces of code.

DISADVANTAGES

· Recent malware samples consist of hiding and obfuscating modules containing malicious functionality in places that static analysis tools overlook.

PROPOSED SYSTEM

In this project, ALTERDROID, a tool for detecting, through reverse engineering, obfuscated functionality in components distributed as parts of an app package. Such components are often part of a malicious app and are hidden outside its main code components (e.g. within data objects), as code components may be subject to static analysis by market operators. The key idea in ALTERDROID consists of analyzing the behavioral differences between the original app and an altered version where a number of modifications (faults) have been carefully introduced. Such modifications are designed to have no observable effect on the app execution, provided that the altered component is actually what it should be (i.e., it does not hide any unwanted functionality). For example, replacing the value of some pixels in a picture or a few characters in a string encoding an error message should not affect the execution. However, if after doing so it is observed that a dynamic class loading action crashes or a network connection does not take place, it may well be that the picture was actually a piece of code or the string a network address or a URL.

ADVANTAGES

· To support differential fault analysis over distinguishable components such as those involving Dex bytecode.

· ALTERDROID is a powerful and novel dynamic analysis technique that can identify potentially malicious components hidden within an app package.

SYSTEM ARCHITECTURE

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System :Android OS

· Front End : JAVA

· Database : SqLite

· Tool :Eclipse

REFERENCES

Discovery of Ranking Fraud for Mobile Apps

2015-10-20T00:13:00.001-07:00

ABSTRACT

Ranking fraud in the mobile App market refers to fraudulent or deceptive activities which have a purpose of bumping up the Apps in the popularity list. Indeed, it becomes more and more frequent for App developers to use shady means, such as inflating their Apps’ sales or posting phony App ratings, to commit ranking fraud. While the importance of preventing ranking fraud has been widely recognized, there is limited understanding and research in this area. To this end, in this paper, we provide a holistic view of ranking fraud and propose a ranking fraud detection system for mobile Apps. Specifically, we first propose to accurately locate the ranking fraud by mining the active periods, namely leading sessions, of mobile Apps. Such leading sessions can be leveraged for detecting the local anomaly instead of global anomaly of App rankings. Furthermore, we investigate three types of evidences, i.e., ranking based evidences, rating based evidences and review based evidences, by modeling Apps’ ranking, rating and review behaviors through statistical hypotheses tests. In addition, we propose an optimization based aggregation method to integrate all the evidences for fraud detection. Finally, we evaluate the proposed system with real-world App data collected from the iOS App Store for a long time period. In the experiments, we validate the effectiveness of the proposed system, and show the scalability of the detection algorithm as well as some regularity of ranking fraud activities.

AIM

The aim of this paper is provide a holistic view of ranking fraud and propose a ranking fraud detection system for mobile Apps.

SCOPE

The scope of this paper is investigate three types of evidences, i.e., ranking based evidences, rating based evidences and review based evidences, by modeling Apps’ ranking, rating and review behaviors through statistical hypotheses tests.

EXISTING SYSTEM

In the literature, while there are some related works, such as web ranking spam detection, online review spam detection and mobile App recommendation the problem of detecting ranking fraud for mobile Apps is still underexplored. To fill this crucial void, in this paper, we propose to develop a ranking fraud detection system for mobile Apps. Along this line, we identify several important challenges. First, ranking fraud does not always happen in the whole life cycle of an App, so we need to detect the time when fraud happens. Such challenge can be regarded as detecting the local anomaly instead of global anomaly of mobile Apps. Second, due to the huge number of mobile Apps, it is difficult to manually label ranking fraud for each App, so it is important to have a scalable way to automatically detect ranking fraud without using any benchmark information. Finally, due to the dynamic nature of chart rankings, it is not easy to identify and confirm the evidences linked to ranking fraud, which motivates us to discover some implicit fraud patterns of mobile Apps as evidences.

DISADVANTAGES

· The problem of detecting ranking fraud for mobile Apps.

· Huge number of mobile apps, it is difficult to manually label ranking fraud for each app.

PROPOSED SYSTEM

In this project, we first propose a simple yet effective algorithm to identify the leading sessions of each App based on its historical ranking records. Then, with the analysis of Apps’ ranking behaviors, we find that the fraudulent Apps often have different ranking patterns in each leading session compared with normal Apps. Thus, we characterize some fraud evidences from Apps’ historical ranking records, and develop three functions to extract such ranking based fraud evidences. Nonetheless, the ranking based evidences can be affected by App developers’ reputation and some legitimate marketing campaigns, such as “limited-time discount”. As a result, it is not sufficient to only use ranking based evidences. Therefore, we further propose two types of fraud evidences based on Apps’ rating and review history, which reflect some anomaly patterns from Apps’ historical rating and review records. In addition, we develop an unsupervised evidence-aggregation method to integrate these three types of evidences for evaluating the credibility of leading sessions from mobile Apps. It shows the framework of our ranking fraud detection system for mobile Apps. It is worth noting that all the evidences are extracted by modeling Apps’ ranking, rating and review behaviors through statistical hypotheses tests. The proposed framework is scalable and can be extended with other domaingenerated evidences for ranking fraud detection. Finally, we evaluate the proposed system with real-world App data collected from the Apple’s App store for a long time period, i.e., more than two years. Experimental results show the effectiveness of the proposed system, the scalability of the detection algorithm as well as some regularity of ranking fraud activities.

ADVANTAGES

An unique perspective of this approach is that all the evidences can be modeled by statistical hypothesis tests, thus it is easy to be extended with other evidences from domain knowledge to detect ranking fraud.
Identified ranking based evidences, rating based evidences and review based evidences for detecting ranking fraud.

SYSTEM ARCHITECTURE

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System :Android OS

· Front End : JAVA

· Database : SqLite

· Tool :Eclipse

REFERENCES

Hengshu Zhu, Hui Xiong , Yong Ge , Enhong Chen “Discovery of Ranking Fraud for Mobile Apps” IEEE Transactions on Knowledge and Data Engineering, Volume27, Issue 1 April 2014.

Smartphone-Based Wound Assessment System For Patients With Diabetes

2015-10-20T00:10:00.000-07:00

ABSTRACT

Diabetic foot ulcers represent a significant health issue. Currently, clinicians and nurses mainly base their wound assessment on visual examination of wound size and healing status, while the patients themselves seldom have an opportunity to play an active role. Hence, a more quantitative and cost-effective examination method that enables the patients and their caregivers to take a more active role in daily wound care potentially can accelerate wound healing, save travel cost and reduce healthcare expenses. Considering the prevalence of smart phones with a high-resolution digital camera, assessing wounds by analyzing images of chronic foot ulcers is an attractive option. In this paper, we propose a novel wound image analysis system implemented solely on the Android smart phone. The wound image is captured by the camera on the smart phone with the assistance of an image capture box. After that, the smart phone performs wound segmentation by applying the accelerated mean-shift algorithm. Specifically, the outline of the foot is determined based on skin color, and the wound boundary is found using a simple connected region detection method. Within the wound boundary, the healing status is next assessed based on red-yellow-black color evaluation model. Moreover, the healing status is quantitatively assessed, based on trend analysis of time records for a given patient. Experimental results on wound images collected in UMASS-Memorial Health Center Wound Clinic (Worcester, MA) following an Institutional Review Board approved protocol show that our system can be efficiently used to analyze the wound healing status with promising accuracy.

AIM

The aim of this paper is propose a novel wound image analysis system implemented solely on the Android smart phone.

SCOPE

The scope of this paper is tends to show that our system can be efficiently used to analyze the wound healing status with promising accuracy

EXISTING SYSTEM:

There are several problems with current practices for treating diabetic foot ulcers. First, patients must go to their wound clinic on a regular basis to have their wounds checked by their clinicians. This need for frequent clinical evaluation is not only inconvenient and time consuming for patients and clinicians, but also represents a significant health care cost because patients may require special transportation, e.g., ambulances. Second, a clinician’s wound assessment process is based on visual examination. He/she describes the wound by its physical dimensions and the color of its tissues, providing important indications of the wound type and the stage of healing. Because the visual assessment does not produce objective measurements and quantifiable parameters of the healing status, tracking a wound’s healing process across consecutive visits is a difficult task for both clinicians and patients. The wound boundary determination was done with a particular implementation of the level set algorithm; specifically the distance regularized level set evolution The principal disadvantage of the level set algorithm is that the iteration of global level set function is too computationally intensive to be implemented on smart phones, even with the narrow band confined implementation based on GPUs. In addition, the level set evolution completely depends on the initial curve which has to be pre-delineated either manually or by a well-designed algorithm. Finally, false edges may interfere with the evolution when the skin color is not uniform enough and when missing boundaries, as frequently occurring in medical images, results in evolution leakage (the level set evolution does not stop properly on the actual wound boundary). Hence, a better method was required to solve these problems.

DISADVANTAGES:

Patient has to travel with foot ulcers to their clinics to report about the ulcers. This may increase the seriousness of the ulcers instead of curing it.
Patient travel exposure may cause a serious problem for them.

PROPOSED SYSTEM:

In this paper, replaced the level set algorithms with the efficient mean-shift segmentation algorithm. While it addresses the previous problems, it also creates additional challenges, such as over-segmentation, which we solved using the region adjacency graph (RAG)-based region merge algorithm. Present the entire process of recording and analyzing a wound image, using algorithms that are executable on a smart phone, and provide evidence of the efficiency and accuracy of these algorithms for analyzing diabetic foot ulcers.

ADVANTAGES

Patient’s travel exposure is considerably reduced. Also it will reduce the patients stress.
Doctor can easily analyze the problem through images and its segmentation. So the proper report can be given to the patient on time

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System :Android OS

· Front End : JAVA

· Database : SqLite

· Tool :Eclipse

REFERENCES

Pedersen, P.C. Strong, D.M. Tulu, B.,Lei Wang ,"SMARTPHONE-BASED WOUND ASSESSMENT SYSTEM FOR PATIENTS WITH DIABETES" , IEEE Transactions on Biomedical Engineering Volume 62 , Issue 2 Feb. 2015

My Privacy My Decision: Control Of Photo Sharing On Online Social Networks

2015-10-20T00:06:00.001-07:00

ABSTRACT:

Photo sharing is an attractive feature which popularizes Online Social Networks (OSNs). Unfortunately, it may leak users’ privacy if they are allowed to post, comment, and tag a photo freely. In this paper, we attempt to address this issue and study the scenario when a user shares a photo containing individuals other than himself/herself (termed co-photo for short). To prevent possible privacy leakage of a photo, we design a mechanism to enable each individual in a photo be aware of the posting activity and participate in the decision making on the photo posting. For this purpose, we need an efficient facial recognition (FR) system that can recognize everyone in the photo. However, more demanding privacy setting may limit the number of the photos publicly available to train the FR system. To deal with this dilemma, our mechanism attempts to utilize users’ private photos to design a personalized FR system specifically trained to differentiate possible photo co-owners without leaking their privacy. We also develop a distributed consensus based method to reduce the computational complexity and protect the private training set. We show that our system is superior to other possible approaches in terms of recognition ratio and efficiency. Our mechanism is implemented as a proof of concept Android application on Facebook’s platform.

AIM

Our mechanism attempts to utilize user`s private photos to design a personalized FR system specifically trained to differentiate possible photo co-owners without leaking their privacy.

SCOPE

The Scope of this project is to reduce the computational complexity and protect the private training set.

EXISTING SYSTEM

For instance, nowadays we can share any photo as we like on OSNs, regardless of whether this photo contains other people (is a co-photo) or not. Currently there is no restriction with sharing of co-photos, on the contrary, social network service providers like Face book we need to elaborate on the privacy issues over OSNs. Traditionally, privacy is regarded as a state of social withdrawal. According to Altman’s privacy regulation theory, privacy is a dialectic and dynamic boundary regulation process where privacy is not static but “a selective control of access to the self or to ones group”. In this theory, “dialectic” refers to the openness and closeness of self to others and “dynamic” means the desired privacy level changes with time according to environment.

DISADVANTAGES:

It may leak users’ privacy if they are allowed to post, comment, and tag a photo freely
Photo sharing and tagging are added, the situation becomes more complicated.

PROPOSED SYSTEM

In this paper, we propose a novel consensus based approach to achieve efficiency and privacy at the same time. The idea is to let each user only deal with his/her private photo set as the local train data and use it to learn out the local training result. After this, local training results are exchanged among users to form a global knowledge. In the next round, each user learns over his/hers local data again by taking the global knowledge as a reference. Finally the information will be spread over users and consensus could be reached. We show later that by performing local learning in parallel, efficiency and privacy could be achieved at the same time.

ADVANTAGES

Designed a privacy-preserving FR system to identify individuals in a co-photo.
our proposed scheme be very useful in protecting users’ privacy in photo/image sharing over online social networks

SYSTEM ARCHITECTURE:

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System : Windows 7

· Front End : JSP AND SERVLET

· Database : MYSQL

· Tool :NETBEANS

REFERENCE:

Xu, K,Guo, Y, Guo, L. Fang, Y. “My Privacy My Decision: Control Of Photo Sharing On Online Social Networks”, IEEE Transactions on Dependable and Secure Computing, Volume PP, Issue 99, JUNE 2015.

Key-Recovery Attacks On Kids, A Keyed Anomaly Detection System

2015-10-20T00:03:00.002-07:00

ABSTRACT:

Most anomaly detection systems rely on machine learning algorithms to derive a model of normality that is later used to detect suspicious events. Some works conducted over the last years have pointed out that such algorithms are generally susceptible to deception, notably in the form of attacks carefully constructed to evade detection. Various learning schemes have been proposed to overcome this weakness. One such system is KIDS (Keyed IDS), introduced at DIMVA’10. KIDS’ core idea is akin to the functioning of some cryptographic primitives, namely to introduce a secret element (the key) into the scheme so that some operations are infeasible without knowing it. In KIDS the learned model and the computation of the anomaly score are both key-dependent, a fact which presumably prevents an attacker from creating evasion attacks. In this work we show that recovering the key is extremely simple provided that the attacker can interact with KIDS and get feedback about probing requests. We present realistic attacks for two different adversarial settings and show that recovering the key requires only a small amount of queries, which indicates that KIDS does not meet the claimed security properties. We finally revisit KIDS’ central idea and provide heuristic arguments about its suitability and limitations.

AIM

The aims of this paper KIDS the learned model and the computation of the anomaly score are both key-dependent, a fact which presumably prevents an attacker from creating evasion attacks.

SCOPE

The Scope of this project is show that recovering the key is extremely simple provided that the attacker can interact with KIDS and get feedback about probing requests.

EXISTING SYSTEM

Accurately pointed out that security problems differ from other application domains of machine learning in, at least, one fundamental feature: the presence of an adversary who can strategically play against the algorithm to accomplish his goals. Thus for example, one major objective for the attacker is to avoid detection. Evasion attacks exploit weaknesses in the underlying classifiers, which are often unable to identify a malicious sample that has been conveniently modified so as to look normal. Examples of such attacks abound. For instance, spammers regularly obfuscate their emails in various ways to avoid detection, e.g. by modifying words that are usually found in spam, or by including a large number of words that do not. Similarly malware and other pieces of attack code can be carefully adapted so as to evade Intrusion Detection Systems (IDS) without compromising the functionality of the attack

DISADVANTAGES:

Anomaly detection systems rely on machine learning algorithms to derive a model of normality that is later used to detect suspicious events
Such algorithms are generally susceptible to deception, notably in the form of attacks carefully constructed to evade detection.

PROPOSED SYSTEM

KIDS (Keyed Intrusion Detection System) , introduced by Mrdovic and Drazenovic at DIMVA’10. KIDS is an application layer network anomaly detection system that extracts a number of features (“words”) from each payload. The system then builds a model of normality based both on the frequency of observed features and their relative positions in the payload. KIDS’ core idea to impede evasion attacks is to incorporate the notion of a “key”, this being a secret element used to determine how classification features are extracted from the payload. The security argument here is simple: even though the learning and testing algorithms are public, an adversary who is not in possession of the key will not know exactly how a request will be processed and, consequently, will not be able to design attacks that thwart detection

ADVANTAGES

It has been on recovering the key through efficient procedures, demonstrating that the classification process leaks information about it that can be leveraged by an attacker.
The ultimate goal is to evade the system, and we have just assumed that knowing the key is essential to craft an attack that evades detection or, at least, that significantly facilitates the process

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System : Windows 7

· Front End : JSP AND SERVLET

· Database : MYSQL

· Tool :NETBEANS

REFERENCE:

Tapiador, J.E, Orfila, A. ; Ribagorda, A. ; Ramos, B.. “Key-Recovery Attacks On Kids, A Keyed Anomaly Detection System”, IEEE Transactions on Dependable and Secure Computing, Volume 12 Issue 3 , SEPTEMBER 2013..

Improved Privacy-Preserving P2p Multimedia Distribution Based On Recombined Fingerprints

2015-10-20T00:01:00.000-07:00

ABSTRACT

Anonymous fingerprint has been suggested as a convenient solution for the legal distribution of multimedia contents with copyright protection whilst preserving the privacy of buyers, whose identities are only revealed in case of illegal re-distribution. However, most of the existing anonymous fingerprinting protocols are impractical for two main reasons: 1) the use of complex time-consuming protocols and/or homomorphic encryption of the content, and 2) a unicast approach for distribution that does not scale for a large number of buyers. This paper stems from a previous proposal of recombined fingerprints which overcomes some of these drawbacks. However, the recombined fingerprint approach requires a complex graph search for traitor tracing, which needs the participation of other buyers, and honest proxies in its P2P distribution scenario. This paper focuses on removing these disadvantages resulting in an efficient, scalable, privacy-preserving and P2P-based fingerprinting system.

AIM

The aim of this paper is the recombined fingerprint approach requires a complex graph search for traitor tracing, which needs the participation of other buyers, and honest proxies in its P2P distribution scenario.

SCOPE:

The Scope of this paper focuses on removing these disadvantages resulting in an efficient, scalable, privacy-preserving and P2P-based fingerprinting system.

EXISTING SYSTEM

Most fingerprinting systems can be classified in three categories, namely symmetric, asymmetric and anonymous schemes. In symmetric schemes, the merchant is the one who embeds the fingerprint into the content and forwards the result to the buyer; hence, the buyer cannot be formally accused of illegal redistribution, since the merchant also had access to the fingerprinted content and could be responsible for the redistribution. In asymmetric fingerprinting, the merchant does not have access to the fingerprinted copy, but he can recover the fingerprint in case of illegal re-distribution and thereby identify the offending buyer. In anonymous fingerprinting, in addition to asymmetry, the buyer preserves her anonymity (privacy) and hence she cannot be linked to the purchase of a specific content, unless she participates in an illegal re-distribution. Anonymous fingerprinting is, thus, the most convenient strategy to protect both the buyers’ privacy and the owner’s rights, since it guarantees the following properties: 1) only the buyer obtains the fingerprinted copy of the content, making it impossible for the merchant to accuse her of unlawful re-distribution, and 2) it preserves the anonymity of the buyers’ identities with respect to the merchant

DISADVANTAGES

The use of complex time-consuming protocols and/or homomorphic encryption of the content,
A unicast approach for distribution that does not scale for a large number of buyers.

PROPOSED SYSTEM

This paper reviews the main features of the proposal suggested in highlights its main drawbacks, and suggests several significant improvements to achieve a more efficient and practical system, especially as traitor tracing is concerned, since it avoids the situations in which illegal re-distributors cannot be traced with the proposal of Furthermore, better security properties against potentially malicious proxies are obtained. Although the system proposed in this paper uses public-key encryption in the distribution and traitor tracing protocols, it must be taken into account that this encryption is only applied to short bit strings, such as the binary fingerprints and hashes, not to the content. The fragments of the content are encrypted using symmetric cryptography, which is much more efficient.

ADVANTAGES

Efficient and scalable distribution of multimedia contents in P2P networks.
Avoidance of (complex) homomorphic (or any type of public-key) encryption of the multimedia content.

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System : Windows 7

· Front End : JSP AND SERVLET

· Database : MYSQL

· Tool :NETBEANS

REFERENCE

Megias, D ,“ Improved Privacy-Preserving P2p Multimedia Distribution Based On Recombined Fingerprints,” IEEE Transactions on Dependable and Secure Computing, Volume 12 Issue 2 , April 2014.

Deleting Secret Data with Public Verifiability

2015-10-19T23:58:00.001-07:00

Abstract

Existing software-based data erasure programs can be summarized as following the same one-bit-return protocol: the deletion program performs data erasure and returns either success or failure. However, such a one bit- return protocol turns the data deletion system into a black box – the user has to trust the outcome but cannot easily verify it. This is especially problematic when the deletion program is encapsulated within a Trusted Platform Module (TPM), and the user has no access to the code inside.

In this paper, we present a cryptographic solution that aims to make the data deletion process more transparent and verifiable. In contrast to the conventional black/white assumptions about TPM (i.e., either completely trust or distrust), we introduce a third assumption that sits in between: namely, “trust-but-verify”. Our solution enables a user to verify the correct implementation of two important operations inside a TPM without accessing its source code: i.e., the correct encryption of data and the faithful deletion of the key. Finally, we present a proof-of-concept implementation of the SSE system on a resource-constrained Java card to demonstrate its practical feasibility. To our knowledge, this is the first systematic solution to the secure data deletion problem based

on a “trust-but-verify” paradigm, together with a concrete prototype implementation.

Aim

The aim is to provide public verifiability for a secure data deletion system by adopting public key cryptography.

Scope

The scope is to present a concrete cryptographic solution, called Secure Storage and Erasure (SSE), which enables a user to verify the correct implementation of cryptographic operations inside a TPM without having to access its internal source code.

Existing system

Several Existing systems have recognized the importance of verifiability in the secure data deletion process which does not use any cryptography.

Disadvantages:

The deletion program performs data erasure and returns either success or failure. However, such a one bit- return protocol turns the data deletion system into a black box – the user has to trust the outcome but cannot easily verify it. This is especially problematic when the deletion program is encapsulated within a Trusted Platform Module (TPM), and the user has no access to the code inside.

Proposed system

Advantages

The main advantage is to enable a user to verify the correct implementation of two important operations inside a TPM without accessing its source code: i.e., the correct encryption of data and the faithful deletion of the key.

System architecture:

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System : Windows 7

· Front End : JSP AND SERVLET

· Database : MYSQL

· Tool :NETBEANS

REFERENCE:

Hao, F.,Clarke, D. ; Zorzo, A. “DELETING SECRET DATA WITH PUBLIC VERIFIABILITY” Dependable and Secure Computing, IEEE Transactions on (Volume:PP , Issue: 99 ) April 2015

Contributory Broadcast Encryption With Efficient Encryption And Short Cipher Texts

2015-10-19T23:55:00.003-07:00

ABSTRACT

Traditional broadcast encryption (BE) schemes allow a sender to securely broadcast to any subset of members but require a trusted party to distribute decryption keys. Group key agreement (GKA) protocols enable a group of members to negotiate a common encryption key via open networks so that only the group members can decrypt the cipher texts encrypted under the shared encryption key, but a sender cannot exclude any particular member from decrypting the cipher texts. In this paper, we bridge these two notions with a hybrid primitive referred to as contributory broadcast encryption (ConBE). In this new primitive, a group of members negotiate a common public encryption key while each member holds a decryption key. A sender seeing the public group encryption key can limit the decryption to a subset of members of his choice. Following this model, we propose a ConBE scheme with short ciphertexts. The scheme is proven to be fully collusion-resistant under the decision n-Bilinear Diffie-Hellman Exponentiation (BDHE) assumption in the standard model. Of independent interest, we present a new BE scheme that is aggregatable. The aggregatability property is shown to be useful to construct advanced protocols.

AIM

The aim of this paper is a group of members negotiate a common public encryption key while each member holds a decryption key. A sender seeing the public group encryption key can limit the decryption to a subset of members of his choice.

SCOPE:

The Scope of this Paper is proven to be fully collusion-resistant under the decision n-Bilinear Diffie-Hellman Exponentiation (BDHE) assumption in the standard model.

EXISTING SYSTEM

BE schemes in the literature can be classified into two categories, i.e., symmetric-key BE and public-key BE . In the symmetric-key setting, only the trusted center generates all the secret keys and broadcasts messages to users. Hence, only the key generation center can be the broadcaster or the sender. Similarly to the GKA setting, tree-based key structures were independently proposed to improve efficiency in symmetric-key BE systems and further improved in with O(log n) keys. Cheon et al.presented an efficient symmetric BE scheme allowing new members to join the protocol anytime. Harn and Lin proposed a group key transfer protocol. Their protocol is based on secret sharing and is considerably efficient, albeit it cannot revoke (compromised) users

DISADVANTAGES

Group key agreement (GKA) protocols enable a group of members to negotiate a common encryption key via open networks so that only the group members can decrypt the cipher texts encrypted under the shared encryption key but a sender cannot exclude any particular member from decrypting the cipher texts.
A BE system heavily relies on a fully trusted key server who generates secret decryption keys for the members and can read all the communications to any member

PROPOSED SYSTEM

In this paper, construct an efficient ConBE scheme with our AggBE scheme as a building block. The ConBE construction is proven to be semi-adaptively secure under the decision BDHE assumption in the standard model. Only one round is required to establish the public group encryption key and set up the ConBE system. After the system set-up, the storage cost of both the sender and the group members is O(n), where n is the number of group members participating in the setup stage. However, the online complexity (which dominates the practicality of a ConBE scheme) is very low. We also illustrate a trade-off between the set-up complexity and the online performance. After a trade-off, the variant has O(n2=3) complexity in communication, computation and storage. This is comparable to up-to-date regular BE schemes which have O(n1=2) complexity in the same performance metrics, but our scheme does not require a trusted key dealer. We conduct a series of experiments and the experimental results validate the practicality of our scheme.

ADVANTAGES

In ConBE, anyone can send secret messages to any subset of the group members, and the system does not require a trusted key server.
As a versatile cryptographic primitive, our novel ConBE notion opens a new avenue to establish secure broadcast channels and can be expected to secure numerous emerging distributed computation applications.

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System : Windows 7

· Front End : JSP AND SERVLET

· Database : MYSQL

· Tool :NETBEANS

REFERENCE

Wu, Q. Qin, B. Zhang, L. Domingo-Ferrer, J.“Contributory Broadcast Encryption With Efficient Encryption And Short Cipher Texts,” IEEE Transactions on Computers, Volume PP Issue 99, APRIL 2015.

CONTINUOUS AND TRANSPARENT USER IDENTITY VERIFICATION FOR SECURE INTERNET SERVICES

2015-10-19T23:52:00.000-07:00

ABSTRACT

Session management in distributed Internet services is traditionally based on username and password, explicit logouts and mechanisms of user session expiration using classic timeouts. Emerging biometric solutions allow substituting username and password with biometric data during session establishment, but in such an approach still a single verification is deemed sufficient, and the identity of a user is considered immutable during the entire session. Additionally, the length of the session timeout may impact on the usability of the service and consequent client satisfaction. This paper explores promising alternatives offered by applying biometrics in the management of sessions. A secure protocol is defined for perpetual authentication through continuous user verification. The protocol determines adaptive timeouts based on the quality, frequency and type of biometric data transparently acquired from the user. The functional behavior of the protocol is illustrated through Mat lab simulations, while model-based quantitative analysis is carried out to assess the ability of the protocol to contrast security attacks exercised by different kinds of attackers. Finally, the current prototype for PCs and Android smart phones is discussed.

AIM

The aim of this paper is explores promising alternatives offered by applying biometrics in the management of sessions. A secure protocol is defined for perpetual authentication through continuous user verification.

SCOPE:

The Scope of this paper is tends to protocol determines adaptive timeouts based on the quality, frequency and type of biometric data transparently acquired from the user.

EXISTING SYSTEM

To timely detect misuses of computer resources and prevent that an unauthorized user maliciously replaces an authorized one, solutions based on multi-modal biometric continuous authentication are proposed, turning user verification into a continuous process rather than a onetime occurrence . To avoid that a single biometric trait is forged, biometrics authentication can rely on multiple biometrics traits. Finally, the use of biometric authentication allows credentials to be acquired transparently, i.e. without explicitly notifying the user or requiring his/her interaction, which is essential to guarantee better service usability. We present some examples of transparent acquisition of biometric data. Face can be acquired while the user is located in front of the camera, but not purposely for the acquisition of the biometric data; e.g., the user may be reading a textual SMS or watching a movie on the mobile phone. Voice can be acquired when the user speaks on the phone or with other people nearby if the microphone always captures background. Key-stroke data can be acquired whenever the user types on the keyboard, for example when writing an SMS, chat-ting, or browsing on the Internet.

DISADVANTAGES

In such an approach still a single verification is deemed sufficient, and the identity of a user is considered immutable during the entire session
The length of the session timeout may impact on the usability of the service and consequent client satisfaction.

PROPOSED SYSTEM

This paper a new approach for user verification and session management that is applied in the CASHMA (Context Aware Security by Hierarchical Multilevel Architectures) system for secure bi-metrics authentication on the Internet. CASHMA is able to operate securely with any kind of web service, including services with high security demands as online banking services, and it is intended to be used from different client devices e.g., smart phones, Desktop PCs or even biometric kiosks placed at the entrance of secure areas. De-pending on the preferences and requirements of the owner of the web service, the CASHMA authentication ser-vice can complement a traditional authentication service, or can replace it. CASHMA for usable and highly secure user sessions is a continuous sequential (a single biometric modality at once is presented to the system multi-modal biometric authentication protocol, which adaptively computes and refreshes session timeouts on the basis of the trust put in the client. Such global trust is evaluated as a numeric value, computed by continuously evaluating the trust both in the user and the (biometric) subsystems used for acquiring biometric data.

ADVANTAGES

The novel possibility introduced by biometrics to define a protocol for continuous authentication that improves security and usability of user session. Avoidance of (complex) homomorphic (or any type of public-key) encryption of the multimedia content.
When data is acquired in an uncontrolled environment, the quality of biometric data could strongly depend on the surroundings.

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System : Windows 7

· Front End : JSP AND SERVLET

· Database : MYSQL

· Tool :NETBEANS

REFERENCE

Montecchi, L. , Brancati, F. ,Lollini, P. Ceccarelli, A.,“ Continuous and Transparent User Identity Verification for Secure Internet Services,” IEEE Transactions on Dependable and Secure Computing, Volume 12 Issue 3 , January 2014.

Between Worlds: Securing Mixed JavaScript/Action script Multi-Party Web Content

2015-10-19T23:43:00.002-07:00

ABSTRACT

Mixed Flash and JavaScript content has become increasingly prevalent; its purveyance of dynamic features unique to each platform has popularized it for myriad web development projects. Although Flash and JavaScript security has been examined extensively, the security of untrusted content that combines both has received considerably less attention. This article considers this fusion in detail, outlining several practical scenarios that threaten the security of web applications. The severity of these attacks warrants the development of new techniques that address the security of Flash-JavaScript content considered as a whole, in contrast to prior solutions that have examined Flash or JavaScript security individually. Toward this end, the article presents Flash JaX , a cross-platform solution that enforces fine-grained, history-based policies that span both Flash and JavaScript. Using in-lined reference monitoring, FlashJaX safely embeds untrusted JavaScript and Flash content in web pages without modifying browser clients or using special plug-ins. The architecture of FlashJaX, its design and implementation, and a detailed security analysis are exposited. Experiments with advertisements from popular ad networks demonstrate that FlashJaX is transparent to policy-compliant advertisement content, yet blocks many common attack vectors that exploit the fusion of these web platforms.

AIM

The aim of this paper is Flash JaX , a cross-platform solution that enforces fine-grained, history-based policies that span both Flash and JavaScript.

SCOPE

The scope of this paper is to demonstrate that Flash JaX is transparent to policy-compliant advertisement content, yet blocks many common attack vectors that exploit the fusion of these web platforms.

EXISTING SYSTEM

Meanwhile, the abuse of mixed AS-JS content for malicious campaigns constitutes a significant rising threat for content currently in circulation. For example, a Gmail vulnerability allowed attackers to steal sessions by exploiting the AS-JS interface. A Word Press attack exploits vulnerable AS-to-JS interface calls. A recent study found that 64 of over 1000 top sites contain Flash applications vulnerable to JS XSS attacks . (Our evaluation discusses other real-world attacks). A deeper examination of these attacks reveals that any defense against attacks arising from AS-JS interactions must adopt a holistic view of the security-relevant events on both platforms. Prior work developed for JS or Flash has not been designed with this holistic perspective, and therefore does not satisfactorily address security issues arising from mixed AS-JS content. The problem of preventing malicious behaviors that exploit combined AS-JS technologies has therefore remained open

DISADVANTAGES

The security of untrusted content that combines both has received considerably less attention
Major concerns include confidentiality of private client data (e.g., cookies), integrity of host- and user-owned content, and availability of hosting site services

PROPOSED SYSTEM

In this paper, FlashJaX affords publishers a fine-grained mechanism to safely embed untrusted JS and AS content in their web pages. To avoid modifying the client browser or VMs (which would introduce significant deployment barriers), we adopt an in-lined reference monitoring approach. In-lined Reference Monitors (IRMs) modify untrusted code to enforce security policies from the inside. The resulting code is self monitoring, and can therefore be safely executed on standard browsers and VMs without additional client-side monitoring. FlashJaX’s IRM consists of JS and AS code introduced by the embedding page. The IRM mediates security-relevant events exhibited on the client, permitting or denying them based on a provider-specified policy. A native design implements separate IRMs for JS and AS; however, this approach has many drawbacks. To enforce policies involving a global event history, separate IRMs must ensure that their security states are synchronized at every decision point.To avoid this, FlashJaX centralizes security state-tracking to the JS half of the IRM, and implements an AS side that shifts the significant policy decisions to the JS side. This is efficient because most security-relevant AS events include AS-JS communication as a sub-component; the IRM therefore couples its AS-JS communications atop these existing ones to avoid unnecessary context-switches

ADVANTAGES

It is also compatible with advertisements from leading ad networks.
FlashJaX is effective in preventing attacks related to AS-JS communication, and its lightweight IRM approach exhibits low overhead for mediations.

SYSTEM ARCHITECTURE:-

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System : Windows 7

· Front End : JSP AND SERVLET

· Database : MYSQL

· Tool :NETBEANS

REFERENCE

Monshizadeh, M. ; Sridhar, M. ; Hamlen, K.W.. Khan “Between Worlds: Securing Mixed JavaScript/Action script Multi-Party Web Content,” IEEE Transactions on Dependable and Secure Computing, Volume 12, Issue 4 September 2014.

A Trust-based Privacy-Preserving Friend Recommendation Scheme for Online Social Networks

2015-10-19T23:38:00.002-07:00

ABSTRACT

Online Social Networks (OSNs), which attract thousands of million people to use everyday, greatly extend OSN users’ social circles by friend recommendations. OSN users’ existing social relationship can be characterized as 1-hop trust relationship, and further establish a multi-hop trust chain during the recommendation process. As the same as what people usually experience in the daily life, the social relationship in cyberspaces are potentially formed by OSN users’ shared attributes, e.g., colleagues, family members, or classmates, which indicates the attribute-based recommendation process would lead to more fine-grained social relationships between strangers. Unfortunately, privacy concerns raised in the recommendation process impede the expansion of OSN users’ friend circle. Some OSN users refuse to disclose their identities and their friends’ information to the public domain. In this paper, we propose a trust based privacy-preserving friend recommendation scheme for OSNs, where OSN users apply their attributes to find matched friends, and establish social relationships with strangers via a multi-hop trust chain. Based on trace-driven experimental results and security analysis,we have shown the feasibility and privacy preservation of our proposed scheme.

AIM

The aim of this paper is OSN users apply their attributes to find matched friends, and establish social relationships with strangers via a multi-hop trust chain

SCOPE:

The Scope of this Paper is to trace-driven experimental results and security analysis, we have shown the feasibility and privacy preservation of our Trust Based Privacy Preserving Friend Recommendation Scheme.

EXISTING SYSTEM

On the one hand, directly asking recommendations to strangers or a non close friend not only reveals Alice’s identity, but also reveals her health condition and medical information. Even worse, traditional recommendation approaches applying identity to recommend strangers will disclose OSN users’ social relationships to the public, which impede patients from utilizing it, and also decrease the possibility of establishing the multi-hop trust chain if one of OSN users on the chain returns a negative result. On the other hand, current approaches cannot achieve the fine-grained and context-aware results automatically, due to the fact that OSN users have to determine the recommended friends based on their own judgments on the recommendation query. As in our example, Alice would like to ask for help from her friends who work in a hospital, but not a truck driver. To overcome the above issue, we consider the possibility of singsong users’ social attributes to establish the multi-hop trust chain based on each context-aware 1-hop trust relationship, where most of trust relationships are formed and strengthened by the shared social attributes.

DISADVANTAGES

Privacy concerns raised in the recommendation process impede the expansion of OSN users’ friend circle
Some OSN users refuse to disclose their identities and their friend’s information to the public domain.

PROPOSED SYSTEM

In this paper, design a light-weighted privacy-preserving friend recommendation scheme for OSNs by utilizing both users’ social attributes and their existing trust relationships to establish a multi-hop trust chain between strangers. In our scheme, we jointly consider privacy leakages and preservation approaches regarding the identity, social attributes, and their trust relationships of OSN users during the recommendation process. By trace-driven experimental results, we demonstrate both the security and efficiency of our proposed scheme

ADVANTAGES

Based on the 1-hop trust relationships, we extend existing friendships to multi-hop trust chains without compromising recommenders identity privacy
Extensive trace-driven experiment are deployed to verify the performance of our scheme in terms of security, efficiency, and feasibility.

SYSTEM ARCHITECTURE

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System : Windows 7

· Front End : JSP AND SERVLET

· Database : MYSQL

· Tool :NETBEANS

REFERENCE

Zhang, C Fang, Y.Guo, L.“ A Trust-based Privacy-Preserving Friend Recommendation Scheme for Online Social Networks,” IEEE Transactions on Dependable and Secure Computing, Volume 12 , Issue 4 , SEPTEMBER 2014.

A Computational Dynamic Trust Model for User Authorization

2015-10-19T23:35:00.001-07:00

Abstract

Development of authorization mechanisms for secure information access by a large community of users in an open environment is an important problem in the ever-growing Internet world. In this paper we propose a computational dynamic trust model for user authorization, rooted in findings from social science. Unlike most existing computational trust models, this model distinguishes trusting belief in integrity from that in competence in different contexts and accounts for subjectivity in the evaluation of a particular trustee by different trusters. Simulation studies were conducted to compare the performance of the proposed integrity belief model with other trust models from the literature for different user behavior patterns. Experiments show that the proposed model achieves higher performance than other models especially in predicting the behavior of unstable users.

Aim

The main aim is to compute dynamic trust model for user authorization to secure information access by a large community of users in an open environment in the ever-growing Internet world.

Scope:

The scope is to enable automated trust management that mimics trusting behaviors, trusting belief in integrity from that in competence

Existing System

Social trust model defines five conceptual trust types:

1) trusting behavior,

2) trusting intention,

3) trusting belief,

4) institution-based trust,

5) disposition to trust.

Trusting behavior is an action that increases a truster's risk or makes the truster vulnerable to the trustee.

Trusting intention indicates that a truster is willing to engage in trusting behaviors with the trustee.

Trusting belief is a truster's subjective belief in the fact that a trustee has attributes beneficial to the truster. The following are the four attributes used most often: Competence, Benevolence, Integrity, Predictability

Institution-based trust is the belief that proper structural conditions are in place to enhance the probability of achieving a successful outcome.

Two subtypes of institution- based trust are:

1. Structural assurance 2. Situational normality.

Disposition to trust characterizes a truster's general propensity to depend on others across a broad spectrum of situations. Two subtypes of disposition to trust are: 1. Faith in human 2. Trusting stance

Trust intention and trusting belief are situation and trustee specific. Institution-based trust is situation specific. Disposition to trust is independent of situation and trustee. Trusting belief positively relates to trusting intention, which in turn results in the trusting behavior. Institution- based trust positively affects trusting belief and trusting intention. Structural assurance is more related to trusting intention while situational normality affects both. Disposition to trust positively influences institution-based trust, trusting belief and trusting intention. Faith in humanity impacts trusting belief. Trusting stance influences trusting intention.

The existing approaches are to extract reputation from the social network topology that encodes reputation information, for social networks, based on the concept of feedback centrality, for access control in P2P networks, based on the assumption of transitivity of trust in social networks, where a simple mathematical model based on fuzzy set membership is used to calculate the trustworthiness of each node in a trust graph symbolizing interactions between network nodes, for nodes in a P2P network, based on the history of interactions between nodes.

Disadvantages

Although the existing approaches integrate context into trust computation, their application is limited to specific domains.

Proposed System

In this paper we propose a computational dynamic trust model for user authorization, rooted in findings from social science. This model distinguishes trusting belief in integrity from that in competence in different contexts and accounts for subjectivity in the evaluation of a particular trustee by different trusters. The proposed model accounts for different types of trust. Specifically, it distinguishes trusting belief in integrity from that in competence. The model takes into account the subjectivity of trust ratings by different entities, and introduces a mechanism to eliminate the impact of subjectivity in reputation aggregation.

Advantages

The model evaluates trust separately for each property of each component of a platform.The proposed dynamic trust model enables automated trust management that mimics trusting behaviors in society, such as selecting a corporate partner, forming a coalition, or choosing negotiation protocols or strategies in e-commerce. The formalization of trust helps in designing algorithms to choose reliable resources in peer-to-peer systems, developing secure protocols for ad hoc networks and detecting deceptive agents in a virtual community. Experiments in a simulated trust environment show that the proposed integrity trust model performs better than other major trust models in predicting the behavior of users whose actions change based on certain patterns over time.

System Architecture

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System : Windows 7

· Front End : JSP AND SERVLET

· Database : MYSQL

· Tool :NETBEANS

References

Bhargava, B, Yi Lu, Angin, P. “A COMPUTATIONAL DYNAMIC TRUST MODEL FOR USER AUTHORIZATION” Dependable and Secure Computing, IEEE Transactions on (Volume:12 , Issue: 1 ) February 2014.

SECURE DISTRIBUTED DEDUPLICATION SYSTEMS WITH IMPROVED RELIABILITY

2015-10-19T23:31:00.003-07:00

ABSTRACT:

Data deduplication is a technique for eliminating duplicate copies of data, and has been widely used in cloud storage to reduce storage space and upload bandwidth. However, there is only one copy for each file stored in cloud even if such a file is owned by a huge number of users. As a result, deduplication system improves storage utilization while reducing reliability. Furthermore, the challenge of privacy for sensitive data also arises when they are outsourced by users to cloud. Aiming to address the above security challenges, this paper makes the first attempt to formalize the notion of distributed reliable deduplication system. We propose new distributed deduplication systems with higher reliability in which the data chunks are distributed across multiple cloud servers. The security requirements of data confidentiality and tag consistency are also achieved by introducing a deterministic secret sharing scheme in distributed storage systems, instead of using convergent encryption as in previous deduplication systems. Security analysis demonstrates that our deduplication systems are secure in terms of the definitions specified in the proposed security model. As a proof of concept, we implement the proposed systems and demonstrate that the incurred overhead is very limited in realistic environments

AIM

The main goal is to enable deduplication and distributed storage of the data across multiple storage servers.

SCOPE

Data deduplication techniques are widely employed to backup data and minimize network and storage overhead by detecting and eliminating redundancy among data

SYNOPSIS

A number of deduplication systems have been proposed based on various deduplication strategies such as client-side or server-side deduplication, file-level or block-level deduplication. Especially, with the advent of cloud storage, data deduplication techniques become more attractive and critical for the management of ever-increasing volumes of data in cloud storage services which motivates enterprises and organizations to outsource data storage to third-party cloud providers, as evidenced by many real-life case studies. According to the analysis report of IDC, the volume of data in the world is expected to reach 40 trillion gigabytes in 2020 [ Today’s commercial cloud storage services, such as Drop box, Google Drive and Mozy, have been applying deduplication to save the network bandwidth and the storage cost with client-side deduplication.

EXISTING SYSTEM

The challenge for data privacy also arises as more and more sensitive data are being outsourced by users to cloud. Encryption mechanisms have usually been utilized to protect the confidentiality before outsourcing data into cloud. Most commercial storage service provider are reluctant to apply encryption over the data because it makes deduplication impossible. The reason is that the traditional encryption mechanisms, including public key encryption and symmetric key encryption, require different users to encrypt their data with their own keys. As a result, identical data copies of different users will lead to different cipher texts.

DISADVANTAGES:

To work on secure deduplication can properly address the reliability and tag consistency problem in distributed storage systems
To protect both confidentiality and reliability while achieving deduplication in a cloud storage system is still a challenge.

PROPOSED SYSTEM

Four new secure deduplication systems are proposed to provide efficient deduplication with high reliability for file-level and block-level deduplication, respectively. The secret splitting technique, instead of traditional encryption methods, is utilized to protect data confidentiality. Specifically, data are split into fragments by using secure secret sharing schemes and stored at different servers. Our proposed constructions support both file-level and block-level deduplication Security analysis demonstrates that the proposed deduplication systems are secure in terms of the definitions specified in the proposed security model. In more details, confidentiality, reliability and integrity can be achieved in our proposed system. Two kinds of collusion attacks are considered in our solutions. These are the collusion attack on the data and the collusion attack against servers. In particular, the data remains secure even if the adversary controls a limited number of storage servers. We implement our deduplication systems using the Ramp secret sharing scheme that enables high reliability and confidentiality levels. Our evaluation results demonstrate that the new proposed constructions are efficient and the redundancies are optimized and comparable with the other storage system supporting the same level of reliability

ADVANTAGES

To protect data confidentiality, the secret sharing technique is utilized, which is also compatible with the distributed storage systems
To improve the reliability of data while achieving the confidentiality of the users’ outsourced data without an encryption mechanism.

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System : Windows 7

· Front End : JSP AND SERVLET

· Database : MYSQL

· Tool :NETBEANS

REFERENCE:

Chen, X. ; Huang, X. ; Tang, S. “SECURE DISTRIBUTED DEDUPLICATION SYSTEMS WITH IMPROVED RELIABILITY” IEEE Transactions on Computers, VOL PP, ISS 99,FEBRUARY 2015.

Good put-Aware Load Distribution For Real-Time Traffic Over Multipath Networks

2015-10-19T23:27:00.003-07:00

ABSTRACT:

Load distribution is a key research issue in deploying the limited network resources available to support traffic transmissions. Developing an effective solution is critical for enhancing traffic performance and network utilization. In this paper, we investigate the problem of load distribution for real-time traffic over multipath networks. Due to the path diversity and unreliability in heterogeneous overlay networks, large end-to-end delay and consecutive packet losses can significantly degrade the traffic flow’s good put, whereas existing studies mainly focus on the delay or throughput performance. To address the challenging problems, we propose a Good put- Aware Load distribution (GALTON) model that includes three phases: (1) path status estimation to accurately sense the quality of each transport link, (2) flow rate assignment to optimize the aggregate good put of input traffic, and (3) deadline-constrained packet interleaving to mitigate consecutive losses. We present a mathematical formulation for multipath load distribution and derive the solution based on utility theory. The performance of the proposed model is evaluated through semi-physical emulations in Exacta involving both real Internet traffic traces and H.264 video streaming. Experimental results show that GALTON outperforms existing traffic distribution models in terms of good put, video PSNR (Peak Signal-to-Noise Ratio), end-to-end delay, and aggregate loss rate.

AIM

The aim of this paper is to investigate the problem of load distribution for real-time traffic over multipath networks.

SCOPE

GALTON outperforms existing traffic distribution models in terms of good put, video PSNR (Peak Signal-to-Noise Ratio), end-to-end delay, and aggregate loss rate.

EXISTING SYSTEM

The key research issue in utilizing the available paths between multi homed communication terminals is to effectively distribute input traffic load for providing adequate QoS perceived by end users Indeed, inefficient load distribution can significantly degrade the traffic performance and network utilization, e.g., load imbalance, packet reordering, large end-to-end delay, etc. Therefore, many algorithms have been proposed to optimize the delay or throughput performance. However, these network-level criteria cannot properly indicate the benefits of upper-layer applications. For instance, a live streaming video application cannot effectively leverage the throughput gains since its streaming rate is typically fixed or bounded by the encoding schemes. Furthermore, the increased throughput may lead to larger end-to-end delays, which in turn induce video quality degradation. Consequently, the load distribution of real-time traffic to achieve excellent QoS still remains problematic

DISADVANTAGES:

Load distribution is a key research issue in deploying the limited network resources available to support traffic transmissions
Due to the path diversity and unreliability in heterogeneous overlay networks, large end-to-end delay and consecutive packet losses can significantly degrade the traffic flow’s good put, whereas existing studies mainly focus on the delay or throughput performance

PROPOSED SYSTEM

In this paper to be propose a Good put- Aware Load distribution (GALTON) model that includes three phases: (1) path status estimation

to accurately sense the quality of each transport link, (2) flow rate assignment to optimize the aggregate good put of input traffic, and

(3) deadline-constrained packet interleaving to mitigate consecutive losses. We present a mathematical formulation for multipath load distribution and derive the solution based on utility theory. The performance of the proposed model is evaluated through semi-physical emulations in Exata involving both real Internet traffic traces and H.264 video streaming. Experimental results show that GALTON outperforms existing traffic distribution models in terms of good put, video PSNR (Peak Signal-to-Noise Ratio), end-to-end delay, and aggregate loss rate.

ADVANTAGES

To optimize the good put performance of real-time traffic over multipath networks
To optimize the delay or throughput performance.

SYSTEM ARCHITECTURE:

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

· Speed - 1.1 Ghz

· RAM - 256 MB(min)

· Hard Disk - 20 GB

· Floppy Drive - 1.44 MB

· Key Board - Standard Windows Keyboard

· Mouse - Two or Three Button Mouse

· Monitor - SVGA

SOFTWARE REQUIREMENTS:-

· Operating System : Windows 7

· Front End : JSP AND SERVLET

· Database : MYSQL

· Tool :NETBEANS

REFERENCE:

Cheng, B. Shang, Y. Yuen, C. Wu, J “Good put-Aware Load Distribution for Real-time Traffic over Multipath Networks”, IEEE Transactions on Parallel and Distributed Systems, Volume 26 Issue 8, AUGUST 2014.

IEEE projects 2015 for CSE/IT in coimbatore,ieee 2015 project list, BULK IEEE projects at low cost

Inplant Training in coimbatore for CSE/IT/ECE/EEE

The Impact of API Change- And Fault-Proneness on the User Ratings of Android Apps

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

A Location- And Diversity-Aware News Feed System for Mobile Users

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

Vulhunter: Toward Discovering Vulnerabilities In Android Applications

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

REAL: A RECIPROCAL PROTOCOL FOR LOCATION PRIVACY IN WIRELESS SENSOR NETWORKS

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

CONTEXT-BASED ACCESS CONTROL SYSTEMS FOR MOBILE DEVICES

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

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

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

User-Defined Privacy Grid System for Continuous Location-Based Services

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

User Privacy and Data Trustworthiness in Mobile Crowd Sensing

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

Smart Photo: A Resource-Aware Crowd Sourcing Approach for Image Sensing With Smart Phones

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

SBVLC: Secure Barcode-Based Visible Light Communication For Smartphone’s

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

ALTERDROID: Differential Fault Analysis of Obfuscated Smartphone Malware

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

Discovery of Ranking Fraud for Mobile Apps

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

Smartphone-Based Wound Assessment System For Patients With Diabetes

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

My Privacy My Decision: Control Of Photo Sharing On Online Social Networks

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

Key-Recovery Attacks On Kids, A Keyed Anomaly Detection System

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

Improved Privacy-Preserving P2p Multimedia Distribution Based On Recombined Fingerprints

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

Deleting Secret Data with Public Verifiability

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

Contributory Broadcast Encryption With Efficient Encryption And Short Cipher Texts

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

CONTINUOUS AND TRANSPARENT USER IDENTITY VERIFICATION FOR SECURE INTERNET SERVICES

HARDWARE REQUIREMENTS:-

· Processor - Pentium –III

SOFTWARE REQUIREMENTS:-

Between Worlds: Securing Mixed JavaScript/Action script Multi-Party Web Content

It is also compatible with advertisements from leading ad networks.