List of IEEE C# Projects. It Contains the IEEE Projects in the Language C# with ieee publication year 2014

1. IEEE 2014 C# Projects
Web : www.kasanpro.com Email : sales@kasanpro.com
List Link : http://kasanpro.com/projects-list/ieee-2014-c-projects
Title :An Error Minimizing Framework for Localizing Jammers in Wireless Networks
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/error-minimizing-localizing-jammers-wireless-networks
Abstract : Jammers can severely disrupt the communications in wireless networks, and jammers' position information
allows the defender to actively eliminate the jamming attacks. Thus, in this paper, we aim to design a framework that
can localize one or multiple jammers with a high accuracy. Most of existing jammer-localization schemes utilize
indirect measurements (e.g., hearing ranges) affected by jamming attacks, which makes it difficult to localize jammers
accurately. Instead, we exploit a direct measurement-the strength of jamming signals (JSS). Estimating JSS is
challenging as jamming signals may be embedded in other signals. As such, we devise an estimation scheme based
on ambient noise floor and validate it with real-world experiments. To further reduce estimation errors, we define an
evaluation feedback metric to quantify the estimation errors and formulate jammer localization as a non-linear
optimization problem, whose global optimal solution is close to jammers' true positions. We explore several heuristic
search algorithms for approaching the global optimal solution, and our simulation results show that our
error-minimizing-based framework achieves better performance than the existing schemes. In addition, our error
minimizing framework can utilize indirect measurements to obtain a better location estimation compared with prior
work.
Title :NCCloud: A Network-Coding-Based Storage System in a Cloud-of-Clouds
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/nccloud-network-coding-based-storage-system-cloud-clouds
Abstract : To provide fault tolerance for cloud storage, recent studies propose to stripe data across multiple cloud
vendors. However, if a cloud suffers from a permanent failure and loses all its data, we need to repair the lost data
with the help of the other surviving clouds to preserve data redundancy. We present a proxy-based storage system for
fault-tolerant multiple-cloud storage called NCCloud, which achieves cost-effective repair for a permanent single-cloud
failure. NCCloud is built on top of a network-coding-based storage scheme called the functional minimum-storage
regenerating (FMSR) codes, which maintain the same fault tolerance and data redundancy as in traditional erasure
codes (e.g., RAID-6), but use less repair traffic and hence incur less monetary cost due to data transfer. One key
design feature of our FMSR codes is that we relax the encoding requirement of storage nodes during repair, while
preserving the benefits of network coding in repair. We implement a proof-of-concept prototype of NCCloud and
deploy it atop both local and commercial clouds. We validate that FMSR codes provide significant monetary cost
savings in repair over RAID-6 codes, while having comparable response time performance in normal cloud storage
operations such as upload/download.
Title :Privacy-Preserving Multi-keyword Ranked Search over Encrypted Cloud Data
Language : C#
Project Link :
http://kasanpro.com/p/c-sharp/privacy-preserving-multi-keyword-ranked-search-encrypted-cloud-data-code
Abstract : With the advent of cloud computing, data owners are motivated to outsource their complex data
management systems from local sites to the commercial public cloud for great flexibility and economic savings. But
for protecting data privacy, sensitive data has to be encrypted before outsourcing, which obsoletes traditional data
utilization based on plaintext keyword search. Thus, enabling an encrypted cloud data search service is of paramount
importance. Considering the large number of data users and documents in the cloud, it is necessary to allow multiple
keywords in the search request and return documents in the order of their relevance to these keywords. Related
works on searchable encryption focus on single keyword search or Boolean keyword search, and rarely sort the
search results. In this paper, for the first time, we define and solve the challenging problem of privacypreserving
multi-keyword ranked search over encrypted cloud data (MRSE).We establish a set of strict privacy requirements for

2. such a secure cloud data utilization system. Among various multikeyword semantics, we choose the efficient similarity
measure of "coordinate matching", i.e., as many matches as possible, to capture the relevance of data documents to
the search query. We further use "inner product similarity" to quantitatively evaluate such similarity measure. We first
propose a basic idea for the MRSE based on secure inner product computation, and then give two significantly
improved MRSE schemes to achieve various stringent privacy requirements in two different threat models. Thorough
analysis investigating privacy and efficiency guarantees of proposed schemes is given. Experiments on the real-world
dataset further show proposed schemes indeed introduce low overhead on computation and communication.
Title :Compatibility-aware Cloud Service Composition Under Fuzzy Preferences
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/compatibility-aware-cloud-service-composition-under-fuzzy-preferences
Abstract : When a single Cloud service (i.e., a software image and a virtual machine), on its own, cannot satisfy all
the user requirements, a composition of Cloud services is required. Cloud service composition, which includes several
tasks such as discovery, compatibility checking, selection, and deployment, is a complex process and users find it
difficult to select the best one among the hundreds, if not thousands, of possible compositions available. Service
composition in Cloud raises even new challenges caused by diversity of users with different expertise requiring their
applications to be deployed across difference geographical locations with distinct legal constraints. The main difficulty
lies in selecting a combination of virtual appliances (software images) and infrastructure services that are compatible
and satisfy a user with vague preferences. Therefore, we present a framework and algorithms which simplify Cloud
service composition for unskilled users. We develop an ontologybased approach to analyze Cloud service
compatibility by applying reasoning on the expert knowledge. In addition, to minimize effort of users in expressing
their preferences, we apply combination of evolutionary algorithms and fuzzy logic for composition optimization. This
lets users express their needs in linguistics terms which brings a great comfort to them compared to systems that
force users to assign exact weights for all preferences.
Title :Mining Social Media Data for Understanding Student's Learning Experiences
Language : ASP.NET with C#
Project Link : http://kasanpro.com/p/asp-net-with-c-sharp/mining-social-media-data-understanding-students-learning-experien
Abstract : Students' informal conversations on social media (e.g. Twitter, Facebook) shed light into their educational
experiences - opinions, feelings, and concerns about the learning process. Data from such uninstrumented
environment can provide valuable knowledge to inform student learning. Analyzing such data, however, can be
challenging. The complexity of student's experiences reflected from social media content requires human
interpretation. However, the growing scale of data demands automatic data analysis techniques. In this paper, we
developed a workflow to integrate both qualitative analysis and large - scale data mining techniques. We focus on
engineering student's Twitter posts to understand issues and problems in their educational experiences. We first
conducted a qualitative analysis on samples taken from about 25,000 tweets related to engagement, and sleep
deprivation. Based on these results, we implemented a multi - label classification algorithm to classify tweets
reflecting student's problems. We then used the algorithm to train a detector of student problems from about 35,000
tweets streamed at the geo - location of Purdue University. This work, for the first time, presents a methodology and
results that show how informal social media data can provide insights into students' experiences.
IEEE 2014 C# Projects
Title :Mining Social Media Data for Understanding Student's Learning Experiences
Language : C#
Project Link :
http://kasanpro.com/p/c-sharp/mining-social-media-data-understanding-students-learning-experiences-implement
Abstract : Students' informal conversations on social media (e.g. Twitter, Facebook) shed light into their educational
experiences - opinions, feelings, and concerns about the learning process. Data from such uninstrumented
environment can provide valuable knowledge to inform student learning. Analyzing such data, however, can be
challenging. The complexity of student's experiences reflected from social media content requires human
interpretation. However, the growing scale of data demands automatic data analysis techniques. In this paper, we
developed a workflow to integrate both qualitative analysis and large - scale data mining techniques. We focus on
engineering student's Twitter posts to understand issues and problems in their educational experiences. We first
conducted a qualitative analysis on samples taken from about 25,000 tweets related to engagement, and sleep
deprivation. Based on these results, we implemented a multi - label classification algorithm to classify tweets
reflecting student's problems. We then used the algorithm to train a detector of student problems from about 35,000
tweets streamed at the geo - location of Purdue University. This work, for the first time, presents a methodology and

3. results that show how informal social media data can provide insights into students' experiences.
Title :Cost-effective Viral Marketing for Time-critical Campaigns in Large-scale Social Networks
Language : ASP.NET with C#
Project Link : http://kasanpro.com/p/asp-net-with-c-sharp/cost-effective-viral-marketing-time-critical-campaigns-large-scale-so
Abstract : Online social networks (OSNs) have become one of the most effective channels for marketing and
advertising. Since users are often influenced by their friends, "wordof- mouth" exchanges, so-called viral marketing, in
social networks can be used to increase product adoption or widely spread content over the network. The common
perception of viral marketing about being cheap, easy, and massively effective makes it an ideal replacement of
traditional advertising. However, recent studies have revealed that the propagation often fades quickly within only few
hops from the sources, counteracting the assumption on the self-perpetuating of influence considered in literature.
With only limited influence propagation, is massively reaching customers via viral marketing still affordable? How to
economically spend more resources to increase the spreading speed? We investigate the cost-effective massive viral
marketing problem, taking into the consideration the limited influence propagation. Both analytical analysis based on
power-law network theory and numerical analysis demonstrate that the viral marketing might involve costly seeding.
To minimize the seeding cost, we provide mathematical programming to find optimal seeding for medium-size
networks and propose VirAds, an efficient algorithm, to tackle the problem on largescale networks. VirAds guarantees
a relative error bound of O(1) from the optimal solutions in power-law networks and outperforms the greedy heuristics
which realizes on the degree centrality. Moreover, we also show that, in general, approximating the optimal seeding
within a ratio better than O(log n) is unlikely possible.
Title :Cost-effective Viral Marketing for Time-critical Campaigns in Large-scale Social Networks
Language : C#
Project Link :
http://kasanpro.com/p/c-sharp/effective-viral-marketing-time-critical-campaigns-large-scale-social-networks
Abstract : Online social networks (OSNs) have become one of the most effective channels for marketing and
advertising. Since users are often influenced by their friends, "wordof- mouth" exchanges, so-called viral marketing, in
social networks can be used to increase product adoption or widely spread content over the network. The common
perception of viral marketing about being cheap, easy, and massively effective makes it an ideal replacement of
traditional advertising. However, recent studies have revealed that the propagation often fades quickly within only few
hops from the sources, counteracting the assumption on the self-perpetuating of influence considered in literature.
With only limited influence propagation, is massively reaching customers via viral marketing still affordable? How to
economically spend more resources to increase the spreading speed? We investigate the cost-effective massive viral
marketing problem, taking into the consideration the limited influence propagation. Both analytical analysis based on
power-law network theory and numerical analysis demonstrate that the viral marketing might involve costly seeding.
To minimize the seeding cost, we provide mathematical programming to find optimal seeding for medium-size
networks and propose VirAds, an efficient algorithm, to tackle the problem on largescale networks. VirAds guarantees
a relative error bound of O(1) from the optimal solutions in power-law networks and outperforms the greedy heuristics
which realizes on the degree centrality. Moreover, we also show that, in general, approximating the optimal seeding
within a ratio better than O(log n) is unlikely possible.
http://kasanpro.com/ieee/final-year-project-center-perambalur-reviews
Title :DOTS: A Propagation Delay-aware Opportunistic MAC Protocol for Underwater Sensor Networks
Language : C#
Project Link :
http://kasanpro.com/p/c-sharp/dots-propagation-delay-aware-opportunistic-mac-protocol-underwater-sensor-networks
Abstract : Underwater Acoustic Sensor Networks (UW-ASNs) use acoustic links as a means of communications and
are accordingly confronted with long propagation delays, low bandwidth, and high transmission power consumption.
This unique situation, however, permits multiple packets to concurrently propagate in the underwater channel, which
must be exploited in order to improve the overall throughput. To this end, we propose the Delay-aware Opportunistic
Transmission Scheduling (DOTS) algorithm that uses passively obtained local information (i.e., neighboring nodes'
propagation delay map and their expected transmission schedules) to increase the chances of concurrent
transmissions while reducing the likelihood of collisions. Our extensive simulation results document that DOTS
outperforms existing solutions and provides fair medium access.
Title :From MAP to DIST: The Evolution of a Large-Scale WLAN Monitoring System

4. Language : C#
Project Link : http://kasanpro.com/p/c-sharp/from-map-dist-the-evolution-large-scale-wlan-monitoring-system
Abstract : The edge of the Internet is increasingly becoming wireless. Therefore, monitoring the wireless edge is
important to understanding the security and performance aspects of the Internet experience. We designed and
implemented a large-scale WLAN monitoring system, the Dartmouth Internet security testbed (DIST), at Dartmouth
College. It is equipped with distributed arrays of "sniffers" that cover 210 diverse campus locations and more than
5,000 users. In this paper, we describe our approach, designs, and solutions for addressing the technical challenges
that have resulted from efficiency, scalability, security, and management perspectives. We also present extensive
evaluation results on a production network, and summarize the lessons learned.
IEEE 2014 C# Projects
Title :Verification and Inference of Positions in Vehicular Networks through Anonymous Beaconing
Language : C#
Project Link :
http://kasanpro.com/p/c-sharp/verification-inference-positions-vehicular-networks-anonymous-beaconing
Abstract : A number of vehicular networking applications require continuous knowledge of the location of vehicles
and tracking of the routes they follow, including, e.g., real-time traffic monitoring, e-tolling, and liability attribution in
case of accidents. Locating and tracking vehicles has however strong implications in terms of security and user
privacy. On the one hand, there should be a mean for an authority to verify the correctness of positioning information
announced by a vehicle, so as to identify potentially misbehaving cars. On the other, public disclosure of identity and
position of drivers should be avoided, so as not to jeopardize user privacy. In this paper, we address such issues by
introducing A-VIP, a secure, privacy-preserving framework for continuous tracking of vehicles. A-VIP leverages
anonymous position beacons from vehicles, and the cooperation of nearby cars collecting and reporting the beacons
they hear. Such information allows a location authority to verify the positions announced by vehicles, or to infer the
actual ones if needed, without resorting to computationally expensive asymmetric cryptography. We assess the
effectiveness of A-VIP via realistic simulation and experimental testbeds.
Title :Information Flow Control for Secure Cloud Computing
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/information-flow-control-secure-cloud-computing
Abstract : Security concerns are widely seen as an obstacle to the adoption of cloud computing solutions.
Information Flow Control (IFC) is a well understood Mandatory Access Control methodology. The earliest IFC models
targeted security in a centralised environment, but decentralised forms of IFC have been designed and implemented,
often within academic research projects. As a result, there is potential for decentralised IFC to achieve better cloud
security than is available today.
In this paper we describe the properties of cloud computing-- Platform-as-a-Service clouds in particular--and review a
range of IFC models and implementations to identify opportunities for using IFC within a cloud computing context.
Since IFC security is linked to the data that it protects, both tenants and providers of cloud services can agree on
security policy, in a manner that does not require them to understand and rely on the particulars of the cloud software
stack in order to effect enforcement.
Title :The Silence of the LANs: Efficient Leakage Resilience for IPsec VPNs
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/efficient-leakage-resilience-ipsec-vpns
Abstract : Virtual Private Networks (VPNs) are increasingly used to build logically isolated networks. However,
existing VPN designs and deployments neglected the problem of traffic analysis and covert channels. Hence, there
are many ways to infer information from VPN traffic without decrypting it. Many proposals have been made to mitigate
network covert channels, but previous works remained largely theoretical or resulted in prohibitively high padding
overhead and performance penalties.
In this work, we (1) analyse the impact of covert channels in IPsec, (2) present several improved and novel
approaches for covert channel mitigation in IPsec, (3) propose and implement a system for dynamic performance
trade-o_s, and (4) implement our design in the Linux IPsec stack and evaluate its performance for different types of

5. traffic and mitigation policies. At only 24% overhead, our prototype enforces tight information-theoretic bounds on all
information leak- age. To encourage further research on practical systems, our prototype is available for public use.
Title :Balancing Performance, Accuracy, and Precision for Secure Cloud Transactions
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/balancing-performance-accuracy-precision-secure-cloud-transactions
Abstract : In distributed transactional database systems deployed over cloud servers, entities cooperate to form
proofs of authorization that are justified by collections of certified credentials. These proofs and credentials may be
evaluated and collected over extended time periods under the risk of having the underlying authorization policies or
the user credentials being in inconsistent states. It therefore becomes possible for policy-based authorization systems
to make unsafe decisions that might threaten sensitive resources. In this paper, we highlight the criticality of the
problem. We then define the notion of trusted transactions when dealing with proofs of authorization. Accordingly, we
propose several increasingly stringent levels of policy consistency constraints, and present different enforcement
approaches to guarantee the trustworthiness of transactions executing on cloud servers. We propose a Two-Phase
Validation Commit protocol as a solution, which is a modified version of the basic Two-Phase Commit protocols. We
finally analyze the different approaches presented using both analytical evaluation of the overheads and simulations
to guide the decision makers to which approach to use.
Title :Location Management in Cellular Networks
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/location-management-cellular-networks
Abstract : In a cellular network, a service coverage area is divided into smaller areas of hexagonal shape, referred to
as cells. The cellular concept was introduced to reuse the radio frequency. In order to accommodate more
subscribers, the size of cells must be reduced to make more efficient use of the limited frequency spectrum allocation.
This will add to the challenge of some fundamental issues in cellular networks. Location management is one of the
fundamental issues in cellular networks. It deals with how to track subscribers on the move. This chapter surveys
recent research on location management in cellular networks.
IEEE 2014 C# Projects
Title :Automating Cloud Services Life Cycle through Semantic Technologies
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/automating-cloud-services-life-cycle-semantic-technologies
Abstract : Managing virtualized services efficiently over the cloud is an open challenge. Traditional models of
software development are not appropriate for the cloud computing domain, where software (and other) services are
acquired on demand. In this paper, we describe a new integrated methodology for the life cycle of IT services
delivered on the cloud and demonstrate how it can be used to represent and reason about services and service
requirements and so automate service acquisition and consumption from the cloud. We have divided the IT service
life cycle into five phases of requirements, discovery, negotiation, composition, and consumption. We detail each
phase and describe the ontologies that we have developed to represent the concepts and relationships for each
phase. To show how this life cycle can automate the usage of cloud services, we describe a cloud storage prototype
that we have developed. This methodology complements previous work on ontologies for service descriptions in that
it is focused on supporting negotiation for the particulars of a service and going beyond simple matchmaking.
http://kasanpro.com/ieee/final-year-project-center-perambalur-reviews
Title :Achieving Effective Cloud Search Services: Multi-keyword Ranked Search over Encrypted Cloud Data
Supporting Synonym Query
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/cloud-search-services-multi-keyword-ranked-search-encrypted-cloud
Abstract : In recent years, consumer-centric cloud computing paradigm has emerged as the development of smart
electronic devices combined with the emerging cloud computing technologies. A variety of cloud services are

6. delivered to the consumers with the premise that an effective and efficient cloud search service is achieved. For
consumers, they want to find the most relevant products or data, which is highly desirable in the "pay-as-you use"
cloud computing paradigm. As sensitive data (such as photo albums, emails, personal health records, financial
records, etc.) are encrypted before outsourcing to cloud, traditional keyword search techniques are useless.
Meanwhile, existing search approaches over encrypted cloud data support only exact or fuzzy keyword search, but
not semantics-based multi-keyword ranked search. Therefore, how to enable an effective searchable system with
support of ranked search remains a very challenging problem. This paper proposes an effective approach to solve the
problem of multi-keyword ranked search over encrypted cloud data supporting synonym queries. The main
contribution of this paper is summarized in two aspects: multi-keyword ranked search to achieve more accurate
search results and synonym-based search to support synonym queries. Extensive experiments on real-world dataset
were performed to validate the approach, showing that the proposed solution is very effective and efficient for
multikeyword ranked searching in a cloud environment.
Title :A Mechanism Design Approach to Resource Procurement in Cloud Computing
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/resource-procurement-cloud-computing-module
Abstract : We present a cloud resource procurement approach which not only automates the selection of an
appropriate cloud vendor but also implements dynamic pricing. Three possible mechanisms are suggested for cloud
resource procurement: cloud-dominant strategy incentive compatible (C-DSIC), cloud-Bayesian incentive compatible
(C-BIC), and cloud optimal (C-OPT). C-DSIC is dominant strategy incentive compatible, based on the VCG
mechanism, and is a low-bid Vickrey auction. C-BIC is Bayesian incentive compatible, which achieves budget
balance. C-BIC does not satisfy individual rationality. In C-DSIC and C-BIC, the cloud vendor who charges the lowest
cost per unit QoS is declared the winner. In C-OPT, the cloud vendor with the least virtual cost is declared the winner.
C-OPT overcomes the limitations of both C-DSIC and C-BIC. C-OPT is not only Bayesian incentive compatible, but
also individually rational. Our experiments indicate that the resource procurement cost decreases with increase in
number of cloud vendors irrespective of the mechanisms. We also propose a procurement module for a cloud broker
which can implement C-DSIC, C-BIC, or C-OPT to perform resource procurement in a cloud computing context. A
cloud broker with such a procurement module enables users to automate the choice of a cloud vendor among many
with diverse offerings, and is also an essential first step toward implementing dynamic pricing in the cloud.
Title :A Novel Model for Competition and Cooperation Among Cloud Providers
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/competition-cooperation-among-cloud-providers
Abstract : Having received significant attention in the industry, the cloud market is nowadays fiercely competitive with
many cloud providers. On one hand, cloud providers compete against each other for both existing and new cloud
users. To keep existing users and attract newcomers, it is crucial for each provider to offer an optimal price policy
which maximizes the final revenue and improves the competitive advantage. The competition among providers leads
to the evolution of the market and dynamic resource prices over time. On the other hand, cloud providers may
cooperate with each other to improve their final revenue. Based on a Service Level Agreement, a provider can
outsource its users' resource requests to its partner to reduce the operation cost and thereby improve the final
revenue. This leads to the problem of determining the cooperating parties in a cooperative environment. This paper
tackles these two issues of the current cloud market. First, we solve the problem of competition among providers and
propose a dynamic price policy. We employ a discrete choice model to describe the user's choice behavior based on
his obtained benefit value. The choice model is used to derive the probability of a user choosing to be served by a
certain provider. The competition among providers is formulated as a non-cooperative stochastic game where the
players are providers who act by proposing the price policy simultaneously. The game is modelled as a Markov
Decision Process whose solution is a Markov Perfect Equilibrium. Then, we address the cooperation among providers
by presenting a novel algorithm for determining a cooperation strategy that tells providers whether to satisfy users'
resource requests locally or outsource them to a certain provider. The algorithm yields the optimal cooperation
structure from which no provider unilaterally deviates to gain more revenue. Numerical simulations are carried out to
evaluate the performance of the proposed models.
Title :Consistency as a Service: Auditing Cloud Consistency
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/consistency-service-auditing-cloud-consistency
Abstract : Cloud storage services have become commercially popular due to their overwhelming advantages. To
provide ubiquitous always-on access, a cloud service provider (CSP) maintains multiple replicas for each piece of
data on geographically distributed servers. A key problem of using the replication technique in clouds is that it is very
expensive to achieve strong consistency on a worldwide scale. In this paper, we first present a novel consistency as a

7. service (CaaS) model, which consists of a large data cloud and multiple small audit clouds. In the CaaS model, a data
cloud is maintained by a CSP, and a group of users that constitute an audit cloud can verify whether the data cloud
provides the promised level of consistency or not. We propose a two-level auditing architecture, which only requires a
loosely synchronized clock in the audit cloud. Then, we design algorithms to quantify the severity of violations with
two metrics: the commonality of violations, and the staleness of the value of a read. Finally, we devise a heuristic
auditing strategy (HAS) to reveal as many violations as possible. Extensive experiments were performed using a
combination of simulations and real cloud deployments to validate HAS.
IEEE 2014 C# Projects
Title :Panda: Public Auditing for Shared Data with Efficient User Revocation in the Cloud
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/panda-public-auditing-shared-data-efficient-user-revocation-cloud
Abstract : With data storage and sharing services in the cloud, users can easily modify and share data as a group.
To ensure shared data integrity can be verified publicly, users in the group need to compute signatures on all the
blocks in shared data. Different blocks in shared data are generally signed by different users due to data modifications
performed by different users. For security reasons, once a user is revoked from the group, the blocks which were
previously signed by this revoked user must be re-signed by an existing user. The straightforward method, which
allows an existing user to download the corresponding part of shared data and re-sign it during user revocation, is
inefficient due to the large size of shared data in the cloud. In this paper, we propose a novel public auditing
mechanism for the integrity of shared data with efficient user revocation in mind. By utilizing the idea of proxy
re-signatures, we allow the cloud to re-sign blocks on behalf of existing users during user revocation, so that existing
users do not need to download and re-sign blocks by themselves. In addition, a public verifier is always able to audit
the integrity of shared data without retrieving the entire data from the cloud, even if some part of shared data has
been re-signed by the cloud. Moreover, our mechanism is able to support batch auditing by verifying multiple auditing
tasks simultaneously. Experimental results show that our mechanism can significantly improve the efficiency of user
revocation.
Title :Performance and cost evaluation of an adaptive encryption architecture for cloud databases
Language : C#
Project Link :
http://kasanpro.com/p/c-sharp/performance-cost-evaluation-adaptive-encryption-architecture-cloud-databases
Abstract : The cloud database as a service is a novel paradigm that can support several Internet-based applications,
but its adoption requires the solution of information confidentiality problems. We propose a novel architecture for
adaptive encryption of public cloud databases that offers an interesting alternative to the trade-off between the
required data confidentiality level and the flexibility of the cloud database structures at design time. We demonstrate
the feasibility and performance of the proposed solution through a software prototype. Moreover, we propose an
original cost model that is oriented to the evaluation of cloud database services in plain and encrypted instances and
that takes into account the variability of cloud prices and tenant workload during a medium-term period.
Title :An Efficient Certificateless Encryption for Secure Data Sharing in Public Clouds
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/efficient-certificateless-encryption-secure-data-sharing-public-clouds
Abstract : We propose a mediated certificateless encryption scheme without pairing operations for securely sharing
sensitive information in public clouds. Mediated certificateless public key encryption (mCL-PKE) solves the key
escrow problem in identity based encryption and certificate revocation problem in public key cryptography. However,
existing mCL-PKE schemes are either inefficient because of the use of expensive pairing operations or vulnerable
against partial decryption attacks. In order to address the performance and security issues, in this paper, we first
propose a mCL-PKE scheme without using pairing operations. We apply our mCL-PKE scheme to construct a
practical solution to the problem of sharing sensitive information in public clouds. The cloud is employed as a secure
storage as well as a key generation center. In our system, the data owner encrypts the sensitive data using the cloud
generated users' public keys based on its access control policies and uploads the encrypted data to the cloud. Upon
successful authorization, the cloud partially decrypts the encrypted data for the users. The users subsequently fully
decrypt the partially decrypted data using their private keys. The confidentiality of the content and the keys is
preserved with respect to the cloud, because the cloud cannot fully decrypt the information. We also propose an
extension to the above approach to improve the efficiency of encryption at the data owner. We implement our
mCL-PKE scheme and the overall cloud based system, and evaluate its security and performance. Our results show
that our schemes are efficient and practical.

8. Title :An Empirical Performance Evaluation of Relational Keyword Search Systems
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/empirical-performance-evaluation-relational-keyword-search-systems
Abstract : In the past decade, extending the keyword search paradigm to relational data has been an active area of
research within the database and information retrieval (IR) community. A large number of approaches have been
proposed and implemented, but despite numerous publications, there remains a severe lack of standardization for
system evaluations. This lack of standardization has resulted in contradictory results from different evaluations, and
the numerous discrepancies muddle what advantages are proffered by different approaches. In this paper, we present
a thorough empirical performance evaluation of relational keyword search systems. Our results indicate that many
existing search techniques do not provide acceptable performance for realistic retrieval tasks. In particular, memory
consumption precludes many search techniques from scaling beyond small datasets with tens of thousands of
vertices. We also explore the relationship between execution time and factors varied in previous evaluations; our
analysis indicates that these factors have relatively little impact on performance. In summary, our work confirms
previous claims regarding the unacceptable performance of these systems and underscores the need for
standardization--as exemplified by the IR community--when evaluating these retrieval systems.
http://kasanpro.com/ieee/final-year-project-center-perambalur-reviews
Title :Web Image Re-Ranking UsingQuery-Specific Semantic Signatures
Language : ASP.NET with C#
Project Link :
http://kasanpro.com/p/asp-net-with-c-sharp/web-image-re-ranking-usingquery-specific-semantic-signatures
Abstract : Image re-ranking, as an effective way to improve the results of web-based image search, has been
adopted by current commercial search engines. Given a query keyword, a pool of images are first retrieved by the
search engine based on textual information. By asking the user to select a query image from the pool, the remaining
images are re-ranked based on their visual similarities with the query image. A major challenge is that the similarities
of visual features do not well correlate with images' semantic meanings which interpret users' search intention. On the
other hand, learning a universal visual semantic space to characterize highly diverse images from the web is difficult
and inefficient. In this paper, we propose a novel image re-ranking framework, which automatically offline learns
different visual semantic spaces for different query keywords through keyword expansions. The visual features of
images are projected into their related visual semantic spaces to get semantic signatures. At the online stage, images
are re-ranked by comparing their semantic signatures obtained from the visual semantic space specified by the query
keyword. The new approach significantly improves both the accuracy and efficiency of image re-ranking. The original
visual features of thousands of dimensions can be projected to the semantic signatures as short as 25 dimensions.
Experimental results show that 20% ? 35% relative improvement has been achieved on re-ranking precisions
compared with the stateof- the-art methods.
IEEE 2014 C# Projects
Title :Demand Bidding Program and Its Application in Hotel Energy Management
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/demand-bidding-program-its-application-hotel-energy-management
Abstract : Demand bidding program (DBP) is recently adopted in practice by some energy operators. DBP is a
risk-free demand response program targeting large energy consumers. In this paper, we consider DBP with the
application in hotel energy management. For DBP, optimization problem is formulated with the objective of
maximizing expected reward, which is received when the the amount of energy saving satisfies the contract. For a
general distribution of energy consumption, we give a general condition for the optimal bid and outline an algorithm to
find the solution without numerical integration. Furthermore, for Gaussian distribution, we derive closed-form
expressions of the optimal bid and the corresponding expected reward. Regarding hotel energy, we characterize
loads in the hotel and introduce several energy consumption models that capture major energy use. With the
proposed models and DBP, simulation results show that DBP provides economics benefits to the hotel and
encourages load scheduling. Furthermore, when only mean and variance of energy consumption are known, the
validity of Gaussian approximation for computing optimal load and expected reward is also discussed.
Title :Incremental Affinity Propagation Clustering Based on Message Passing
Language : C#

9. Project Link : http://kasanpro.com/p/c-sharp/incremental-affinity-propagation-clustering-based-message-passing
Abstract : Affinity Propagation (AP) clustering has been successfully used in a lot of clustering problems. However,
most of the applications deal with static data. This paper considers how to apply AP in incremental clustering
problems. Firstly, we point out the difficulties in Incremental Affinity Propagation (IAP) clustering, and then propose
two strategies to solve them. Correspondingly, two IAP clustering algorithms are proposed. They are IAP clustering
based on K-Medoids (IAPKM) and IAP clustering based on Nearest Neighbor Assignment (IAPNA). Five popular
labeled data sets, real world time series and a video are used to test the performance of IAPKM and IAPNA.
Traditional AP clustering is also implemented to provide benchmark performance. Experimental results show that
IAPKM and IAPNA can achieve comparable clustering performance with traditional AP clustering on all the data sets.
Meanwhile, the time cost is dramatically reduced in IAPKM and IAPNA. Both the effectiveness and the efficiency
make IAPKM and IAPNA able to be well used in incremental clustering tasks.
Title :Incremental Detection of Inconsistencies in Distributed Data
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/incremental-detection-inconsistencies-distributed-data
Abstract : This paper investigates incremental detection of errors in distributed data. Given a distributed database D,
a set of conditional functional dependencies (CFDs), the set V of violations of the CFDs in D, and updates D to D, it is
to find, with minimum data shipment, changes V to V in response to D. The need for the study is evident since real-life
data is often dirty, distributed and frequently updated. It is often prohibitively expensive to recompute the entire set of
violations when D is updated. We show that the incremental detection problem is NP-complete for database D that is
partitioned either vertically or horizontally, even when and D are fixed. Nevertheless, we show that it is bounded: there
exist algorithms to detect errors such that their computational cost and data shipment are both linear in the size of D
and V, independent of the size of the database D. We provide such incremental algorithms for vertically partitioned
data and horizontally partitioned data, and show that the algorithms are optimal. We further propose optimization
techniques for the incremental algorithm over vertical partitions to reduce data shipment. We verify experimentally,
using real-life data on Amazon Elastic Compute Cloud (EC2), that our algorithms substantially outperform their batch
counterparts.
Title :Keyword Query Routing
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/keyword-query-routing
Abstract : Keyword search is an intuitive paradigm for searching linked data sources on the web. We propose to
route keywords only to relevant sources to reduce the high cost of processing keyword search queries over all
sources. We propose a novel method for computing top-k routing plans based on their potentials to contain results for
a given keyword query. We employ a keyword-element relationship summary that compactly represents relationships
between keywords and the data elements mentioning them. A multilevel scoring mechanism is proposed for
computing the relevance of routing plans based on scores at the level of keywords, data elements, element sets, and
subgraphs that connect these elements. Experiments carried out using 150 publicly available sources on the web
showed that valid plans (precision@1 of 0.92) that are highly relevant (mean reciprocal rank of 0.89) can be
computed in 1 second on average on a single PC. Further, we show routing greatly helps to improve the performance
of keyword search, without compromising its result quality.
Title :Personalized Recommendation Combining User Interest and Social Circle
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/personalized-recommendation-combining-user-interest-social-circle
Abstract : With the advent and popularity of social network, more and more users like to share their experiences,
such as ratings, reviews, and blogs. The new factors of social network like interpersonal influence and interest based
on circles of friends bring opportunities and challenges for recommender system (RS) to solve the cold start and
sparsity problem of datasets. Some of the social factors have been used in RS, but have not been fully considered. In
this paper, three social factors, personal interest, interpersonal interest similarity, and interpersonal influence, fuse
into a unified personalized recommendation model based on probabilistic matrix factorization. The factor of personal
interest can make the RS recommend items to meet users' individualities, especially for experienced users. Moreover,
for cold start users, the interpersonal interest similarity and interpersonal influence can enhance the intrinsic link
among features in the latent space. We conduct a series of experiments on three rating datasets: Yelp, MovieLens,
and Douban Movie. Experimental results show the proposed approach outperforms the existing RS approaches.

10. IEEE 2014 C# Projects
Title :Cloud-Assisted Mobile-Access of Health Data With Privacy and Auditability
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/cloud-assisted-mobile-access-health-data-with-privacy-auditability
Abstract : Motivated by the privacy issues, curbing the adoption of electronic healthcare systems and the wild
success of cloud service models, we propose to build privacy into mobile healthcare systemswith the help of the
private cloud. Our system offers salient features including efficient key management, privacy-preserving data storage,
and retrieval, especially for retrieval at emergencies, and auditability for misusing health data. Specifically, we
propose to integrate key management from pseudorandom number generator for unlinkability, a secure indexing
method for privacypreserving keyword searchwhich hides both search and access patterns based on redundancy,
and integrate the concept of attributebased encryption with threshold signing for providing role-based access control
with auditability to prevent potential misbehavior, in both normal and emergency cases.
Title :Efficient Authentication for Mobile and Pervasive Computing
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/efficient-authentication-mobile-pervasive-computing
Abstract : With today's technology, many applications rely on the existence of small devices that can exchange
information and form communication networks. In a significant portion of such applications, the confidentiality and
integrity of the communicated messages are of particular interest. In this work, we propose two novel techniques for
authenticating short encrypted messages that are directed to meet the requirements of mobile and pervasive
applications. By taking advantage of the fact that the message to be authenticated must also be encrypted, we
propose provably secure authentication codes that are more efficient than any message authentication code in the
literature. The key idea behind the proposed techniques is to utilize the security that the encryption algorithm can
provide to design more efficient authentication mechanisms, as opposed to using standalone authentication
primitives.
http://kasanpro.com/ieee/final-year-project-center-perambalur-reviews
Title :Map-Aware Models for Indoor Wireless Localization Systems: An Experimental Study
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/map-aware-models-indoor-wireless-localization-systems
Abstract : The accuracy of indoor wireless localization systems can be substantially enhanced by map-awareness,
i.e., by the knowledge of the map of the environment in which localization signals are acquired. In fact, this knowledge
can be exploited to cancel out, at least to some extent, the signal degradation due to propagation through physical
obstructions, i.e., to the so called non-line-of-sight bias. This result can be achieved by developing novel localization
techniques that rely on proper mapaware statistical modelling of the measurements they process. In this manuscript a
unified statistical model for the measurements acquired in map-aware localization systems based on time-ofarrival
and received signal strength techniques is developed and its experimental validation is illustrated. Finally, the
accuracy of the proposed map-aware model is assessed and compared with that offered by its map-unaware
counterparts. Our numerical results show that, when the quality of acquired measurements is poor, map-aware
modelling can enhance localization accuracy by up to 110% in certain scenarios.
Title :Preserving Location Privacy in Geo-Social Applications
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/preserving-location-privacy-geo-social-applications
Abstract : Using geo-social applications, such as FourSquare, millions of people interact with their surroundings
through their friends and their recommendations. Without adequate privacy protection, however, these systems can
be easily misused, e.g., to track users or target them for home invasion. In this paper, we introduce LocX, a novel
alternative that provides significantly-improved location privacy without adding uncertainty into query results or relying
on strong assumptions about server security. Our key insight is to apply secure user-specific, distance-preserving
coordinate transformations to all location data shared with the server. The friends of a user share this user's secrets
so they can apply the same transformation. This allows all location queries to be evaluated correctly by the server, but

11. our privacy mechanisms guarantee that servers are unable to see or infer the actual location data from the
transformed data or from the data access. We show that LocX provides privacy even against a powerful adversary
model, and we use prototype measurements to show that it provides privacy with very little performance overhead,
making it suitable for today's mobile devices.
Title :Privacy-Preserving Optimal Meeting Location Determination on Mobile Devices
Language : C#
Project Link :
http://kasanpro.com/p/c-sharp/privacy-preserving-optimal-meeting-location-determination-mobile-devices
Abstract : Equipped with state-of-the-art smartphones and mobile devices, today's highly interconnected urban
population is increasingly dependent on these gadgets to organize and plan their daily lives. These applications often
rely on current (or preferred) locations of individual users or a group of users to provide the desired service, which
jeopardizes their privacy; users do not necessarily want to reveal their current (or preferred) locations to the service
provider or to other, possibly untrusted, users. In this paper, we propose privacy-preserving algorithms for determining
an optimal meeting location for a group of users. We perform a thorough privacy evaluation by formally quantifying
privacy-loss of the proposed approaches. In order to study the performance of our algorithms in a real deployment,
we implement and test their execution efficiency on Nokia smartphones. By means of a targeted user-study, we
attempt to get an insight into the privacy-awareness of users in locationbased services and the usability of the
proposed solutions.
IEEE 2014 C# Projects
Title :Cooperation Versus Multiplexing: Multicast Scheduling Algorithms for OFDMA Relay Networks
Language : C#
Project Link :
http://kasanpro.com/p/c-sharp/cooperation-versus-multiplexing-multicast-scheduling-algorithms-ofdma-relay-networks
Abstract : With the next-generation cellular networks making a transition toward smaller cells, two-hop orthogonal
frequency-division multiple access (OFDMA) relay networks have become a dominant, mandatory component in the
4G standards (WiMAX 802.16j, 3GPP LTE-Adv). While unicast flows have received reasonable attention in two-hop
OFDMA relay networks, not much light has been shed on the design of efficient scheduling algorithms for multicast
flows. Given the growing importance of multimedia broadcast and multicast services (MBMS) in 4G networks, the
latter forms the focus of this paper. We show that while relay cooperation is critical for improving multicast
performance, it must be carefully balanced with the ability to multiplex multicast sessions and hence maximize
aggregate multicast flow. To this end, we highlight strategies that carefully group relays for cooperation to achieve this
balance. We then solve the multicast scheduling problem under two OFDMA subchannelization models. We establish
the NP-hardness of the scheduling problem even for the simpler model and provide efficient algorithms with
approximation guarantees under both models. Evaluation of the proposed solutions reveals the efficiency of the
scheduling algorithms as well as the significant benefits obtained from the multicasting strategy.
Title :D2P: Distributed Dynamic Pricing Policy in Smart Grid for PHEVs Management
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/d2p-distributed-dynamic-pricing-policy-smart-grid-phevs-management
Abstract : Future large-scale deployment of plug-in hybrid electric vehicles (PHEVs) will render massive energy
demand on the electric grid during peak-hours. We propose an intelligent distributed dynamic pricing (D2P)
mechanism for the charging of PHEVs in a smart grid architecture -- an effort towards optimizing the energy
consumption profile of PHEVs users. Each micro-grid decides real-time dynamic price as home-price and
roaming-price, depending on the supply-demand curve, to optimize its revenue. Consequently, two types of energy
services are considered -- home micro-grid energy, and foreign microgrid energy. After designing the PHEVs' mobility
and battery models, the pricing policies for the home-price and the roamingprice are presented. A decision making
process to implement a cost-effective charging and discharging method for PHEVs is also demonstrated based on the
real-time price decided by the micro-grids. We evaluate and compare the results of distributed pricing policy with other
existing centralized/distributed ones. Simulation results show that using the proposed architecture, the utility
corresponding to the PHEVs increases by approximately 34% over that of the existing ones for optimal charging of
PHEVs.
Title :Retransmission Delays With Bounded Packets: Power-Law Body and Exponential Tail
Language : C#

12. Project Link :
http://kasanpro.com/p/c-sharp/retransmission-delays-with-bounded-packets-power-law-body-exponential-tail
Abstract : Retransmissions serve as the basic building block that communication protocols use to achieve reliable
data transfer. Until recently, the number of retransmissions was thought to follow a geometric (light-tailed) distribution.
However, recent work shows that when the distribution of the packet sizes have infinite support, retransmission-based
protocols may result in heavy-tailed delays and possibly zero throughput even when the aforementioned distribution is
light-tailed. In reality, however, packet sizes are often bounded by the maximum transmission unit (MTU), and thus
the aforementioned result merits a deeper investigation. To that end, in this paper, we allow the distribution of the
packet size to have finite support. Under mild conditions, we show that the transmission duration distribution exhibits
a transition from a power-law main body to an exponential tail. The timescale to observe the power-law main body is
roughly equal to the average transmission duration of the longest packet. The power-law main body, if significant,
may cause the channel throughput to be very close to zero. These theoretical findings provide an understanding on
why some empirical measurements suggest heavy tails. We use these results to further highlight the engineering
implications of distributions with power-law main bodies and light tails by analyzing two cases: 1) the throughput of
ON-OFF channels with retransmissions, where we show that even when packet sizes have small means and
bounded support the variability in their sizes can greatly impact system performance; 2) the distribution of the number
of jobs in an queue with server failures. Here, we show that retransmissions can cause long-range dependence and
quantify the impact of the maximum job sizes on the long-range dependence.
Title :Secure Data Retrieval for Decentralized Disruption-Tolerant Military Networks
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/secure-data-retrieval-decentralized-disruption-tolerant-military-networks
Abstract : Mobile nodes in military environments such as a battlefield or a hostile region are likely to suffer from
intermittent network connectivity and frequent partitions. Disruption-tolerant network (DTN) technologies are
becoming successful solutions that allow wireless devices carried by soldiers to communicate with each other and
access the confidential information or command reliably by exploiting external storage nodes. Some of the most
challenging issues in this scenario are the enforcement of authorization policies and the policies update for secure
data retrieval. Ciphertext-policy attribute-based encryption (CP-ABE) is a promising cryptographic solution to the
access control issues. However, the problem of applying CP-ABE in decentralized DTNs introduces several security
and privacy challenges with regard to the attribute revocation, key escrow, and coordination of attributes issued from
different authorities. In this paper, we propose a secure data retrieval scheme using CP-ABE for decentralized DTNs
where multiple key authorities manage their attributes independently. We demonstrate how to apply the proposed
mechanism to securely and efficiently manage the confidential data distributed in the disruption-tolerant military
network.
Title :A Hybrid Cloud Approach for Secure Authorized Deduplication
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/hybrid-cloud-secure-authorized-deduplication
Abstract : Data deduplication is one of important data compression techniques for eliminating duplicate copies of
repeating data, and has been widely used in cloud storage to reduce the amount of storage space and save
bandwidth. To protect the confidentiality of sensitive data while supporting deduplication, the convergent encryption
technique has been proposed to encrypt the data before outsourcing. To better protect data security, this paper
makes the first attempt to formally address the problem of authorized data deduplication. Different from traditional
deduplication systems, the differential privileges of users are further considered in duplicate check besides the data
itself.We also present several new deduplication constructions supporting authorized duplicate check in a hybrid cloud
architecture. Security analysis demonstrates that our scheme is secure in terms of the definitions specified in the
proposed security model. As a proof of concept, we implement a prototype of our proposed authorized duplicate
check scheme and conduct testbed experiments using our prototype. We show that our proposed authorized
duplicate check scheme incurs minimal overhead compared to normal operations.
IEEE 2014 C# Projects
Title :Behavior Rule Specification-based Intrusion Detection for Safety Critical Medical Cyber Physical Systems
Language : C#
Project Link :
http://kasanpro.com/p/c-sharp/behavior-rule-specification-based-intrusion-detection-cyber-physical-systems
Abstract : We propose and analyze a behavior-rule specification-based technique for intrusion detection of medical

13. devices embedded in a medical cyber physical system (MCPS) in which the patient's safety is of the utmost
importance. We propose a methodology to transform behavior rules to a state machine, so that a device that is being
monitored for its behavior can easily be checked against the transformed state machine for deviation from its behavior
specification. Using vital sign monitor medical devices as an example, we demonstrate that our intrusion detection
technique can effectively trade false positives off for a high detection probability to cope with more sophisticated and
hidden attackers to support ultra safe and secure MCPS applications. Moreover, through a comparative analysis, we
demonstrate that our behavior-rule specificationbased IDS technique outperforms two existing anomaly-based
techniques for detecting abnormal patient behaviors in pervasive healthcare applications.
Title :Community-home-based Multi-copy Routing in Mobile Social Networks
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/community-home-based-multi-copy-routing-mobile-social-networks
Abstract : A mobile social network (MSN) is a special kind of delay tolerant network (DTN) composed of mobile
nodes that move around and share information with each other through their carried short-distance wireless
communication devices. A main characteristic of MSNs is that mobile nodes in the networks generally visit some
locations (namely, community homes) frequently, while visiting other locations less frequently. In this paper, we
propose a novel zero-knowledge multi-copy routing algorithm, homing spread (HS), for homogeneous MSNs, in which
all mobile nodes share all community homes. HS is a distributed and localized algorithm. It mainly lets community
homes spread messages with a higher priority. Theoretical analysis shows that HS can spread a given number of
message copies in an optimal way when the inter-meeting time between any two nodes and between a node and a
community home follows independent and identical exponential distributions, respectively. We also extend HS to the
heterogeneous MSNs, where mobile nodes have different community homes. In addition, we calculate the expected
delivery delay of HS, and conduct extensive simulations. Results show that community homes are important factors in
message spreading. By using homes to spread messages faster, HS achieves a better performance than existing
zero-knowledge MSN routing algorithms, including Epidemic (with a given number of copies), and Spray&Wait.
Title :Decentralized Access Control with Anonymous Authentication of Data Stored in Clouds
Language : C#
Project Link :
http://kasanpro.com/p/c-sharp/decentralized-access-control-anonymous-authentication-data-stored-clouds
Abstract : We propose a new decentralized access control scheme for secure data storage in clouds, that supports
anonymous authentication. In the proposed scheme, the cloud verifies the authenticity of the ser without knowing the
user's identity before storing data. Our scheme also has the added feature of access control in which only valid users
are able to decrypt the stored information. The scheme prevents replay attacks and supports creation, modification,
and reading data stored in the cloud. We also address user revocation. Moreover, our authentication and access
control scheme is decentralized and robust, unlike other access control schemes designed for clouds which are
centralized. The communication, computation, and storage overheads are comparable to centralized approaches.
Title :Exploiting Service Similarity for Privacy in Location Based Search Queries
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/exploiting-service-similarity-privacy-location-based-search-queries
Abstract : Location-based applications utilize the positioning capabilities of a mobile device to determine the current
location of a user, and customize query results to include neighboring points of interests. However, location
knowledge is often perceived as personal information. One of the immediate issues hindering the wide acceptance of
location-based applications is the lack of appropriate methodologies that offer fine grain privacy controls to a user
without vastly affecting the usability of the service. While a number of privacy-preserving models and algorithms have
taken shape in the past few years, there is an almost universal need to specify one's privacy requirement without
understanding its implications on the service quality. In this paper, we propose a user-centric location- based service
architecture where a user can observe the impact of location inaccuracy on the service accuracy before deciding the
geo-coordinates to use in a query. We construct a local search application based on this architecture and
demonstrate how meaningful information can be exchanged between the user and the service provider to allow the
inference of contours depicting the change in query results across a geographic area. Results indicate the possibility
of large default privacy regions (areas of no change in result set) in such applications.
Title :Expressive, Efficient, and Revocable Data Access Control for Multi-Authority Cloud Storage
Language : C#
Project Link :

14. http://kasanpro.com/p/c-sharp/expressive-efficient-revocable-data-access-control-multi-authority-cloud-storage
Abstract : Data access control is an effective way to ensure the data security in the cloud. Due to data outsourcing
and untrusted cloud servers, the data access control becomes a challenging issue in cloud storage systems.
Ciphertext-Policy Attribute-based Encryption (CP-ABE) is regarded as one of the most suitable technologies for data
access control in cloud storage, because it gives data owners more direct control on access policies. However, it is
difficult to directly apply existing CP-ABE schemes to data access control for cloud storage systems because of the
attribute revocation problem. In this paper, we design an expressive, efficient and revocable data access control
scheme for multi-authority cloud storage systems, where there are multiple authorities co-exist and each authority is
able to issue attributes independently. Specifically, we propose a revocable multi-authority CP-ABE scheme, and
apply it as the underlying techniques to design the data access control scheme. Our attribute revocation method can
efficiently achieve both forward security and backward security. The analysis and simulation results show that our
proposed data access control scheme is secure in the random oracle model and is more efficient than previous
works.
IEEE 2014 C# Projects
Title :Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/key-aggregate-cryptosystem-scalable-data-sharing-cloud-storage
Abstract : Data sharing is an important functionality in cloud storage. In this article, we show how to securely,
efficiently, and flexibly share data with others in cloud storage. We describe new public-key cryptosystems which
produce constant-size ciphertexts such that efficient delegation of decryption rights for any set of ciphertexts are
possible. The novelty is that one can aggregate any set of secret keys and make them as compact as a single key,
but encompassing the power of all the keys being aggregated. In other words, the secret key holder can release a
constant-size aggregate key for flexible choices of ciphertext set in cloud storage, but the other encrypted files outside
the set remain confidential. This compact aggregate key can be conveniently sent to others or be stored in a smart
card with very limited secure storage. We provide formal security analysis of our schemes in the standard model. We
also describe other application of our schemes. In particular, our schemes give the first public-key patient-controlled
encryption for flexible hierarchy, which was yet to be known.
Title :Link Quality Aware Code Dissemination in Wireless Sensor Networks
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/link-quality-aware-dissemination-wireless-sensor-networks
Abstract : Wireless reprogramming is a crucial technique for software deployment in wireless sensor networks
(WSNs). Code dissemination is a basic building block to enable wireless reprogramming. We present ECD, an
Efficient Code Dissemination protocol leveraging 1-hop link quality information based on the TinyOS platform.
Compared to prior works, ECD has three salient features. First, it supports dynamically configurable packet sizes. By
increasing the packet size for high PHY rate radios, it significantly improves the transmission efficiency. Second, it
employs an accurate sender selection algorithm to mitigate transmission collisions and transmissions over poor links.
Third, it employs a simple impact-based backoff timer design to shorten the time spent in coordinating multiple eligible
senders so that the largest impact sender is most likely to transmit. We implement ECD based on TinyOS and
evaluate its performance extensively via testbed experiments and simulations. Results show that ECD outperforms
state-of-the-art protocols, Deluge and MNP, in terms of completion time and data traffic (e.g., about 20 percent less
traffic and 20-30 percent shorter completion time compared to Deluge).
Title :On the Security of Trustee-Based Social Authentications
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/on-security-trustee-based-social-authentications
Abstract : Recently, authenticating users with the help of their friends (i.e., trustee-based social authentication) has
been shown to be a promising backup authentication mechanism. A user in this system is associated with a few
trustees that were selected from the user's friends. When the user wants to regain access to the account, the service
provider sends different verification codes to the user's trustees. The user must obtain at least k (i.e., recovery
threshold) verification codes from the trustees before being directed to reset his or her password. In this paper, we
provide the first systematic study about the security of trusteebased social authentications. In particular, we first
introduce a novel framework of attacks, which we call forest fire attacks. In these attacks, an attacker initially obtains a
small number of compromised users, and then the attacker iteratively attacks the rest of users by exploiting

15. trustee-based social authentications. Then, we construct a probabilistic model to formalize the threats of forest fire
attacks and their costs for attackers. Moreover, we introduce various defense strategies. Finally, we apply our
framework to extensively evaluate various concrete attack and defense strategies using three real-world social
network datasets. Our results have strong implications for the design of more secure trustee-based social
authentications.
http://kasanpro.com/ieee/final-year-project-center-perambalur-reviews
Title :QoS Aware Geographic Opportunistic Routing in Wireless Sensor Networks
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/qos-aware-geographic-opportunistic-routing-wireless-sensor-networks
Abstract : QoS routing is an important research issue in wireless sensor networks (WSNs), especially for
mission-critical monitoring and surveillance systems which requires timely and reliable data delivery. Existing work
exploits multipath routing to guarantee both reliability and delay QoS constraints in WSNs. However, the multipath
routing approach suffers from a significant energy cost. In this work, we exploit the geographic opportunistic routing
(GOR) for QoS provisioning with both end-to-end reliability and delay constraints in WSNs. Existing GOR protocols
are not efficient for QoS provisioning in WSNs, in terms of the energy efficiency and computation delay at each hop.
To improve the efficiency of QoS routing in WSNs, we define the problem of efficient GOR for multiconstrained QoS
provisioning in WSNs, which can be formulated as a multiobjective multiconstraint optimization problem. Based on the
analysis and observations of different routing metrics in GOR, we then propose an Efficient QoS-aware GOR
(EQGOR) protocol for QoS provisioning in WSNs. EQGOR selects and prioritizes the forwarding candidate set in an
efficient manner, which is suitable for WSNs in respect of energy efficiency, latency, and time complexity. We
comprehensively evaluate EQGOR by comparing it with the multipath routing approach and other baseline protocols
through ns-2 simulation and evaluate its time complexity through measurement on the MicaZ node. Evaluation results
demonstrate the effectiveness of the GOR approach for QoS provisioning in WSNs. EQGOR significantly improves
both the end-to-end energy efficiency and latency, and it is characterized by the low time complexity.
Title :Secure Deduplication with Efficient and Reliable Convergent Key Management
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/secure-deduplication-efficient-reliable-convergent-key-management
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. Promising as it is, an arising challenge is to perform
secure deduplication in cloud storage. Although convergent encryption has been extensively adopted for secure
deduplication, a critical issue of making convergent encryption practical is to efficiently and reliably manage a huge
number of convergent keys. This paper makes the first attempt to formally address the problem of achieving efficient
and reliable key management in secure deduplication. We first introduce a baseline approach in which each user
holds an independent master key for encrypting the convergent keys and outsourcing them to the cloud. However,
such a baseline key management scheme generates an enormous number of keys with the increasing number of
users and requires users to dedicatedly protect the master keys. To this end, we propose Dekey, a new construction
in which users do not need to manage any keys on their own but instead securely distribute the convergent key
shares across multiple servers. Security analysis demonstrates that Dekey is secure in terms of the definitions
specified in the proposed security model. As a proof of concept, we implement Dekey using the Ramp secret sharing
scheme and demonstrate that Dekey incurs limited overhead in realistic environments.
IEEE 2014 C# Projects