http://WWW.FINALYEARPROJECTS.NET
http://WWW.FINALYEARPROJECTS.NET

Checking delivery availability...

background-sm
Search
3

Updates found with 'help'

Page  1 1

Updates found with 'help'

ANDROID PROJECT ABSTRACT 2016-2017 UNDERSTANDING SMARTPHONE SENSOR AND APP DATA FOR ENHANCING THE SECURITY OF SECRET QUESTIONS ABSTRACT:Many web applications provide secondary authentication methods, i.e., secret questions (or password recovery questions), to reset the account password when a user’s login fails. However, the answers to many such secret questions can be easily guessed by an acquaintance or exposed to a stranger that has access to public online tools (e.g., online social networks); moreover, a user may forget her/his answers long after creating the secret questions. Today’s prevalence of smartphones has granted us new opportunities to observe and understand how the personal data collected by smartphone sensors and appscan help create personalized secret questions without violating the users’ privacy concerns. In this paper, we present a Secret-Question based Authentication system, called “Secret-QA”, that creates a set of secret questions on basic of people’s smartphone usage. We develop a prototype on Android smartphones, and evaluate the security of the secret questions by asking the acquaintance/stranger who participate in our user study to guess the answers with and without the help of online tools; meanwhile, we observe the questions’ reliability by asking participants to answer their own questions. Our experimental results reveal that the secret questions related to motion sensors, calendar, app installment, and part of legacy appease history (e.g., phone calls) have the best memorability for users as well as the highest robustness to attacks.
Send Enquiry
Read More
JAVA PROJECTS ABSTRACT 2016-2017 A CLOUD-BASED SMART-PARKING SYSTEM BASED ON INTERNET-OF-THINGS TECHNOLOGIES ABSTRACT: This paper introduces a novel algorithm that increases the efficiency of the current cloud-based smart-parking system and develops a network architecture based on the Internet-of-Things technology. This paper proposed a system that helps users automatically find a free parking space at the least cost based on new performance metrics to calculate the user parking cost by considering the distance and the total number of free places in each car park. This cost will be used to offer a solution of finding an available parking spaceupon a request by the user and a solution of suggesting a new car park if the current car park is full. The simulation results show that the algorithm helps improve the probability of successful parking and minimizes the user waiting time. We also successfully implemented the proposed system in the real world.Existing System: The current intelligent parking system does not provide an overall optimal solution in finding an available parking space, does not solve the problem of load balancing, does not provide economic benefit, and does not plan for vehicle-refusal service.Proposed System: To resolve the aforementioned problems and take advantage of the significant development in technology, the Internet-of-Things technology (IoT) has created a revolution in many fields in life as well as in smart-parking system (SPS) technology . The present study proposes and developsan effective cloud-based SPS solution based on the Internet of Things. Our system constructs each car park as an IoT network, distance between car parking areas and number of free slots in car park areas will be transferred to the data center.Conclusion: This study has proposed a parking system that improves performance by reducing the number of users that fail to find a parking space and minimizes the costs of moving to the parking space. Our proposed architecture and system has been successfully simulated and implemented in a real situation. The results show that our algorithm significantly reduces the average waiting time of users for parking. Our results closely agree with those of our proposed mathematical models. The simulation of our system achieved the optimal solution when most of the vehicles successfully found a free parking space. The average waiting time of each car park for service becomes minimal, and the total time of each vehicle in each car park is reduced. In our future study, we will consider the security aspects of our system as well as implement our proposed system in large scales in the real world.
Send Enquiry
Read More
JAVA /DOT NET PROJECT ABSTRACT 2016-2017 MITIGATING CROSS-SITE SCRIPTING ATTACKS WITH A CONTENT SECURITY POLICY ABSTRACT: A content security policy (CSP) can help Web application developers and server administrators better control website content and avoid vulnerabilities to cross site scripting (XSS). In experiments with a prototype website, the authors’ CSP implementation successfully mitigated all XSS attack types in four popular browsers. Among the many attacks on Web applications, cross site scripting (XSS) is one of the most common. An XSS attack involves injecting malicious script into a trusted website that executes on a visitor’s browser without the visitor’s knowledge and thereby enables the attacker to access sensitive user data, such as session tokens and cookies stored on the browser.1 With this data, attackers can execute several malicious acts, including identity theft, key logging, phishing, user impersonation, and webcam activation. Content Security Policy (CSP) is an added layer of security that helps to detect and mitigate certain types of attacks, including Cross Site Scripting (XSS) and data injection attacks. These attacks are used for everything from data theft to site defacement or distribution of malware. CSP is designed to be fully backward compatible; browsers that don't support it still work with servers that implement it, and vice-versa. Browsers that don't support CSP simply ignore it, functioning as usual, defaulting to the standard same-origin policy for web content. If the site doesn't offer the CSP header, browsers likewise use the standard same-origin policy.Enabling CSP is as easy as configuring your web server to return the Content-Security-Policy HTTP header. (Prior to Firefox 23, the X-Content-Security-Policy header was used). See Using Content Security Policy for details on how to configure and enable CSP.INTRODUCTION A primary goal of CSP is to mitigate and report XSS attacks. XSS attacks exploit the browser's trust of the content received from the server. Malicious scripts are executed by the victim's browser because the browser trusts the source of the content, even when it's not coming from where it seems to be coming from. CSP makes it possible for server administrators to reduce or eliminate the vectors by which XSS can occur by specifying the domains that the browser should consider to be valid sources of executable scripts. A CSP compatible browser will then only execute scripts loaded in source files received from those whitelisted domains, ignoring all other script (including inline scripts and event-handling HTML attributes).PROPOSED SYSTEM: A client-side tool that acts as a Web proxy, disallows requests that do not belong to the website and thus thwarts stored XSS attacks. Browser-enforced embedded policies (BEEPs) let the Web application developer embed a policy in the website by specifying which scripts are allowed to run.With a BEEP, the developer can put genuine source scripts in a white list and disable source scripts in certain website regions. Document Structure Integrity (DSI) is a client-server architecture that restricts the interpretation of untrusted content. DSI uses parser-level isolation to isolate inline untrusted data and separates dynamic content from static content. However, this approach requires both servers and clients to cooperatively upgrade to enable protection.System ConfigurationH/W System Configuration:Processor - Pentium –IIISpeed - 1.1 GhzRAM - 256 MB(min)Hard Disk - 20 GBFloppy Drive - 1.44 MBKey Board - Standard Windows KeyboardMouse - Two or Three Button MouseMonitor - SVGAS/W System Configuration: Operating System :Windows95/98/2000/XP  Application Server : Tomcat5.0/6.X  Front End : HTML, Java, Jsp Scripts : JavaScript. Server side Script : Java Server Pages. Database : Mysql Database Connectivity : JDBC.CONCLUSION: Although our CSP has many benefits, it is not intended as a primary defense mechanism against XSS attacks. Rather, it would best serve as a defensein- depth mitigation mechanism. A primary defense involves tailored security schemes that validate user inputs and encode user outputs.Cross site scripting has been a major threat for web applications and its users from past few years. Lot of work has been done to handle XSS attacks which include: • Client side approaches• Server side approaches• Testing based approaches• Static and dynamic analysis based approaches
Send Enquiry
Read More
VLSI PROJECTS ABSTRACT 2016 -2017LOW-POWER SYSTEMS FOR DETECTION OF SYMPTOMATIC PATTERNS IN AUDIO BIOLOGICAL SIGNALSABSTRACT: In this paper, we present a low-power, efficacious, and scalable system for the detection of symptomatic patterns in biological audio signals. The digital audio recordings of various symptoms, such as cough, sneeze, and so on, are spectrally analyzed using a discrete wavelet transform. Subsequently, we use simple mathematical metrics, such as energy, quasi-average, and coastline parameter for various wavelet coefficients of interest depending on the type of pattern to be detected. Furthermore, a mel-frequency cepstrum-based analysis is applied to distinguish between signals, such as cough and sneeze, which have a similar frequency response and, hence, occur in common wavelet coefficients. Algorithm-circuit codesign methodology is utilized in order to optimize the system at algorithm and circuit levels of design abstraction. This helps in implementing a low-power system as well as maintaining the efficacy of detection. The system is scalable in terms of user specificity as well as the type of signal to be analyzed for an audio symptomatic pattern. We utilize multiplierless implementation circuit strategies and the algorithmic modification of mel cepstrum computation to implement low power system in the 65-nm bulk Si technology. It is observed that the pattern detection system achieves about 90% correct classification of five types of audio health symptoms. We also scale the supply voltage due to lower frequency of operation and report a total power consumption of ~184 µW at 700 mV supply.
Send Enquiry
Read More
JAVA PROJECTS ABSTRACT 2016-2017 A LOCALITY SENSITIVE LOW-RANK MODEL FOR IMAGE TAG COMPLETION ABSTRACT: Tag-based image retrieval often used to increase performance to retrieving images with the help of search engines. Image retrieval based on user-provided image tags on the photo sharing websites. A requirement for effective searching and retrieval of images in rapid growing online image databases is that each image has accurate and useful annotation. Many visual applications have benefited from the outburst of web images, yet the imprecise and incomplete tags arbitrarily provided by users. In this paper, we propose a novel locality sensitive low-rank model for image tag completion, which approximates the global nonlinear model with a collection of local linear models. To effectively infuse the idea of locality sensitivity, a simple and effective pre-processing module is designed to learn suitable representation for data partition.In thi paper they used for BIRCH algorithm. BIRCH (balanced iterative reducing and clustering using hierarchies) is an unsupervised data mining algorithm used to perform hierarchical clustering over particularly large data-sets.An advantage of BIRCH is its ability to incrementally and dynamically cluster incoming, multi-dimensional metric data points in an attempt to produce the best quality clustering for a given set of resources (memory and time constraints). In most cases, BIRCH only requires a single scan of the database.Existing SystemThe user-labeled visual data, such as images which are uploaded and shared in Flickr, are usually associated with imprecise and incomplete tags. This will pose threats to the retrieval or indexing of these images, causing them difficult to be accessed by users. Unfortunately, missing label is inevitable in the manual labeling phase, since it is infeasible for users to label every related word and avoid all possible confusions, due to the existence of synonyms and user preference. Therefore, image tag completion or refinement has emerged as a hot issue in the multimedia community.Many visual applications have benefited from the outburst of web images, yet the imprecise and incomplete tags arbitrarily provided by users, as the thorn of the rose, may hamper the performance of retrieval or indexing systems relying on such data.Proposed SystemTo effectively infuse the idea of locality sensitivity, a simple and effective pre-processing module is designed to learn suitable representation for data partition, and a global consensus regularizer is introduced to mitigate the risk of overfitting. Meanwhile, low-rank matrix factorization is employed as local models, where the local geometry structures are preserved for the low-dimensional representation of both tags and samples. Extensive empirical evaluations conducted on three datasets demonstrate the effectiveness and efficiency of the proposed method, where our method outperforms pervious ones by a large margin.Advantages• We propose a locality sensitive low-rank model for image tag completion, which approximates the global nonlinear model with a collection of local linear models, by which complex correlation structures can be captured. • Several adaptations are introduced to enable the fusion of locality sensitivity and low-rank factorization, including a simple and effective pre-processing module and a global consensus regularizer to mitigate the risk of overfitting.Disadvantages• image tag completion or refinement has emerged as a hot issue in the multimedia community.• The existing completion methods are usually founded on linear assumptions, hence the obtained models are limited due to their incapability to capture complex correlation patterns.System RequirementsH/W System Configuration:-Processor - Pentium –IIISpeed - 1.1 GhzRAM - 256 MB(min)Hard Disk - 20 GBKey Board - Standard Windows KeyboardMouse - Two or Three Button MouseMonitor - SVGA S/W System Configuration Operating System :Windows95/98/2000/XP  Application Server : Tomcat5.0/6.X  Front End : HTML, Java, Jsp Scripts : JavaScript. Server side Script : Java Server Pages. Database Connectivity : Mysql.Conclusion In this paper we propose a locality sensitive low-rank model for image tag completion. The proposed method can capture complex correlations by approximating a nonlinear model with a collection of local linear models. To effectively integrate locality sensitivity and low-rank factorization, several adaptations are introduced, including the design of a pre-processing module and a global consensus regularizer. Our method achieves superior results on three datasets and outperforms pervious methods by a large margin.
Send Enquiry
Read More
JAVA PROJECTS ABSTRACT 2016-2017 ENABLING CLOUD STORAGE AUDITING WITH VERIFIABLE OUTSOURCING OF KEY UPDATES ABSTRACT: Key-exposure resistance has always been an important issue for in-depth cyber defence in many security applications. Recently, how to deal with the key exposure problem in the settings of cloud storage auditing has been proposed and studied. To address the challenge, existing solutions all require the client to update his secret keys in every time period, which may inevitably bring in new local burdens to the client, especially those with limited computation resources such as mobile phones. In this paper, we focus on how to make the key updates as transparent as possible for the client and propose a new paradigm called cloud storage auditing with verifiable outsourcing of key updates. In this paradigm, key updates can be safely outsourced to some authorized party, and thus the key-update burden on the client will be kept minimal. Specifically, we leverage the third party auditor (TPA) in many existing public auditing designs, let it play the role of authorized party in our case, and make it in charge of both the storage auditing and the secure key updates for key-exposure resistance. In our design, TPA only needs to hold an encrypted version of the client’s secret key, while doing all these burdensome tasks on behalf of the client. The client only needs to download the encrypted secret key from the TPA when uploading new files to cloud. Besides, our design also equips the client with capability to further verify the validity of the encrypted secret keys provided by TPA. All these salient features are carefully designed to make the whole auditing procedure with key exposure resistance as transparent as possible for the client. We formalize the definition and the security model of this paradigm. The security proof and the performance simulation show that our detailed design instantiations are secure and efficient.Existing System: Existing solutions all require the client to update his secret keys in every time period, which may inevitably bring in new local burdens to the client, especially those with limited computation resources such as mobile phones. The third party auditor (TPA) in many existing public auditing designs, let it play the role of authorized party in our case, and make it in charge of both the storage auditing and the secure key updates for key-exposure resistance.PROPOSED SYSTEM: Cloud storage auditing has been proposed and studied. To address the challenge, existing solutions all require the client to update his secret keys in every time period, which may inevitably bring in new local burdens to the client, especially those with limited computation resources have been proposed to deal with this problem. These protocols focus on different aspects of cloud storage auditing such as the high efficiency the privacy protection of data the privacy protection of identities dynamic data operations the data sharing. Firstly proposed the notion of wallet databases with observers, in which a hardware was used to help the client perform some expensive computations. The first outsourcing algorithm for modular exponentiations was proposed .which was based on the methods of precomputation and server-aided computation. A secure outsourcing algorithm to complete sequence comparisons. Proposed an outsourcing algorithm for attributebased signatures computations. The auditing protocols supporting dynamic data operations were also proposed auditing protocol supporting both the dynamic property and the privacy preserving property. The privacy preserving of the user’s identity for shared data auditing was considered in. The problem of user revocation in shared data auditing was considered in proposed a public auditing protocol for data sharing with multiuser modification. The proposed cloud storage auditing protocol with outsourcing of key updates is verifiable.SYSTEM SPECIFICATIONHardware Requirements:• System : Pentium IV 2.4 GHz.• Hard Disk : 40 GB.• Floppy Drive : 1.44 Mb.• Monitor : 14’ Colour Monitor.• Mouse : Optical Mouse.• Ram : 512 Mb.Software Requirements:• Operating system : Windows 7 Ultimate.• Coding Language : ASP.Net with C#• Front-End : Visual Studio 2010 Professional.• Data Base : SQL Server 2008.Conclusion:The aim of this paper is to provide an integrity auditing scheme with public verifiability, efficient data dynamics and fair disputes arbitration. To eliminate the limitation of index usage in tag computation and efficiently support data dynamics, we differentiate between block indices and tag indices, and devise an index switcher to keep block-tag index mapping to avoid tag re-computation caused by block update operations, which incurs limited additional overhead, as shown in our performance evaluation. Meanwhile, since both clients and the CSP potentially may misbehave during auditing and data update, we extend the existing threat model in current research to provide fair arbitration for solving disputes between clients and the CSP, which is of vital significance for the deployment and promotion of auditing schemes in the cloud environment.We achieve this by designing arbitration protocols based on the idea of exchanging metadata signatures upon each update operation. Our experiments demonstrate the efficiency of our proposed scheme, whose overhead for dynamic update and dispute arbitration are reasonable.
Send Enquiry
Read More
JAVA /DOT NET PROJECTS ABSTRACT 2016-2017 IDENTITY-BASED PROXY-ORIENTED DATA UPLOADING AND REMOTE DATA INTEGRITY CHECKING IN PUBLIC CLOUD. ABSTRACT: More and more clients would like to store their data to PCS (public cloud servers) along with the rapid development of cloud computing. New security problems have to be solved in order to help more clients process their data in public cloud. When the client is restricted to access PCS, he will delegate its proxy to process his data and upload them. On the other hand, remote data integrity checking is also an important security problem in public cloud storage. It makes the clients check whether their outsourced data is kept intact without downloading the whole data. From the security problems, we propose a novel proxy-oriented data uploading and remote data integrity checking model in identity-based public key cryptography: IDPUIC (identity-based proxy-oriented data uploading and remote data integrity checking in public cloud). We give the formal definition, system model and security model. Then, a concrete ID-PUIC protocol is designed by using the bilinear pairings. The proposed ID-PUIC protocol is provably secure based on the hardness of CDH (computational Diffie-Hellman) problem. Our ID-PUIC protocol is also efficient and flexible. Based on the original client’s authorization, the proposed ID-PUIC protocol can realize private remote data integrity checking, delegated remote data integrity checking and public remote data integrity checking.SYSTEM ANALYSISEXISTING SYSTEM checker must have R1, Ro, Rp. Ro, Rp are the part of original client’s private key and the proxy’s private key respectively. Their publicity cannot leak their the other part of private key, i.e., σo, σp cannot be leaked. The private key extraction phase Extract is actually a modified ElGamal signature scheme which is existentially unforgeable. For the identity ID, the extracted private key (R, σ) is a signature of ID. Since ElGamal signature is existentially unforgeable, the private key part σ will keep secret even if R is made public. On the other hand, R1 is generated by the original client in order to create the signature on the warrant m!. Thus, R1 is also known to the original clientPROPOSED SYSTEM proof process is almost the same as Shacham- Waters’s protocol [20], we only give the differences. In Shacham-Waters’s protocol, u is randomly picked from G1. In our ID-PUIC protocol, u is calculated by using the hash function h. In the random oracle model, h’s output value is indistinguishable from a random value nn the group G1. In the phase TagGen, the proxy-key σ is used in ID-PUIC protocol while the data owner’s secret key a is used in Shacham- Waters’s protocol [20]. For PCS, σ and a has the same function to generate the block tags. When PCS is dishonest, since Shacham-Waters’s protocol is existentially unforgeable in random oracle model, our proposed ID-PUIC protocol is also existentially unforgeable in the random oracle model. The detailed proof process is omitted since it is very similar to Shacham-Waters’s protocol.SYSTEM SPECIFICATIONHardware Requirements:• System : Pentium IV 2.4 GHz.• Hard Disk : 40 GB.• Floppy Drive : 1.44 Mb.• Monitor : 14’ Colour Monitor.• Mouse : Optical Mouse.• Ram : 512 Mb.Software Requirements:• Operating system : Windows 7 Ultimate.• Coding Language : ASP.Net with C#• Front-End : Visual Studio 2010 Professional.• Data Base : SQL Server 2008. CONCLUSION: Motivated by the application needs, this paper proposes the novel security concept of ID-PUIC in public cloud. The paper formalizes ID-PUIC’s system model and security model. Then, the first concrete ID-PUIC protocol is designed by using the bilinear pairings technique. The concrete ID-PUIC protocol is provably secure and efficient by using the formal security proof and efficiency analysis. On the other hand, the proposed ID-PUIC protocol can also realize private remote data integrity checking, delegated remote data integrity checking and public remote data integrity checking based on the original client’s authorization.
Send Enquiry
Read More
Page 1 1