![Security (MPI) implementation to preserve confidentiality of
messages communicated among nodes of clusters in an
unsecured network. We focus on M PI rather than other
protocols, because M PI is one of the most popular
communication protocols for parallel computing on
clusters. Our MPI implementation-called ES-MPICH2-
was built based on MPICH2 developed by the Argonne
National Laboratory. Like MPICH2, ES-MPICH2 aims at
supporting a large variety of computation and
communication platforms like commodity clusters and
high-speed networks. We integrated encryption and
decryption algorithms into the MPICH2 library with the
standard MPI interface and; thus, data confidentiality of
MPI applications can be readily preserved without a need
to change the source codes of the MPI applications. MPI-
application programmers can fully configure any
confidentiality services in MPICHI2, because a secured
configuration file in ES-MPICH2 offers the programmers
flexibility in choosing any cryptographic schemes and
keys seamlessly incorporated in ES-MPICH2. We used
the Sandia Micro Benchmark and Intel MPI Benchmark
suites to evaluate and compare the performance of ES-
MPICH2 with the original MPICH2 version. Our
experiments show that overhead incurred by the
confidentiality services in ES-MPICH2 is marginal for
small messages. The security overhead in ES-MPICH2
becomes more pronounced with larger messages. Our
results also show that security overhead can be
significantly reduced in ES-MPICH2 by high-
performance clustersRequirements elicitation is the
software engineering activity in which
7. On the In 2011, Sun et al. [CHECK END OF SENTENCE] 2012
Security of a proposed a security architecture to ensure unconditional
Ticket-Based anonymity for honest users and traceability of
Anonymity misbehaving users for network authorities in wireless
System with mesh networks (WMNs). It strives to resolve the conflicts
Traceability between the anonymity and traceability objectives. In this
Property in paper, we attacked Sun et al. scheme's traceability. Our
Wireless analysis showed that trusted authority (TA) cannot trace
Mesh the misbehavior client (CL) even if it double-time
Networks deposits the same ticket.](https://image.slidesharecdn.com/network-security-java-ieee-projects-2012-121030021535-phpapp02/85/Network-security-java-ieee-projects-2012-Seabirds-Trichy-Pudukkottai-Tanjore-Karur-Perambalur-Namakkal-7-320.jpg)
Network security java ieee projects 2012 @ Seabirds ( Trichy, Pudukkottai, Tanjore, Karur, Perambalur, Namakkal )
- 1. SEABIRDS IEEE 2012 – 2013 SOFTWARE PROJECTS IN VARIOUS DOMAINS | JAVA | J2ME | J2EE | DOTNET |MATLAB |NS2 | SBGC SBGC 24/83, O Block, MMDA COLONY 4th FLOOR SURYA COMPLEX, ARUMBAKKAM SINGARATHOPE BUS STOP, CHENNAI-600106 OLD MADURAI ROAD, TRICHY- 620002 Web: www.ieeeproject.in E-Mail: [email protected] Trichy Chennai Mobile:- 09003012150 Mobile:- 09944361169 Phone:- 0431-4012303
- 2. SBGC Provides IEEE 2012-2013 projects for all Final Year Students. We do assist the students with Technical Guidance for two categories. Category 1 : Students with new project ideas / New or Old IEEE Papers. Category 2 : Students selecting from our project list. When you register for a project we ensure that the project is implemented to your fullest satisfaction and you have a thorough understanding of every aspect of the project. SBGC PROVIDES YOU THE LATEST IEEE 2012 PROJECTS / IEEE 2013 PROJECTS FOR FOLLOWING DEPARTMENT STUDENTS B.E, B.TECH, M.TECH, M.E, DIPLOMA, MS, BSC, MSC, BCA, MCA, MBA, BBA, PHD, B.E (ECE, EEE, E&I, ICE, MECH, PROD, CSE, IT, THERMAL, AUTOMOBILE, MECATRONICS, ROBOTICS) B.TECH(ECE, MECATRONICS, E&I, EEE, MECH , CSE, IT, ROBOTICS) M.TECH(EMBEDDED SYSTEMS, COMMUNICATION SYSTEMS, POWER ELECTRONICS, COMPUTER SCIENCE, SOFTWARE ENGINEERING, APPLIED ELECTRONICS, VLSI Design) M.E(EMBEDDED SYSTEMS, COMMUNICATION SYSTEMS, POWER ELECTRONICS, COMPUTER SCIENCE, SOFTWARE ENGINEERING, APPLIED ELECTRONICS, VLSI Design) DIPLOMA (CE, EEE, E&I, ICE, MECH,PROD, CSE, IT) MBA(HR, FINANCE, MANAGEMENT, HOTEL MANAGEMENT, SYSTEM MANAGEMENT, PROJECT MANAGEMENT, HOSPITAL MANAGEMENT, SCHOOL MANAGEMENT, MARKETING MANAGEMENT, SAFETY MANAGEMENT) We also have training and project, R & D division to serve the students and make them job oriented professionals
- 3. PROJECT SUPPORTS AND DELIVERABLES Project Abstract IEEE PAPER IEEE Reference Papers, Materials & Books in CD PPT / Review Material Project Report (All Diagrams & Screen shots) Working Procedures Algorithm Explanations Project Installation in Laptops Project Certificate
- 4. TECHNOLOGY : JAVA DOMAIN : IEEE TRANSACTIONS ON SECURE COMPUTING S.No. IEEE TITLE ABSTRACT IEEE YEAR 1. Revisiting Brute force and dictionary attacks on password-only 2012 Defenses remote login services are now widespread and ever against increasing.Enabling convenient login for legitimate users Large-Scale while preventing such attacks is a difficult problem. Online Automated Turing Tests (ATTs) continue to be an Password effective, easy-to-deploy approach to identify automated Guessing malicious login attempts with reasonable cost of Attacks inconvenience to users. In this paper, we discuss the inadequacy of existing and proposed login protocols designed to address large-scale online dictionary attacks (e.g., from a botnet of hundreds of thousands of nodes). We propose a new Password Guessing Resistant Protocol (PGRP), derived upon revisiting prior proposals designed to restrict such attacks. While PGRP limits the total number of login attempts from unknown remote hosts to as low as a single attempt per username, legitimate users in most cases (e.g., when attempts are made from known, frequently-used machines) can make several failed login attempts before being challenged with an ATT. We analyze the performance of PGRP with two real-world data sets and find it more promising than existing proposals 2. Data- Malicious software typically resides stealthily on a user's 2012 Provenance computer and interacts with the user's computing Verification resources. Our goal in this work is to improve the For Secure trustworthiness of a host and its system data. Specifically, Hosts we provide a new mechanism that ensures the correct origin or provenance of critical system information and prevents adversaries from utilizing host resources. We define data-provenance integrity as the security property stating that the source where a piece of data is generated cannot be spoofed or tampered with. We describe a cryptographic provenance verification approach for ensuring system properties and system-data integrity at kernel-level. Its two concrete applications are demonstrated in the keystroke integrity verification and malicious traffic detection. Specifically, we first design
- 5. and implement an efficient cryptographic protocol that enforces keystroke integrity by utilizing on-chip Trusted Computing Platform (TPM). The protocol prevents the forgery of fake key events by malware under reasonable assumptions. Then, we demonstrate our provenance verification approach by realizing a lightweight framework for restricting outbound malware traffic. This traffic-monitoring framework helps identify network activities of stealthy malware, and lends itself to a powerful personal firewall for examining all outbound traffic of a host that cannot be bypassed 3. Design and The multihop routing in wireless sensor networks 2012 Implementati (WSNs) offers little protection against identity deception on of through replaying routing information. An adversary can TARF:A exploit this defect to launch various harmful or even Trust-Aware devastating attacks against the routing protocols, Routing including sinkhole attacks, wormhole attacks, and Sybil Framework attacks. The situation is further aggravated by mobile and for WSNs harsh network conditions. Traditional cryptographic techniques or efforts at developing trust-aware routing protocols do not effectively address this severe problem. To secure the WSNs against adversaries misdirecting the multihop routing, we have designed and implemented TARF, a robust trust-aware routing framework for dynamic WSNs. Without tight time synchronization or known geographic information, TARF provides trustworthy and energy-efficient route. Most importantly, TARF proves effective against those harmful attacks developed out of identity deception; the resilience of TARF is verified through extensive evaluation with both simulation and empirical experiments on large-scale WSNs under various scenarios including mobile and RF- shielding network conditions. Further, we have implemented a low-overhead TARF module in TinyOS; as demonstrated, this implementation can be incorporated into existing routing protocols with the least effort. Based on TARF, we also demonstrated a proof-of-concept mobile target detection application that functions well against an antidetection mechanism. 4. On the Content distribution via network coding has received a lot 2012 Security and of attention lately. However, direct application of Efficiency of network coding may be insecure. In particular, attackers Content can inject "bogus” data to corrupt the content distribution Distribution process so as to hinder the information dispersal or even via Network deplete the network resource. Therefore, content Coding verification is an important and practical issue when
- 6. network coding is employed. When random linear network coding is used, it is infeasible for the source of the content to sign all the data, and hence, the traditional "hash-and-sign” methods are no longer applicable. Recently, a new on-the-fly verification technique has been proposed by Krohn et al. (IEEE S&P '04), which employs a classical homomorphic hash function. However, this technique is difficult to be applied to network coding because of high computational and communication overhead. We explore this issue further by carefully analyzing different types of overhead, and propose methods to help reducing both the computational and communication cost, and provide provable security at the same time 5. Detecting Collaborative information systems (CISs) are deployed 2012 Anomalous within a diverse array of environments that manage Insiders in sensitive information. Current security mechanisms Collaborative detect insider threats, but they are ill-suited to monitor Information systems in which users function in dynamic teams. In this Systems paper, we introduce the community anomaly detection system (CADS), an unsupervised learning framework to detect insider threats based on the access logs of collaborative environments. The framework is based on the observation that typical CIS users tend to form community structures based on the subjects accessed (e.g., patients' records viewed by healthcare providers). CADS consists of two components: 1) relational pattern extraction, which derives community structures and 2) anomaly prediction, which leverages a statistical model to determine when users have sufficiently deviated from communities. We further extend CADS into MetaCADS to account for the semantics of subjects (e.g., patients' diagnoses). To empirically evaluate the framework, we perform an assessment with three months of access logs from a real electronic health record (EHR) system in a large medical center. The results illustrate our models exhibit significant performance gains over state-of-the-art competitors. When the number of illicit users is low, MetaCADS is the best model, but as the number grows, commonly accessed semantics lead to hiding in a crowd, such that CADS is more prudent. 6. ES-MPICH2: An increasing number of commodity clusters are A Message connected to each other by public networks, which have Passing become a potential threat to security sensitive parallel Interface with applications running on the clusters. To address this Enhanced security issue, we developed a Message Passing Interface
- 7. Security (MPI) implementation to preserve confidentiality of messages communicated among nodes of clusters in an unsecured network. We focus on M PI rather than other protocols, because M PI is one of the most popular communication protocols for parallel computing on clusters. Our MPI implementation-called ES-MPICH2- was built based on MPICH2 developed by the Argonne National Laboratory. Like MPICH2, ES-MPICH2 aims at supporting a large variety of computation and communication platforms like commodity clusters and high-speed networks. We integrated encryption and decryption algorithms into the MPICH2 library with the standard MPI interface and; thus, data confidentiality of MPI applications can be readily preserved without a need to change the source codes of the MPI applications. MPI- application programmers can fully configure any confidentiality services in MPICHI2, because a secured configuration file in ES-MPICH2 offers the programmers flexibility in choosing any cryptographic schemes and keys seamlessly incorporated in ES-MPICH2. We used the Sandia Micro Benchmark and Intel MPI Benchmark suites to evaluate and compare the performance of ES- MPICH2 with the original MPICH2 version. Our experiments show that overhead incurred by the confidentiality services in ES-MPICH2 is marginal for small messages. The security overhead in ES-MPICH2 becomes more pronounced with larger messages. Our results also show that security overhead can be significantly reduced in ES-MPICH2 by high- performance clustersRequirements elicitation is the software engineering activity in which 7. On the In 2011, Sun et al. [CHECK END OF SENTENCE] 2012 Security of a proposed a security architecture to ensure unconditional Ticket-Based anonymity for honest users and traceability of Anonymity misbehaving users for network authorities in wireless System with mesh networks (WMNs). It strives to resolve the conflicts Traceability between the anonymity and traceability objectives. In this Property in paper, we attacked Sun et al. scheme's traceability. Our Wireless analysis showed that trusted authority (TA) cannot trace Mesh the misbehavior client (CL) even if it double-time Networks deposits the same ticket.