| Sr. | Title of Research Paper/Article | Author | e-Certificate | Download |
| 1 | M-Privacy for Collective Data Publishing | Bharathi Y. & G.Lakshmikanth |  |
 |
| Abstract – In recent years, privacy takes an important role to secure the data from various probable attackers. When for public advantage data need to be shared as required for Health care and researches, individual privacy is major concern regarding sensitive information. So while publishing such data, privacy should be conserved .While publishing collaborative data to multiple data provider’s two types of problem occurs, first is outsider attack and second is insider attack. Outsider attack is by the people who are not data providers and insider attack is by colluding data provider who may use their own data records to understand the data records shared by other data providers. The paper focuses on insider attack, and makes some contributions. This problem can be overcome by combining slicing techniques with m-privacy techniques and addition of protocols as secure multiparty computation and trusted third party will increase the privacy of system effectively. | ||||
| 2 | Implementing Protected and Privacy-Preserving Information Brokering in Distributed Information Sharing | Paatha Sangeetha, B. Sudhakar & K.Geeta | |
|
| Abstract – Information sharing has been increased nowadays in organizations via on-demand access. There is an demand for inter organizational information sharing. Large-scale loosely federated data sources are connected through brokering overlay by Information Brokering Systems (IBS). Brokers are used to make routing decisions to direct client queries to the requested data servers. An approach to preserve privacy in information brokering process of multiple shareholders by Privacy Preserving Information Brokering (PPIB) is proposed. PPIB has three components: brokers, coordinators and central authority. The two privacy attacks are used namely attribute-correlation attack and inference attack. Decision making among the selected set of brokering servers have been achieved by automation segmentation and query segmentation encryption. This approach integrates security with query routing to provide system wide security. In order to preserve privacy is to divide and allocate the functionality to brokering components in a way that no single encrypted segment can make a meaningful inference from the information disclosed to it. | ||||
| 3 | Protected and Effective Data Communication for Cluster-Based Wireless Sensor Networks | Gaddam Srinivas, G.Lakshmi & K.Geeta | |
|
| Abstract – Reliable data transmission is a critical issue for wireless sensor networks. Reliable means providing security for data transmission and providing efficiency in data transmission for cluster based wireless sensor networks. Clustering is an effective and practical way to enhance the system performance of wireless sensor networks. In this, the clusters are formed dynamically and periodically. The Identity based digital signature protocol is introduced in order to provide reliable data transmission for cluster-based wireless sensor networks. The Identity based digital signature protocol relies on the hardness of the Diffie-Hellman problem to provide security and also it reduces the computational overhead of the protocol using discrete logarithm problem. This paper includes the feasibility of the protocol with respect to security requirements and security analysis over several attacks. The calculations and simulations are provided to illustrate the efficiency of the proposed protocol. The results show that, the proposed protocol have better performance than the existing secure protocols for cluster-based wireless sensor networks, in terms of security overhead and energy consumption. | ||||
| 4 | Cloud-Assisted Discretion Protective Mobile Strength Monitoring | Bommakanti Vasundhara & K.Geeta | |
|
| Abstract – Cloud-assisted mobile health (mHealth) monitoring, which applies the prevailing mobile communications and cloud computing technologies to provide feedback decision support, has been considered as a revolutionary approach to improving the quality of healthcare service while lowering the healthcare cost. Unfortunately, it also poses a serious risk on both clients’ privacy and intellectual property of monitoring service providers, which could deter the wide adoption of mHealth technology. Authors in existing system, proposed a new variant of proxy re-encryption scheme, in which health care companies only needs to accomplish encryption once at the setup phase while shifting the rest computational tasks to the cloud without compromising privacy. The work in existing system [1], however does not consider how charging must be implemented in this system, health care companies survive only on the charging the user for accessing the service. Health care companies want to charge differentially for the different services and also reconciliation reports must be generated, so user cannot deny claim if they have used the service. We extend the paper for differential charging of services and reconciliation of payments. | ||||
| 5 | Anomaly Detection via Online Oversampling Principal Component Analysis | Muthoju Divya Sri & K.Geeta | |
|
| 6 | Load Rebalancing for Distributed File Systems in Clouds | Usikamalla Srikanth, G.Lakshmi & K.Geeta | |
|
| Abstract – In distributed systems protecting the data is become more vulnerable and has to provide the secure to the digital applications. A novel load-balancing algorithm to deal with the load rebalancing problem in large-scale, dynamic, and distributed file systems in clouds. Distributed file systems are key building blocks for cloud computing applications based on the Map Reduce programming paradigm. In such file systems, nodes simultaneously serve computing and storage functions. Files can also be dynamically created, deleted, and appended. This results in load imbalance in a distributed file system; that is, the file chunks are not distributed as uniformly as possible among the nodes. Additionally. | ||||
| 7 | Privacy Preserving Data Sharing With Anonymous ID Assignment | Garrapally Anjaneyulu, G.Lakshmi & K.Geeta | |
|
| Abstract – In contemporary world web has created a leeway into daily lives with all information being hold on during a server of some type so spread or employed in the style required. this can be confined to multiple applications like patient medical records, balloting details, banking, social networking, email, analysis etc. however the identity has to be preserved for each the information and therefore the owner because the case is also that is more and {more} turning into a drag with additional and more identities allotted to the information particularly just in case of distributed server sharing. Existing solutions target the central server model that is computationally costly, includes a immense information measure exchange, information security is compromised and therefore not fitted to the distributed model hip currently. The proposed work focuses on the distributed side of computing wherever the IDs are anonymous employing a distributed computation with no central authority and such IDs will be used as a part of schemes for sharing or dividing communications information measure, information storage, and alternative resources anonymously and while not conflict. it’s doable to use secure add to permit one to opt-out of a computation beforehand on the premise of sure rules in applied mathematics revealing limitation. These model suites for the distributed computing model with Anonymous ID assignment wherever procedure overhead is low, information measure consumption is additionally less. The AIDA algorithm is applied serially and therefore is secure, however chiefly the distributed nature of the information sharing system is sustained. The protocol for privacy conserving mistreatment anonymous id assignment is no-hit. | ||||
| 8 | Dynamic Query Forms for Database Queries | Bonagiri Manoja Rani & K.Geeta | |
|
| 9 | Reversible Data Hiding in Encrypted Images by Reserving Room before Encryption | N. Naresh, K.Rajendra & K.Geeta | |
|
| 10 | A Server Design for Mobile Occurence Services in Social Network Applications | Vasam Ramula, K.Rajendra & K.Geeta | |
|
| 11 | Enabling Data Dynamic and Indirect Mutual Trust for Cloud Computing Storage System | Polu Sathish, B.Sudhakar & K.Geeta | |
|
| 12 | Optimal Service Pricing for a Cloud Cache | K. Sravanthi, G.Lakshmi & K.Geeta | |
|
| Abstract – With the growing popularity of cloud based data centers as the enterprise IT platform of choice, there is a need for effective management strategies capable of maintaining performance. Caching technology improves the performance of the cloud. Cache as a service (CaaS) model is an additional service to Infrastructure as a service (IaaS). The cloud server process introduce, pricing model together with the elastic cache system. This will increase the disk I/O performance of the IaaS, and it will reduce the usage of the physical machines. The emerging cloud applications provide data management services allowing the user to query the cloud data, paying the price for the infrastructure they use. Cloud management necessitate an economy that manages the services of multiple users in an efficient, but also, resource economic way that allows for cloud profit. The cloud caching service can maximize its profit using an optimal pricing scheme. This scheme requires an appropriately simplified price-demand model that incorporates the correlations of structures in the cache services. The pricing scheme should be adaptable to time changes. This paper proposes a novel price demand model designed for a cloud cache and a dynamic pricing scheme for queries executed in the cloud cache. This will estimates the correlations of the cache services in a time-efficient manner and improve the efficiency of resources in cloud storage infrastructure to deliver scalable service. | ||||
| 13 | Association in Multi Cloud Computing Environments Structure and Security Issues | Sadula Vijayalaxmi, K.Rajendar & K.Geeta | |
|
| Abstract – Cloud computing has emerged as a popular paradigm that offers computing resources (e.g. CPU, storage, bandwidth, software) as scalable and on-demand services over the Internet. As more players enter this emerging market, a heterogeneous cloud computing market is expected to evolve, where individual players will have different volumes of resources, and will provide specialized services, and with different levels of quality of services. It is expected that service providers will thus, besides competing, also collaborate to complement their resources in order to improve resource utilization and combine individual services to offer more complex value chains and end-to-end solutions required by the customers. In this paper we explore the viability of collaboration framework in cloud computing environments. This collaboration will be driven by the growing need to offer diverse services without having to spend heavily on infrastructure. Collaboration can be a boon to all cloud service providers in a way that the customers would have on offer a combined catalogue of all partnering CSPs. | ||||
| 14 | An Empirical Investigation of Risk Based Automatic Code Smells Detection | Rohit Kumar & Jaspreet Singh | |
|
| Abstract – Code smells are structural uniqueness of software that mayspecify a code or design difficulty that makes software inflexible to advance andmaintain, and may trigger re-factoring of code. A lateststudy is active inmajor automatic detection tools to help humans in finding smells whencode size becomes impossible for manual appraise. Since the definitionsof code smells are informal and individual, assessing how effective codesmell detection tools are is both important and durable to accomplish. Thispaper analysis the current view of the tools for automatic code smellsdetection. It defines research queries about the consistency of theirresponses, their ability to representation the regions of code most affected bystructural decay, and the significance of their responses with respect to prospectsoftware evolution. It gives respond to them by analyzing the production offour representative code smell detectors applied to six different versions ofGanttProject, an open source system written in Java. The results of theseexperiment cast light on what present code smell detection tools are ableto do and what the applicable areas for advanceenhancement are. | ||||
| 15 | A Dynamic Modeling Permanent Magnet Synchronous Motor Drive System | Miss. Kinjal G. Patel & Mr. Chirag V. Patel | |
|
| Abstract – Field oriented control is used for the operation of the drive. The simulation includes all realistic components of the system. This enables the calculation of currents and voltages in different parts of the inverter and motor under transient and steady conditions. |
