2DCRYPT: IMAGE SCALING AND CROPPING IN ENCRYPTED DOMAINS

ABSTRACT

The evolution of cloud computing and a drastic increase in image size are making the
outsourcing of image storage and processing an attractive business model. Although this
outsourcing has many advantages, ensuring data confidentiality in the cloud is one of the
main concerns. There are state-of-the-art encryption schemes for ensuring confidentiality in
the cloud. However, such schemes do not allow cloud datacenters to perform operations over
encrypted images. In this paper, we address this concern by proposing 2DCrypt, a modified
Paillier cryptosystem-based image scaling and cropping scheme for multi-user settings that
allows cloud datacenters to scale and crop an image in the encrypted domain. To anticipate a
high storage overhead resulted from the naive per-pixel encryption, we propose a space-
efficient tiling scheme that allows tile-level image scaling and cropping operations. Basically,
instead of encrypting each pixel individually, we are able to encrypt a tile of pixels. 2DCrypt
is such that multiple users can view or process the images without sharing any encryption
keys – a requirement desirable for practical deployments in real organizations. Our analysis
and results show that 2DCrypt is IND-CPA secure and incurs an acceptable overhead. When
scaling a 512 x 512 image by a factor of two, 2DCrypt requires an image user to download
approximately 5:3 times more data than the un-encrypted scaling and need to work
approximately 2:3 seconds more for obtaining the scaled image in plaintext.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 A CROWDSOURCING WORKER QUALITY EVALUATION ALGORITHM ON
MAPREDUCE FOR BIG DATA APPLICATIONS

ABSTRACT

Crowd sourcing is a new emerging distributed computing and business model on the
backdrop of Internet blossoming. With the development of crowd sourcing systems, the data
size of crowdsourcers, contractors and tasks grows rapidly. The worker quality evaluation
based on big data analysis technology has become a critical challenge. This paper first
proposes a general worker quality evaluation algorithm that is applied to any critical tasks
such as tagging, matching, filtering, categorization and many other emerging applications,
without wasting resources. Second, we realize the evaluation algorithm in the Hadoop
platform using the Map Reduce parallel programming model. Finally, to effectively verify the
accuracy and the effectiveness of the algorithm in a wide variety of big data scenarios, we
conduct a series of experiments. The experimental results demonstrate that the proposed
algorithm is accurate and effective. It has high computing performance and horizontal
scalability. And it is suitable for large-scale worker quality evaluations in a big data
environment.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 A LOCALITY SENSITIVE LOW-RANK MODEL
FOR IMAGE TAG COMPLETION

ABSTRACT

Many visual applications have benefited from the outburst of web images, yet the imprecise
and incomplete tags arbitrarily provided by users, as the thorn of the rose, may hamper the
performance of retrieval or indexing systems relying on such data. In this paper, we propose a
novel locality sensitive low-rank model for image tag completion, which approximates the
global nonlinear model with a collection of local linear models. To effectively infuse the idea
of locality sensitivity, a simple and effective pre-processing module is designed to learn
suitable representation for data partition, and a global consensus regularizer is introduced to
mitigate the risk of overfitting. Meanwhile, low-rank matrix factorization is employed as
local models, where the local geometry structures are preserved for the low-dimensional
representation of both tags and samples. Extensive empirical evaluations conducted on three
datasets demonstrate the effectiveness and efficiency of the proposed method, where our
method outperforms pervious ones by a large margin.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 A Scalable Approach for Content-Based Image Retrieval in Peer-to-Peer Networks

ABSTRACT

Peer-to-peer networking offers a scalable solution for sharing multimedia data across
the network. With a large amount of visual data distributed among different nodes, it is an
important but challenging issue to perform content-based retrieval in peer-to-peer networks.
While most of the existing methods focus on indexing high dimensional visual features and
have limitations of scalability, in this paper we propose a scalable approach for content-based
image retrieval in peer-to-peer networks by employing the bag-of-visual-words model.
Compared with centralized environments, the key challenge is to efficiently obtain a global
codebook, as images are distributed across the whole peer-to-peer network. In addition, a
peer-to-peer network often evolves dynamically, which makes a static codebook less
effective for retrieval tasks. Therefore, we propose a dynamic codebook updating method by
optimizing the mutual information between the resultant codebook and relevance
information, and the workload balance among nodes that manage different codeword’s. In
order to further improve retrieval performance and reduce network cost, indexing pruning
techniques are developed. Our comprehensive experimental results indicate that the proposed
approach is scalable in evolving and distributed peer-to-peer networks, while achieving
improved retrieval accuracy.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
A SHOULDER SURFING RESISTANT GRAPHICAL AUTHENTICATION SYSTEM

ABSTRACT

Authentication based on passwords is used largely in applications for computer security and
privacy. However, human actions such as choosing bad passwords and inputting passwords in
an insecure way are regarded as”the weakest link” in the authentication chain. Rather than
arbitrary alphanumeric strings, users tend to choose passwords either short or meaningful for
easy memorization. With web applications and mobile apps piling up, people can access
these applications anytime and anywhere with various devices. This evolution brings great
convenience but also increases the probability of exposing passwords to shoulder surfing
attacks. Attackers can observe directly or use external recording devices to collect users’
credentials. To overcome this problem, we proposed a novel authentication system
PassMatrix, based on graphical passwords to resist shoulder surfing attacks. With a one-time
valid login indicator and circulative horizontal and vertical bars covering the entire scope of
pass-images, PassMatrix offers no hint for attackers to figure out or narrow down the
password even they conduct multiple camera-based attacks. We also implemented a
PassMatrix prototype on Android and carried out real user experiments to evaluate its
memorability and usability. From the experimental result, the proposed system achieves
better resistance to shoulder surfing attacks while maintaining usability.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 ActiveTrust Secure and Trustable Routing in Wireless Sensor Network

ABSTRACT

Wireless Sensor Networks (WSNs) are emerging as a promising technology because

of their wide range of applications in industrial, environmental monitoring, etc. Because of
their inherent resource-constrained characteristics, they are prone to various security attacks,
and a black hole attack is a type of attack that seriously affects data collection. The current
trust-based route strategies face some challenging issues: (1) the core of a trust route lies in
obtaining trust. (2) Energy efficiency. Because it is difficult to locate malicious nodes, the
security route is still a challenging issue. Thus, there are still issues worthy of further study.
Security and trust routing through an active detection route protocol is proposed in this
project. The ActiveTrust scheme fully uses residue energy to construct multiple detection
routes. The theoretical analysis and experimental results have shown that our scheme
improves the successful routing probability by more than 3 times, up to 10 times in some
cases.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 ATTRIBUTE BASED DATA SHARING SCHEMA REVISITED IN CLOUD
COMPUTING

ABSTRACT

Ciphertext-policy attribute-based encryption (CP-ABE) is a very promising encryption

technique for secure data sharing in the context of cloud computing. Data owner is allowed to
fully control the access policy associated with his data which to be shared. However, CP-
ABE is limited to a potential security risk that is known as key escrow problem, whereby the
secret keys of users have to be issued by a trusted key authority. Besides, most of the existing
CP-ABE schemes cannot support attribute with arbitrary state. In this paper, we revisit
attribute-based data sharing scheme in order to solve the key escrow issue but also improve
the expressiveness of attribute, so that the resulting scheme is more friendly to cloud
computing applications. We propose an improved two-party key issuing protocol that can
guarantee that neither key authority nor cloud service provider can compromise the whole
secret key of a user individually. Moreover, we introduce the concept of attribute with
weight, being provided to enhance the expression of attribute, which can not only extend the
expression from binary to arbitrary state, but also lighten the complexity of access policy.
Therefore, both storage cost and encryption complexity for a ciphertext are relieved. The
performance analysis and the security proof show that the proposed scheme is able to achieve
efficient and secure data sharing in cloud computing.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 CDSTORE: TOWARD RELIABLE, SECURE, AND COST-EFFICIENT CLOUD
STORAGE VIA CONVERGENT DISPERSAL

ABSTRACT

We present CDStore, a unified multi-cloud storage solution for users to outsource backup
data with reliability, security, and cost efficiency guarantees. CDStore builds on an
augmented secret sharing scheme called convergent dispersal, which supports deduplication
by using deterministic content-derived hashes as inputs to secret sharing. We present the
design of CDStore, and in particular, describe how it combines convergent dispersal with
two-stage deduplication to achieve both bandwidth and storage savings and also be robust
against side-channel attacks that can be launched by a malicious user on the client side. We
demonstrate via cost analysis that CDStore achieves significant monetary cost savings over
baseline cloud storage solutions.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 AN EFFECTIVE RE-CLUSTER BASED SUBSET SELECTION USING MST AND
HEURISTIC ALGORITHM

ABSTRACT

Data streams are massive, fast-changing, and in-finite. Clustering is a prominent task in
mining data streams, which group similar objects in a cluster. With the aim of choosing a Re-
Cluster subset of good features with respect to the target concepts, feature subset selection is
an effective way for reducing dimensionality, removing irrelevant data, increasing learning
accuracy, and improving result comprehensibility. While the efficiency concerns the time
required to find a re-cluster subset of features, the effectiveness is related to the quality of the
subset of features. In this project, proposed clustering based subset selection algorithm works
in two steps. In the first step, features are divided into clusters by using graph-theoretic
clustering methods. In the second step, the most representative feature that is strongly related
to target classes is selected from each cluster to form a subset of features. To ensure the
efficiency of this algorithm, we are going to use mRMR method with heuristic algorithm.
A heuristic algorithm used for solving a problem more quickly or for finding an approximate
re-cluster subset selection solution. Minimum Redundancy Maximum Relevance (mRMR)
selection used to be more powerful than the maximum relevance selection. It will provide
effective way to predict the efficiency and effectiveness of the clustering based subset
selection algorithm.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 CONNECTING SOCIAL MEDIA TO E-COMMERCE: COLD-START PRODUCT
RECOMMENDATION USING MICROBLOGGING INFORMATION
ABSTRACT
In recent years, the boundaries between e-commerce and social networking have become
increasingly blurred. Many e-commerce websites support the mechanism of social login
where users can sign on the websites using their social network identities such as their
Facebook or Twitter accounts. Users can also post their newly purchased products on
microblogs with links to the e-commerce product web pages. In this paper we propose a
novel solution for cross-site cold-start product recommendation, which aims to recommend
products from e-commerce websites to users at social networking sites in “coldstart”
situations, a problem which has rarely been explored before. A major challenge is how to
leverage knowledge extracted from social networking sites for cross-site cold-start product
recommendation. We propose to use the linked users across social networking sites and e-
commerce websites (users who have social networking accounts and have made purchases on
e-commerce websites) as a bridge to map users’ social networking features to another feature
representation for product recommendation. In specific, we propose learning both users’ and
products’ feature representations (called user embeddings and product embeddings,
respectively) from data collected from e-commerce websites using recurrent neural networks
and then apply a modified gradient boosting trees method to transform users’ social
networking features into user embeddings. We then develop a feature-based matrix
factorization approach which can leverage the learnt user embeddings for cold-start product
recommendation. Experimental results on a large dataset constructed from the largest Chinese
microblogging service SINA WEIBO and the largest Chinese B2C e-commerce website
JINGDONG have shown the effectiveness of our proposed framework.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 DEYPOS: DEDUPLICATABLE DYNAMIC PROOF OF STORAGE FOR MULTI-
USER ENVIRONMENTS

ABSTRACT

Dynamic Proof of Storage (PoS) is a useful cryptographic primitive that enables a user to
check the integrity of outsourced files and to efficiently update the files in a cloud server.
Although researchers have proposed many dynamic PoS schemes in singleuser environments,
the problem in multi-user environments has not been investigated sufficiently. A practical
multi-user cloud storage system needs the secure client-side cross-user deduplication
technique, which allows a user to skip the uploading process and
obtain the ownership of the files immediately, when other owners of the same files have
uploaded them to the cloud server. To the best of our knowledge, none of the existing
dynamic PoSs can support this technique. In this paper, we introduce the concept of
deduplicatable dynamic proof of storage and propose an efficient construction called
DeyPoS, to achieve dynamic PoS and secure cross-user deduplication, simultaneously.
Considering the challenges of structure diversity and private tag generation, we exploit a
novel tool called Homomorphic Authenticated Tree (HAT). We prove the security of our
construction, and the theoretical analysis and experimental results show that our construction
is efficient in practice.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 DIPLOCLOUD: EFFICIENT AND SCALABLE MANAGEMENT

OF RDF DATA IN THE CLOUD

ABSTRACT

Despite recent advances in distributed RDF data management, processing large-amounts of

RDF data in the cloud is still very challenging. In spite of its seemingly simple data model,
RDF actually encodes rich and complex graphs mixing both instance and schema-level data.
Sharing such data using classical techniques or partitioning the graph using traditional min-
cut algorithms leads to very inefficient distributed operations and to a high number of joins.
In this paper, we describe DiploCloud, an efficient and scalable distributed RDF data
management system for the cloud. Contrary to previous approaches, DiploCloud runs a
physiological analysis of both instance and schema information prior to partitioning the data.
In this paper, we describe the architecture of DiploCloud, its main data structures, as well as
the new algorithms we use to partition and distribute data. We also present an extensive
evaluation of DiploCloud showing that our system is often two orders of magnitude faster
than state-of-the-art systems on standard workloads.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 FIDOOP: PARALLEL MINING OF FREQUENT
ITEMSETS USING MAPREDUCE

ABSTRACT

Existing parallel mining algorithms for frequent item sets lack a mechanism that enables
automatic parallelization, load balancing, data distribution, and fault tolerance on large
clusters. As a solution to this problem, we design a parallel frequent item sets mining
algorithm called FiDoop using the MapReduce programming model. To achieve compressed
storage and avoid building conditional pattern bases, FiDoop incorporates the frequent items
ultra metric tree, rather than Conventional FP trees. In FiDoop, three MapReduce jobs are
implemented to complete the mining task. In the crucial third MapReduce job, the mappers
independently decompose item sets, the reducers perform combination operations by
constructing small ultra metric trees, and the actual mining of these trees separately. We
implement FiDoop on our in-house Hadoop cluster. We show that FiDoop on the cluster is
sensitive to data distribution and dimensions, because item sets with different lengths have
different decomposition and construction costs. To improve FiDoop’s performance, we
develop a workload balance metric to measure load balance across the cluster’s computing
nodes. We develop FiDoop-HD, an extension of FiDoop, to speed up the mining performance
for high-dimensional data analysis. Extensive experiments using real-world celestial spectral
data demonstrate that our proposed solution is efficient and
Scalable.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 FINE-GRAINED TWO-FACTOR ACCESS CONTROL FOR WEB-BASED CLOUD
COMPUTING SERVICES

ABSTRACT

In this paper, we introduce a new fine-grained two-factor authentication (2FA) access control
system for web-based cloud computing services. Specifically, in our proposed 2FA access
control system, an attribute-based access control mechanism is implemented with the
necessity of both a user secret key and a lightweight security device. As a user cannot access
the system if they do not hold both, the mechanism can enhance the security of the system,
especially in those scenarios where many users share the same computer for web-based cloud
services. In addition, attribute-based control in the system also enables the cloud server to
restrict the access to those users with the same set of attributes while preserving user privacy,
i.e., the cloud server only knows that the user fulfills the required predicate, but has no idea
on the exact identity of the user. Finally, we also carry out a simulation to demonstrate the
practicability of our proposed 2FA system.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 IDENTITY-BASED PROXY-ORIENTED DATA UPLOADING AND REMOTE
DATA INTEGRITY CHECKING IN PUBLIC CLOUD

ABSTRACT

More and more clients would like to store their data to PCS (public cloud servers) along with
the rapid development of cloud computing. New security problems have to be solved in order
to help more clients process their data in public cloud. When the client is restricted to access
PCS, he will delegate its proxy to process his data and upload them. On the other hand,
remote data integrity checking is also an important security problem in public cloud storage.
It makes the clients check whether their outsourced data is kept intact without downloading
the whole data. From the security problems, we propose a novel proxy-oriented data
uploading and remote data integrity checking model in identity-based public key
cryptography: IDPUIC (identity-based proxy-oriented data uploading and remote data
integrity checking in public cloud). We give the formal definition, system model and security
model. Then, a concrete ID-PUIC protocol is designed by using the bilinear pairings. The
proposed ID-PUIC protocol is provably secure based on the hardness of CDH (computational
Diffie-Hellman) problem. Our ID-PUIC protocol is also efficient and flexible. Based on the
original client’s authorization, the proposed ID-PUIC protocol can realize private remote data
integrity checking, delegated remote data integrity checking and public remote data integrity
checking.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 INSIDER COLLUSION ATTACK ON PRIVACY-PRESERVING

KERNEL-BASED DATA MINING SYSTEMS

ABSTRACT

In this paper, we consider a new insider threat for the privacy preserving work of distributed
kernel-based data mining (DKBDM), such as distributed support vector machine. Among
several known data breaching problems, those associated with insider attacks have been
rising signicantly, making this one of the fastest growing types of security breaches. Once
considered a negligible concern, insider attacks have risen to be one of the top three central
data violations. Insider-related research involving the distribution of kernel-based data
mining is limited, resulting in substantial vulnerabilities in designing protection against
collaborative organizations. Prior works often fall short by addressing a multifactorial model
that is more limited in scope and implementation than addressing insiderswithin organization
colludingwith outsiders. A faulty system allows collusion to go unnoticed when an insider
shares data with an outsider, who can then recover the original data from message
transmissions (intermediary kernel values) among organizations. This attack requires only
accessibility to a few data entries within the organizations rather than requiring the encrypted
administrative privileges typically found in the distribution of data mining scenarios. To the
best of our knowledge, we are the rst to explore this new insider threat in DKBDM. We also
analytically demonstrate the minimum amount of insider data necessary to launch the insider
attack. Finally, we follow up by introducing several proposed privacy-preserving schemes to
counter the described attack.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 MINING HEALTH EXAMINATION RECORDS

A GRAPH-BASED APPROACH

ABSTRACT

General health examination is an integral part of healthcare in many countries. Identifying the
participants at risk is important for early warning and preventive intervention. The
fundamental challenge of learning a classification model for risk prediction lies in the
unlabeled data that constitutes the majority of the collected dataset. Particularly, the
unlabeled data describes the participants in health examinations whose health conditions can
vary greatly from healthy to very-ill. There is no ground truth for differentiating their states
of health. In this paper, we propose a graph-based, semi-supervised learning algorithm called
SHG-Health(Semi-supervised Heterogeneous Graph on Health) for risk predictions to
classify a progressively developing situation with the majority of the data unlabeled. An
efficient iterative algorithm is designed and the proof of convergence is given. Extensive
experiments basedon both real health examination datasets and synthetic datasets are
performed to show the effectiveness and efficiency of otur method.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 NEAREST KEYWORD SET SEARCH IN MULTI-DIMENSIONAL DATASETS

ABSTRACT

Keyword-based search in text-rich multi-dimensional datasets facilitates many novel

applications and tools. In this paper, we consider objects that are tagged with keywords and
are embedded in a vector space. For these datasets, we study queries that ask for the tightest
groups of points satisfying a given set of keywords. We propose a novel method called
ProMiSH (Projection and Multi Scale Hashing) that uses random projection and hash-based
index structures, and achieves high scalability and speedup. We present an exact and an
approximate version of the algorithm. Our experimental results on real and synthetic datasets
show that ProMiSH has up to 60 times of speedup over state-of-the-art tree-based techniques.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 ONLINE RESOURCE SCHEDULING UNDER CONCAVE PRICING FOR CLOUD
COMPUTING

ABSTRACT

With the booming growth of cloud computing industry, computational resources are readily
and elastically available to the customers. In order to attract customers with various demands,
most Infrastructure-as-a-service (iaas) cloud service providers offer several pricing strategies
such as pay as you go, pay less per unit when you use more (so called volume discount), and
pay even less when you reserve. The diverse pricing schemes among different iaas service
providers or even in the same provider form a complex economic landscape that nurtures the
market of cloud brokers. By strategically scheduling multiple customers' resource requests, a
cloud broker can fully take advantage of the discounts offered by cloud service providers. In
this paper, we focus on how a broker may help a group of customers to fully utilize the
volume discount pricing strategy offered by cloud service providers through cost-efficient
online resource scheduling. We present a randomized online stack-centric scheduling
algorithm (ROSA) and theoretically prove the lower bound of its competitive ratio. Our
simulation shows that ROSA achieves a competitive ratio close to the theoretical lower
bound under a special case cost function. Trace driven simulation using Google cluster data
demonstrates that ROSA is superior to the conventional online scheduling algorithms in
terms of cost saving.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 PROTECTING YOUR RIGHT: VERIFIABLE ATTRIBUTE-BASED KEYWORD
SEARCH WITH FINE-GRAINED OWNER-ENFORCED SEARCH
AUTHORIZATION IN THE CLOUD

ABSTRACT

Search over encrypted data is a critically important enabling technique in cloud computing,
where encryption-before-outsourcing is a fundamental solution to protecting user data
privacy in the untrusted cloud server environment. In this paper, we focus on a different yet
more challenging scenario where the outsourced dataset can be contributed from multiple
owners and are searchable by multiple users, i.e. multi-user multi-contributor case. Inspired
by attribute-based encryption (ABE), we present the first attribute-based keyword search
scheme with efficient user revocation (ABKS-UR) that enables scalable fine-grained (i.e.
file-level) search authorization. Our scheme allows multiple owners to encrypt and outsource
their data to the cloud server independently. Users can generate their own search capabilities
without relying on an always online trusted authority. Fine-grained search authorization is
also implemented by the owner-enforced access policy on the index of each file. Further, by
incorporating proxy re-encryption and lazy re-encryption techniques, we are able to delegate
heavy system update workload during user revocation to the resourceful semi-trusted cloud
server. We formalize the security definition and prove the proposed ABKS-UR scheme
selectively secure against chosen-keyword attack. To build confidence of data user in the
proposed secure search system, we also design a search result verification scheme. Finally,
performance evaluation shows that the efficiency of our scheme.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 RATING PREDICTION BASED ON SOCIAL SENTIMENT FROM TEXTUAL
REVIEWS

ABSTRACT

In recent years, we have witnessed a flourish of review websites. It presents a great

opportunity to share our viewpoints for various products we purchase. However, we face the
information overloading problem. How to mine valuable information from reviews to
understand a user’s preferences and make an accurate recommendation is crucial. Traditional
recommender systems (RS) consider some factors, such as user’s purchase records, product
category, and geographic location. In this work, we propose a sentiment-based rating
prediction method (RPS) to improve prediction accuracy in recommender systems. Firstly,
we propose a social user sentimental measurement approach and calculate each user’s
sentiment on items/products. Secondly, we not only consider a user’s own sentimental
attributes but also take interpersonal sentimental influence into consideration. Then, we
consider product reputation, which can be inferred by the sentimental distributions of a user
set that reflect customers’ comprehensive evaluation. At last, we fuse three factors-user
sentiment similarity, interpersonal sentimental influence, and item’s reputation similarity into
our recommender system to make an accurate rating prediction. We conduct a performance
evaluation of the three sentimental factors on a real-world dataset collected from Yelp. Our
experimental results show the sentiment can well characterize user preferences, which help to
improve the recommendation performance.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
RESOLVING MULTI-PARTY PRIVACY CONFLICTS IN
SOCIAL MEDIA
ABSTRACT

Items shared through Social Media may affect more than one user’s privacy — e.g., photos
that depict multiple users, comments that mention multiple users, events in which multiple
users are invited, etc. The lack of multi-party privacy management support in current
mainstream Social Media infrastructures makes users unable to appropriately control to
whom these items are actually shared or not. Computational mechanisms that are able to
merge the privacy preferences of multiple users into a single policy for an item can help solve
this problem. However, merging multiple users’ privacy preferences is not an easy task,
because privacy preferences may conflict, so methods to resolve conflicts are needed.
Moreover, these methods need to consider how users’ would actually reach an agreement
about a solution to the conflict in order to propose solutions that can be acceptable by all of
the users affected by the item to be shared. Current approaches are either too demanding or
only consider fixed ways of aggregating privacy preferences. In this paper, we propose the
first computational mechanism to resolve conflicts for multi-party privacy management in
Social Media that is able to adapt to different situations by modelling the concessions that
users make to reach a solution to the conflicts. We also present results of a user study in
which our proposed mechanism outperformed other existing approaches in terms of how
many times each approach matched users’ behaviour.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 RSKNN: KNN SEARCH ON ROAD NETWORKS BY INCORPORATING SOCIAL
INFLUENCE

ABSTRACT

Although kNN search on a road network Gr, i.e., finding k nearest objects to a query user q
on Gr, has been extensively studied, existing works neglected the fact that the q’s social
information can play an important role in this kNN query. Many real-world applications, such
as location-based social networking services, require such a query. In this paper we study a
new problem: kNN search on road networks by incorporating social influence (RSkNN).
Specifically, the state-of-the-art Independent Cascade (IC) model in social network is applied
to define social influence. One critical challenge of the problem is to speed up the
computation of the social influence over large road and social networks. To address this
challenge, we propose three efficient index-based search algorithms, i.e., road network-based
(RN-based), social network-based (SN-based) and hybrid indexing algorithms. In the RN-
based algorithm, we employ a filtering-and-verification framework for tackling the hard
problem ofcomputing social influence. In the SN-based algorithm, we embed social cuts into
the index, so that we speed up the query. In the hybrid algorithm, we propose an index,
summarizing the road and social networks, based on which we can obtain query answers
efficiently. Finally, we use real road and social network data to empirically verify the
efficiency and efficacy of our solutions.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 Secure Data Sharing in Cloud Computing Using Revocable-Storage Identity-Based
Encryption

MODIFIED: Cost-Effective and Secure Data Sharing System in Cloud Computing Using
RS-IBE

ABSTRACT

Cloud computing provides a flexible and convenient way for data sharing, which brings
various benefits for both the society and individuals. But there exists a natural resistance for
users to directly outsource the shared data to the cloud server since the data often contain
valuable information. Thus, it is necessary to place cryptographically enhanced access control
on the shared data. Identity-based encryption is a promising cryptographical primitive to
build a practical data sharing system. However, access control is not static. That is, when
some user’s authorization is expired, there should be a mechanism that can remove him/her
from the system. Consequently, the revoked user cannot access both the previously and
subsequently shared data. To this end, we propose a notion called revocable-storage identity-
based encryption (RS-IBE), which can provide the forward/backward security of ciphertext
by introducing the functionalities of user revocation and ciphertext update simultaneously.
Furthermore, we present a concrete construction of RS-IBE, and prove its security in the
defined security model. The performance comparisons indicate that the proposed RS-IBE
scheme has advantages in terms of functionality and efficiency, and thus is feasible for a
practical and cost-effective

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 SERVER-AIDED PUBLIC KEY ENCRYPTION WITH
KEYWORD SEARCH
ABSTRACT

Public Key Encryption with Keyword Search (PEKS) is a well-known cryptographic

primitive for secure searchable data encryption in cloud storage. Unfortunately, it is
inherently subject to the (inside) off-line keyword guessing attack (KGA), which is against
the data privacy of users. Existing countermeasures for dealing with this security issue mainly
suffer from low efficiency and are impractical for real applications. In this work, we provide
a practical and applicable treatment on this security vulnerability by formalizing a new PEKS
system named Server-Aided Public Key Encryption with Keyword Search (SA-PEKS). In
SA-PEKS, to generate the keyword ciphertext/trapdoor, the user needs to query a semi-
trusted third party called Keyword Server (KS) by running an authentication protocol and
hence security against the off-line KGA can be obtained. We then introduce a universal
transformation from any PEKS scheme to a secure SA-PEKS scheme using the deterministic
blind signature. To illustrate its feasibility, we present the first instantiation of SA-PEKS
scheme by utilizing the FDH-RSA signature and the PEKS scheme proposed by Boneh et al.
in Eurocrypt 2004. Finally, we describe how to securely implement the client-KS protocol
with a rate-limiting mechanism against on-line KGA and evaluate the performance of our
solutions in experiments.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 TAG BASED IMAGE SEARCH BY SOCIAL RE-RANKING

ABSTRACT

Social media sharing websites like Flickr allow users to annotate images with free tags,
which significantly contribute to the development of the web image retrieval and
organization. Tag-based image search is an important method to find images contributed by
social users in such social websites. However, how to make the top ranked result relevant and
with diversity is challenging. In this paper, we propose a social re-ranking system for tag-
based image retrieval with the consideration of image’s relevance and diversity. We aim at
re-ranking images according to their visual information, semantic information and social
clues. The initial results include images contributed by different social users. Usually each
user contributes several images. First we sort these images by inter-user re-ranking. Users
that have higher contribution to the given query rank higher. Then we sequentially implement
intra-user re-ranking on the ranked user’s image set, and only the most relevant image from
each user’s image set is selected. These selected images compose the final retrieved results.
We build an inverted index structure for the social image dataset to accelerate the searching
process. Experimental results on Flickr dataset show that our social re-ranking method is
effective and efficient.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
A DISTORTION-RESISTANT ROUTING FRAMEWORK FOR VIDEO TRAFFIC IN
WIRELESS MULTIHOP NETWORKS

1.1 ABSTRACT:

Traditional routing metrics designed for wireless networks are application agnostic. In this
paper, we consider a wireless network where the application flows consist of video traffic.
From a user perspective, reducing the level of video distortion is critical. We ask the question
“Should the routing policies change if the end-to-end video distortion is to be minimized?”
Popular link-quality-based routing metrics (such as ETX) do not account for dependence (in
terms of congestion) across the links of a path; as a result, they can because video flows to
converge onto a few paths and, thus, cause high video distortion. To account for the evolution
of the video frame loss process, we construct an analytical framework to, first, understand
and, second, assess the impact of the wireless network on video distortion. The framework
allows us to formulate a routing policy for minimizing distortion, based on which we design a
protocol for routing video traffic. We find via simulations and tested experiments that our
protocol is efficient in reducing video distortion and minimizing the user experience
degradation.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 A DISTRIBUTED THREE-HOP ROUTING PROTOCOL TO INCREASE THE
CAPACITY OF HYBRID WIRELESS NETWORKS

1.1 ABSTRACT:

Hybrid wireless networks combining the advantages of both mobile ad-hoc networks and
infrastructure wireless networks have been receiving increased attention due to their ultra-
high performance. An efficient data routing protocol is important in such networks for high
network capacity and scalability. However, most routing protocols for these networks simply
combine the ad-hoc transmission mode with the cellular transmission mode, which inherits
the drawbacks of ad-hoc transmission.

This paper presents a Distributed Three-hop Routing protocol (DTR) for hybrid wireless
networks. To take full advantage of the widespread base stations, DTR divides a message
data stream into segments and transmits the segments in a distributed manner. It makes full
spatial reuse of a system via its high speed ad-hoc interface and alleviates mobile gateway
congestion via its cellular interface. Furthermore, sending segments to a number of base
stations simultaneously increases throughput and makes full use of widespread base stations.

DTR significantly reduces overhead due to short path lengths and the elimination of route
discovery and maintenance. DTR also has a congestion control algorithm to avoid
overloading base stations. Theoretical analysis and simulation results show the superiority of
DTR in comparison with other routing protocols in terms of throughput capacity, scalability,
and mobility resilience. The results also show the effectiveness of the congestion control
algorithm in balancing the load between base stations.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
A HYBRID CLOUD APPROACH FOR SECURE AUTHORIZED DEDUPLICATION

1.1 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 test bed experiments using our prototype. We show that

our proposed authorized duplicate check scheme incurs minimal overhead compared to

normal operations.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 A PROFIT MAXIMIZATION SCHEME WITH GUARANTEED QUALITY OF

SERVICE IN CLOUD COMPUTING

1.1 ABSTRACT:

As an effective and efficient way to provide computing resources and services to customers
on demand, cloud computing has become more and more popular. From cloud service
providers’ perspective, profit is one of the most important considerations, and it is mainly
determined by the configuration of a cloud service platform under given market demand.
However, a single long-term renting scheme is usually adopted to configure a cloud platform,
which cannot guarantee the service quality but leads to serious resource waste.

In this paper, a double resource renting scheme is designed firstly in this double renting
scheme can effectively guarantee the quality of service of all requests and reduce the resource
waste greatly.

Secondly, a service system is considered as an M/M/m+D queuing model and the

performance indicators that affect the profit of our double renting scheme are analyzed, e.g.,
the average charge, the ratio of requests that need temporary servers, and so forth.

Thirdly, a profit maximization problem is formulated for the double renting scheme and the
optimized configuration of a cloud platform is obtained by solving the profit maximization
problem.

Finally, a series of calculations are conducted to compare the profit of our proposed scheme
with that of the single renting scheme. The results show that our scheme can not only
guarantee the service quality of all requests, but also obtain more profit than the latter.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 A SCALABLE AND RELIABLE MATCHING SERVICE FOR
CONTENT-BASED PUBLISH/SUBSCRIBE SYSTEMS

1.1 ABSTRACT:

Characterized by the increasing arrival rate of live content, the emergency applications pose a
great challenge: how to disseminate large-scale live content to interested users in a scalable
and reliable manner. The publish/subscribe (pub/sub) model is widely used for data
dissemination because of its capacity of seamlessly expanding the system to massive size.
However, most event matching services of existing pub/sub systems either lead to low
matching throughput when matching a large number of skewed subscriptions, or interrupt
dissemination when a large number of servers fail. The cloud computing provides great
opportunities for the requirements of complex computing and reliable communication.

In this paper, we propose SREM, a scalable and reliable event matching service for content-
based pub/sub systems in cloud computing environment. To achieve low routing latency and
reliable links among servers, we propose a distributed overlay Skip Cloud to organize servers
of SREM. Through a hybrid space partitioning technique HPartition, large-scale skewed
subscriptions are mapped into multiple subspaces, which ensures high matching throughput
and provides multiple candidate servers for each event.

Moreover, a series of dynamics maintenance mechanisms are extensively studied. To

evaluate the performance of SREM, 64 servers are deployed and millions of live content
items are tested in a Cloud Stack testbed. Under various parameter settings, the experimental
results demonstrate that the traffic overhead of routing events in SkipCloud is at least 60
percent smaller than in Chord overlay, the matching rate in SREM is at least 3.7 times and at
most 40.4 times larger than the single-dimensional partitioning technique of BlueDove.
Besides, SREM enables the event loss rate to drop back to 0 in tens of seconds even if a large
number of servers fail simultaneously.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 A TIME EFFICIENT APPROACH FOR DETECTING ERRORS IN

BIG SENSOR DATA ON CLOUD

1.1 ABSTRACT:

Big sensor data is prevalent in both industry and scientific research applications where the
data is generated with high volume and velocity it is difficult to process using on-hand
database management tools or traditional data processing applications. Cloud computing
provides a promising platform to support the addressing of this challenge as it provides a
flexible stack of massive computing, storage, and software services in a scalable manner at
low cost. Some techniques have been developed in recent years for processing sensor data on
cloud, such as sensor-cloud. However, these techniques do not provide efficient support on
fast detection and locating of errors in big sensor data sets.

We develop a novel data error detection approach which exploits the full computation
potential of cloud platform and the network feature of WSN. Firstly, a set of sensor data error
types are classified and defined. Based on that classification, the network feature of a
clustered WSN is introduced and analyzed to support fast error detection and location.
Specifically, in our proposed approach, the error detection is based on the scale-free network
topology and most of detection operations can be conducted in limited temporal or spatial
data blocks instead of a whole big data set. Hence the detection and location process can be
dramatically accelerated.

Furthermore, the detection and location tasks can be distributed to cloud platform to fully
exploit the computation power and massive storage. Through the experiment on our cloud
computing platform of U-Cloud, it is demonstrated that our proposed approach can
significantly reduce the time for error detection and location in big data sets generated by
large scale sensor network systems with acceptable error detecting accuracy.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 AGGREGATED-PROOF BASED HIERARCHICAL AUTHENTICATION

SCHEME FOR THE INTERNET OF THINGS

ABSTRACT:

The Internet of Things (IoT) is becoming an attractive system paradigm to realize

interconnections through the physical, cyber, and social spaces. During the interactions
among the ubiquitous things, security issues become noteworthy, and it is significant to
establish enhanced solutions for security protection. In this work, we focus on an existing
U2IoT architecture (i.e., unit IoT and ubiquitous IoT), to design an aggregated-proof based
hierarchical authentication scheme (APHA) for the layered networks. Concretely, 1) the
aggregated-proofs are established for multiple targets to achieve backward and forward
anonymous data transmission; 2) the directed path descriptors, homomorphism functions, and
Chebyshev chaotic maps are jointly applied for mutual authentication; 3) different access
authorities are assigned to achieve hierarchical access control. Meanwhile, the BAN logic
formal analysis is performed to prove that the proposed APHA has no obvious security
defects, and it is potentially available for the U2IoT architecture and other IoT applications.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
AUTHENTICATION HANDOVER AND PRIVACY PROTECTION IN 5G HETNETS

USING SOFTWARE-DEFINED NETWORKING

1.1 ABSTRACT:

Recently, densified small cell deployment with overlay coverage through coexisting
heterogeneous networks has emerged as a viable solution for 5G mobile networks. However,
this multi-tier architecture along with stringent latency requirements in 5G brings new
challenges in security provisioning due to the potential frequent handovers and
authentications in 5G small cells and HetNets. In this article, we review related studies and
introduce SDN into 5G as a platform to enable efficient authentication hand - over and
privacy protection. Our objective is to simplify authentication handover by global
management of 5G HetNets through sharing of userdependent security context information
among related access points. We demonstrate that SDN-enabled security solutions are highly
efficient through its centralized control capability, which is essential for delay-constrained 5G
communications.

However, the specific key designed for handover and different handover procedures for
various scenarios will increase handover complexity when applied to 5G HetNets. As the
authentication server is often located remotely, the delay due to frequent enquiries between
small cell APs and the authentication server for user verification may be up to hundreds of
milliseconds, which is unacceptable for 5G communications. The authors of have proposed
simplified hand - over authentication schemes involving direct authentication between UE
and APs based on public cryptography. These schemes realize mutual authentication and key
agreements with new networks through a three-way handshake without contacting any third
party, like an authentication, authorization, and accounting (AAA) server. Although the
handover authentication procedure is simplified, computation cost and delay are increased
due to the overhead for exchanging more cryptographic messages through a wireless
interface. For the same reason, carrying a digital signature is secure but not efficient for
dynamic 5G wireless communications.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net
No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 CONTENT-BASED IMAGE RETRIEVAL USING ERROR DIFFUSION BLOCK

TRUNCATION CODING FEATURES

1.1 ABSTRACT:

This paper presents a new approach to index color images using the features extracted from
the error diffusion block truncation coding (EDBTC). The EDBTC produces two color
quantizers and bitmap images, which are further, processed using vector quantization (VQ) to
generate the image feature descriptor. Herein two features are introduced, namely, color
histogram feature (CHF) and bit pattern histogram feature (BHF), to measure the similarity
between a query image and the target image in database.
The CHF and BHF are computed from the VQ-indexed color quantizer and VQ-indexed
bitmap image, respectively. The distance computed from CHF and BHF can be utilized to
measure the similarity between two images. As documented in the experimental result, the
proposed indexing method outperforms the former block truncation coding based image
indexing and the other existing image retrieval schemes with natural and textural data sets.
Thus, the proposed EDBTC is not only examined with good capability for image
compression but also offers an effective way to index images for the content based image
retrieval system.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 COST-AWARE SECURE ROUTING (CASER) PROTOCOL DESIGN FOR

WIRELESS SENSOR NETWORKS

1.0 ABSTRACT:

Lifetime optimization and security are two conflicting design issues for multi-hop wireless
sensor networks (WSNs) with non-replenishable energy resources. In this paper, we first
propose a novel secure and efficient Cost-Aware SEcure Routing (CASER) protocol to
address these two conflicting issues through two adjustable parameters: energy balance
control (EBC) and probabilistic based random walking. We then discover that the energy
consumption is severely disproportional to the uniform energy deployment for the given
network topology, which greatly reduces the lifetime of the sensor networks. We propose an
efficient non-uniform energy deployment strategy to optimize the lifetime and message
delivery ratio under the same energy resource and security requirement. We also provide a
quantitative security analysis on the proposed routing protocol.

Our theoretical analysis and java simulation results demonstrate that the proposed CASER
protocol can provide an excellent tradeoff between routing efficiency and energy balance,
and can significantly extend the lifetime of the sensor networks in all scenarios. For the non-
uniform energy deployment, our analysis shows that we can increase the lifetime and the total
number of messages that can be delivered by more than four times under the same
assumption. We also demonstrate that the proposed CASER protocol can achieve a high
message delivery ratio while preventing routing traceback attacks.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 DATA-DRIVEN COMPOSITION FOR SERVICE-ORIENTED SITUATIONAL
WEB APPLICATIONS

1.1 ABSTRACT:

This paper presents a systematic data-driven approach to assisting situational application

development. We first propose a technique to extract useful information from multiple
sources to abstract service capabilities with set tags. This supports intuitive expression of
user’s desired composition goals by simple queries, without having to know underlying
technical details. A planning technique then exploits composition solutions which can
constitute the desired goals, even with some potential new interesting composition
opportunities. A browser-based tool facilitates visual and iterative refinement of composition
solutions, to finally come up with the satisfying outputs. A series of experiments demonstrate
the efficiency and effectiveness of our approach. Data-driven composition technique for
situational web applications by using tag-based semantics in to illustrate the overall life-cycle
of our “compose as-you-search” composition approach, to propose the clustering technique
for deriving tag-based composition semantics, and to evaluate the composition planning
effectiveness, respectively.

Compared with previous work, this paper is significantly updated by introducing a semi-
supervised technique for clustering hierarchical tag based semantics from service
documentations and human-annotated annotations. The derived semantics link service
capabilities and developers’ processing goals, so that the composition is processed by
planning the “Tag HyperLinks” from initialquery to the goals. The planning algorithm is also
further evaluated in terms of recommendation quality, performance, and scalability over data
sets from real-world service repositories. Results show that our approach reaches satisfying
precision and high-quality composition recommendations. We also demonstrate that our
approach can accommodate even larger size of services than real world repositories so as to
promise performance. Besides, more details of our interactive development prototyping are
Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net
No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
presented. We particularly demonstrate how the composition UI can help developers
intuitively compose situational applications, and iteratively refine their goals until
requirements are finally satisfied.

DATA-STREAM-BASED INTRUSION DETECTION SYSTEM FOR ADVANCED

METERING INFRASTRUCTURE IN SMART GRID: A FEASIBILITY STUDY

1.1 ABSTRACT:

In this paper, we will focus on the security of advanced metering infrastructure (AMI), which
is one of the most crucial components of SG. AMI serves as a bridge for providing
bidirectional information flow between user domain and utility domain. AMI’s main
functionalities encompass power measurement facilities, assisting adaptive power pricing and
demand side management, providing self-healing ability, and interfaces for other systems.

AMI is usually composed of three major types of components, namely, smart meter, data
concentrator, and central system (a.k.a. AMI headend) and bidirectional communication
networks among those components. AMI is exposed to various security threats such as
privacy breach, energy theft, illegal monetary gain, and other malicious activities. As AMI is
directly related to revenue earning, customer power consumption, and privacy, of utmost
importance is securing its infrastructure. In order to protect AMI from malicious attacks, we
look into the intrusion detection system (IDS) aspect of security solution.

We can define IDS as a monitoring system for detecting any unwanted entity into a targeted
system (such as AMI in our context). We treat IDS as a second line security measure after the
first line of primary AMI security techniques such as encryption, authorization, and
authentication, Hence, changing specifications in all key IDS sensors would be expensive and
cumbersome. In this paper, we choose to employ anomaly-based IDS using data mining
approaches.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 DISTORTION-AWARE CONCURRENT MULTIPATH TRANSFER FOR MOBILE

VIDEO STREAMING IN HETEROGENEOUS WIRELESS NETWORKS

1.1 ABSTRACT:

The massive proliferation of wireless infrastructures with complementary characteristics

prompts the bandwidth aggregation for Concurrent Multipath Transfer (CMT) over
heterogeneous access networks. Stream Control Transmission Protocol (SCTP) is the
standard transport-layer solution to enable CMT in multihomed communication
environments. However, delivering high-quality streaming video with the existing CMT
solutions still remains problematic due to the stringent quality of service (QoS) requirements
and path asymmetry in heterogeneous wireless networks.

In this paper, we advance the state of the art by introducing video distortion into the decision
process of multipath data transfer. The proposed distortion-aware concurrent multipath
transfer (CMT-DA) solution includes three phases: 1) per-path status estimation and
congestion control; 2) quality-optimal video flow rate allocation; 3) delay and loss controlled
data retransmission. The term ‘flow rate allocation’ indicates dynamically picking
appropriate access networks and assigning the transmission rates.

We analytically formulate the data distribution over multiple communication paths to

minimize the end-to-end video distortion and derive the solution based on the utility
maximization theory. The performance of the proposed CMT-DA is evaluated through
extensive semi-physical emulations in Exata involving H.264 video streaming. Experimental
results show that CMT-DA outperforms the reference schemes in terms of video peak signal-
to-noise ratio (PSNR), good put, and inter-packet delay.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 ENABLING EFFICIENT MULTI-KEYWORD RANKED SEARCH OVER

ENCRYPTED MOBILE CLOUD DATA THROUGH BLIND STORAGE

1.0 ABSTRACT:

In mobile cloud computing, a fundamental application is to outsource the mobile data to

external cloud servers for scalable data storage. The outsourced data, however, need to be
encrypted due to the privacy and confidentiality concerns of their owner. This results in the
distinguished difficulties on the accurate search over the encrypted mobile cloud data.

In this paper, we develop the searchable encryption for multi-keyword ranked search over the
storage data. Specifically, by considering the large number of outsourced documents (data) in
the cloud, we utilize the relevance score and k-nearest neighbor techniques to develop an
efficient multi-keyword search scheme that can return the ranked search results based on the
accuracy.

This framework, we leverage an efficient index to further improve the search efficiency, and
adopt the blind storage system to conceal access pattern of the search user. Security analysis
demonstrates that our scheme can achieve confidentiality of documents and index, trapdoor
privacy, trapdoor unlinkability, and concealing access pattern of the search user. Finally,
using extensive simulations, we show that our proposal can achieve much improved
efficiency in terms of search functionality and search time compared with the existing
proposals.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 ENERGY EFFICIENT VIRTUAL NETWORK EMBEDDING FOR CLOUD

NETWORKS

1.1 ABSTRACT:

In this paper, we propose an energy efficient virtual network embedding (EEVNE) approach
for cloud computing networks, where power savings are introduced by consolidating
resources in the network and data centers. We model our approach in an IP over WDM
network using mixed integer linear programming (MILP). The performance of the EEVNE
approach is compared with two approaches from the literature: the bandwidth cost approach
(CostVNE) and the energy aware approach (VNE-EA). The CostVNE approach optimizes the
use of available bandwidth, while the VNE-EA approach minimizes the power consumption
by reducing the number of activated nodes and links without taking into account the granular
power consumption of the data centers and the different network devices.

The results show that the EEVNE model achieves a maximum power saving of 60% (average
20%) compared to the CostVNE model under an energy inefficient data center power profile.
We develop a heuristic, real-time energy optimized VNE (REOViNE), with power savings
approaching those of the EEVNE model. We also compare the different approaches adopting
energy efficient data center power profile. Furthermore, we study the impact of delay and
node location constraints on the energy efficiency of virtual network embedding. We also
show how VNE can impact the design of optimally located data centers for minimal power
consumption in cloud networks. Finally, we examine the power savings and spectral
efficiency benefits that VNE offers in optical orthogonal division multiplexing networks.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 FRIENDBOOK A SEMANTIC-BASED FRIEND RECOMMENDATION

SYSTEM FOR SOCIAL NETWORKS

1.1 ABSTRACT:

Existing social networking services recommend friends to users based on their social graphs,
which may not be the most appropriate to reflect a user’s preferences on friend selection in
real life. In this paper, we present Friendbook, a novel semantic-based friend
recommendation system for social networks, which recommends friends to users based on
their life styles instead of social graphs. By taking advantage of sensor-rich smartphones,
Friendbook discovers life styles of users from user-centric sensor data, measures the
similarity of life styles between users, and recommends friends to users if their life styles
have high similarity. Inspired by text mining, we model a user’s daily life as life documents,
from which his/her life styles are extracted by using the Latent Dirichlet Allocation
algorithm.

We further propose a similarity metric to measure the similarity of life styles between users,
and calculate users’ impact in terms of life styles with a friend-matching graph. Upon
receiving a request, Friendbook returns a list of people with highest recommendation scores
to the query user. Finally, Friendbook integrates a feedback mechanism to further improve
the recommendation accuracy. We have implemented Friendbook on the Android-based
smartphones, and evaluated its performance on both small-scale experiments and large-scale
simulations. The results show that the recommendations accurately reflect the preferences of
users in choosing friends.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 GENERATING SEARCHABLE PUBLIC-KEY CIPHERTEXTS WITH HIDDEN
STRUCTURES FOR FAST KEYWORD SEARCH

1.1 ABSTRACT:

In this paper proposes Searchable Public-Key Ciphertexts with Hidden Structures (SPCHS)
for keyword search as fast as possible without sacrificing semantic security of the encrypted
keywords. In SPCHS, all keyword-searchable ciphertexts are structured by hidden relations,
and with the search trapdoor corresponding to a keyword, the minimum information of the
relations is disclosed to a search algorithm as the guidance to find all matching ciphertexts
efficiently.

We construct a SPCHS scheme from scratch in which the ciphertexts have a hidden star-like
structure. We prove our scheme to be semantically secure in the Random Oracle (RO) model.
The search complexity of our scheme is dependent on the actual number of the ciphertexts
containing the queried keyword, rather than the number of all ciphertexts.

Finally, we present a generic SPCHS construction from anonymous identity-based encryption

and collision-free full-identity malleable Identity-Based Key Encapsulation Mechanism
(IBKEM) with anonymity. We illustrate two collision-free full-identity malleable IBKEM
instances, which are semantically secure and anonymous, respectively, in the RO and
standard models. The latter instance enables us to construct an SPCHS scheme with semantic
security in the standard model.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 IDENTITY-BASED DISTRIBUTED PROVABLE DATA POSSESSION IN MULTI-
CLOUD STORAGE

1.1 ABSTRACT:

Remote data integrity checking is of crucial importance in cloud storage. It can make the

clients verify whether their outsourced data is kept intact without downloading the whole

data. In some application scenarios, the clients have to store their data on multi-cloud servers.

At the same time, the integrity checking protocol must be efficient in order to save the

verifier’s cost. From the two points, we propose a novel remote data integrity checking

model: ID-DPDP (identity-based distributed provable data possession) in multi-cloud storage.

The formal system model and security model are given. Based on the bilinear pairings, a

concrete ID-DPDP protocol is designed. The proposed ID-DPDP protocol is provably secure

under the hardness assumption of the standard CDH (computational Diffie-Hellman)

problem. In addition to the structural advantage of Elimination of certificate management, our

ID-DPDP protocol is also efficient and flexible. Based on the client’s authorization, the

proposed ID-DPDP protocol can realize private verification, delegated verification and public

verification.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 IDENTITY-BASED ENCRYPTION WITH OUTSOURCED REVOCATION

IN CLOUD COMPUTING

ABSTRACT:

Identity-Based Encryption (IBE) which simplifies the public key and certificate management
at Public Key Infrastructure (PKI) is an important alternative to public key encryption.
However, one of the main efficiency drawbacks of IBE is the overhead computation at
Private Key Generator (PKG) during user revocation. Efficient revocation has been well
studied in traditional PKI setting, but the cumbersome management of certificates is precisely
the burden that IBE strives to alleviate. In this paper, aiming at tackling the critical issue of
identity revocation, we introduce outsourcing computation into IBE for the first time and
propose a revocable IBE scheme in the server-aided setting.

Our scheme offloads most of the key generation related operations during key-issuing and
key-update processes to a Key Update Cloud Service Provider, leaving only a constant
number of simple operations for PKG and users to perform locally. This goal is achieved by
utilizing a novel collusion-resistant technique: we employ a hybrid private key for each user,
in which an AND gate is involved to connect and bound the identity component and the time
component. Furthermore, we propose another construction which is provable secure under
the recently formulized Refereed Delegation of Computation model. Finally, we provide
extensive experimental results to demonstrate the efficiency of our proposed construction.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 IMPROVING WEB NAVIGATION USABILITY BY COMPARING
ACTUAL AND ANTICIPATED USAGE

1.1 ABSTRACT:

We present a new method to identify navigation related Web usability problems based on
comparing actual and anticipated usage patterns. The actual usage patterns can be extracted
from Web server logs routinely recorded for operational websites by first processing the log
data to identify users, user sessions, and user task-oriented transactions, and then applying a
usage mining algorithm to discover patterns among actual usage paths. The anticipated usage,
including information about both the path and time required for user-oriented tasks, is
captured by our ideal user interactive path models constructed by cognitive experts based on
their cognition of user behavior.

The comparison is performed via the mechanism of test MY SQL for checking results and
identifying user navigation difficulties. The deviation data produced from this comparison
can help us discover usability issues and suggest corrective actions to improve usability. A
software tool was developed to automate a significant part of the activities involved. With an
experiment on a small service-oriented website, we identified usability problems, which were
cross-validated by domain experts, and quantified usability improvement by the higher task
success rate and lower time and effort for given tasks after suggested corrections were
implemented. This case study provides an initial validation of the applicability and
effectiveness of our method.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 MAXIMIZING P2P FILE ACCESS AVAILABILITY IN MOBILE ADHOC

NETWORKS THOUGH REPLICATION FOR EFFICIENT FILE SHARING

1.1 ABSTRACT:

File sharing applications in mobile ad hoc networks (MANETs) have attracted more and
more attention in recent years. The efficiency of file querying suffers from the distinctive
properties of such networks including node mobility and limited communication range and
resource. An intuitive method to alleviate this problem is to create file replicas in the
network. However, despite the efforts on file replication, no research has focused on the
global optimal replica creation with minimum average querying delay.

Specifically, current file replication protocols in mobile ad hoc networks have two
shortcomings. First, they lack a rule to allocate limited resources to different files in order to
minimize the average querying delay. Second, they simply consider storage as available
resources for replicas, but neglect the fact that the file holders’ frequency of meeting other
nodes also plays an important role in determining file availability. Actually, a node that has a
higher meeting frequency with others provides higher availability to its files. This becomes
even more evident in sparsely distributed MANETs, in which nodes meet disruptively.

In this paper, we introduce a new concept of resource for file replication, which considers
both node storage and node meeting ability. We theoretically study the influence of resource
allocation on the average querying delay and derive an optimal file replication rule (OFRR)
that allocates resources to each file based on its popularity and size. We then propose a file
replication protocol based on the rule, which approximates the minimum global querying
delay in a fully distributed manner. Our experiment and simulation results show the superior
performance of the proposed protocol in comparison with other representative replication
protocols

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 NEIGHBOR SIMILARITY TRUST AGAINST SYBIL ATTACK

IN P2P E-COMMERCE

ABSTRACT:

In this paper, we present a distributed structured approach to Sybil attack. This is derived
from the fact that our approach is based on the neighbor similarity trust relationship among
the neighbor peers. Given a P2P e-commerce trust relationship based on interest, the
transactions among peers are flexible as each peer can decide to trade with another peer any
time. A peer doesn’t have to consult others in a group unless a recommendation is needed.
This approach shows the advantage in exploiting the similarity trust relationship among peers
in which the peers are able to monitor each other.

Our contribution in this paper is threefold:

1) We propose SybilTrust that can identify and protect honest peers from Sybil attack. The
Sybil peers can have their trust canceled and dismissed from a group.

2) Based on the group infrastructure in P2P e-commerce, each neighbor is connected to the
peers by the success of the transactions it makes or the trust evaluation level. A peer can only
be recognized as a neighbor depending on whether or not trust level is sustained over a
threshold value.

3) SybilTrust enables neighbor peers to carry recommendation identifiers among the peers in
a group. This ensures that the group detection algorithms to identify Sybil attack peers to be
efficient and scalable in large P2P e-commerce networks.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
ON TRAFFIC-AWARE PARTITION AND AGGREGATION IN MAPREDUCE FOR
BIG DATA APPLICATIONS

1.1 ABSTRACT:

MapReduce job, we consider to aggregate data with the same keys before sending them to
remote reduce tasks. Although a similar function, called combine, has been already adopted
by Hadoop, it operates immediately after a map task solely for its generated data, failing to
exploit the data aggregation opportunities among multiple tasks on different machines. We
jointly consider data partition and aggregation for a MapReduce job with an objective that is
to minimize the total network traffic. In particular, we propose a distributed algorithm for big
data applications by decomposing the original large-scale problem into several subproblems
that can be solved in parallel. Moreover, an online algorithm is designed to deal with the data
partition and aggregation in a dynamic manner. Finally, extensive simulation results
demonstrate that our proposals can significantly reduce network traffic cost in both offline
and online cases.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 PASSIVE IP TRACEBACK: DISCLOSING THE LOCATIONS OF IP SPOOFERS
FROM PATH BACKSCATTER

1 ABSTRACT:

It is long known attackers may use forged source IP address to conceal their real locations.
To capture the spoofers, a number of IP traceback mechanisms have been proposed.
However, due to the challenges of deployment, there has been not a widely adopted IP
traceback solution, at least at the Internet level. As a result, the mist on the locations of
spoofers has never been dissipated till now.

This paper proposes passive IP traceback (PIT) that bypasses the deployment difficulties of
IP traceback techniques. PIT investigates Internet Control Message Protocol error messages
(named path backscatter) triggered by spoofing traffic, and tracks the spoofers based on
public available information (e.g., topology). In this way, PIT can find the spoofers without
any deployment requirement.

This paper illustrates the causes, collection, and the statistical results on path backscatter,
demonstrates the processes and effectiveness of PIT, and shows the captured locations of
spoofers through applying PIT on the path backscatter data set.

These results can help further reveal IP spoofing, which has been studied for long but never
well understood. Though PIT cannot work in all the spoofing attacks, it may be the most
useful mechanism to trace spoofers before an Internet-level traceback system has been
deployed in real.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 PERFORMING INITIATIVE DATA PREFETCHING IN DISTRIBUTED FILE
SYSTEMS FOR CLOUD COMPUTING

1.1 ABSTRACT:

An initiative data prefetching scheme on the storage servers in distributed file systems for
cloud computing. In this prefetching technique, the client machines are not substantially
involved in the process of data prefetching, but the storage servers can directly prefetch the
data after analyzing the history of disk I/O access events, and then send the prefetched data to
the relevant client machines proactively. To put this technique to work, the information about
client nodes is piggybacked onto the real client I/O requests, and then forwarded to the
relevant storage server. Next, two prediction algorithms have been proposed to forecast future
block access operations for directing what data should be fetched on storage servers in
advance.

Finally, the prefetched data can be pushed to the relevant client machine from the storage
server. Through a series of evaluation experiments with a collection of application
benchmarks, we have demonstrated that our presented initiative prefetching technique can
benefit distributed file systems for cloud environments to achieve better I/O performance. In
particular, configurationlimited client machines in the cloud are not responsible for predicting
I/O access operations, which can definitely contribute to preferable system performance on
them

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 PREDICTING ASTHMA-RELATED EMERGENCY DEPARTMENT VISITS

USING BIG DATA

1.1 ABSTRACT:

Asthma is one of the most prevalent and costly chronic conditions in the United States which
cannot be cured. However accurate and timely surveillance data could allow for timely and
targeted interventions at the community or individual level. Current national asthma disease
surveillance systems can have data availability lags of up to two weeks. Rapid progress has
been made in gathering non-traditional, digital information to perform disease surveillance.

We introduce a novel method of using multiple data sources for predicting the number of
asthma related emergency department (ED) visits in a specific area. Twitter data, Google
search interests and environmental sensor data were collected for this purpose. Our
preliminary findings show that our model can predict the number of asthma ED visits based
on near-real-time environmental and social media data with approximately 70% precision.
The results can be helpful for public health surveillance, emergency department
preparedness, and, targeted patient interventions.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 PRIVACY POLICY INFERENCE OF USER-UPLOADED IMAGES ON CONTENT

SHARING SITES

1.1 ABSTRACT:

With the increasing volume of images users share through social sites, maintaining privacy
has become a major problem, as demonstrated by a recent wave of publicized incidents where
users inadvertently shared personal information. In light of these incidents, the need of tools
to help users control access to their shared content is apparent. Toward addressing this need,
we propose an Adaptive Privacy Policy Prediction (A3P) system to help users compose
privacy settings for their images. We examine the role of social context, image content, and
metadata as possible indicators of users’ privacy preferences.

We propose a two-level framework which according to the user’s available history on the
site, determines the best available privacy policy for the user’s images being uploaded. Our
solution relies on an image classification framework for image categories which may be
associated with similar policies, and on a policy prediction algorithm to automatically
generate a policy for each newly uploaded image, also according to users’ social features.
Over time, the generated policies will follow the evolution of users’ privacy attitude. We
provide the results of our extensive evaluation over 5,000 policies, which demonstrate the
effectiveness of our system, with prediction accuracies over 90 percent.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 PRIVACY-PRESERVING DETECTION OF SENSITIVE DATA EXPOSURE
1.1 ABSTRACT:

Statistics from security firms, research institutions and government organizations show that
the numbers of data-leak instances have grown rapidly in recent years. Among various data-
leak cases, human mistakes are one of the main causes of data loss. There exist solutions
detecting inadvertent sensitive data leaks caused by human mistakes and to provide alerts for
organizations. A common approach is to screen content in storage and transmission for
exposed sensitive information. Such an approach usually requires the detection operation to
be conducted in secrecy. However, this secrecy requirement is challenging to satisfy in
practice, as detection servers may be compromised or outsourced.

In this paper, we present a privacy preserving data-leak detection (DLD) solution to solve the
issue where a special set of sensitive data digests is used in detection. The advantage of our
method is that it enables the data owner to safely delegate the detection operation to a
semihonest provider without revealing the sensitive data to the provider. We describe how
Internet service providers can offer their customers DLD as an add-on service with strong
privacy guarantees. The evaluation results show that our method can support accurate
detection with very small number of false alarms under various data-leak scenarios.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 PRIVACY-PRESERVING RELATIVE LOCATION BASED SERVICES

FOR MOBILE USERS

ABSTRACT:

Location-aware applications have been used widely with the assistance of the latest
positioning features in Smart Phone such as GPS, AGPS, etc. However, all the existing
applications gather users’ geographical data and transfer them into the pertinent information
to give meaning and value. For this kind of solutions, the user’s privacy and security issues
might be raised because the geographical location has to be exposed to the service provider.
A novel and practical solution is proposed in this article to provide the relative location of
two mobile users based on their WiFi scanned results without any additional sensors. There is
no privacy concern in this solution because end users will not collect and send any sensitive
information to the server. This solution adopts a Client/Server (C/S) architecture, where the
mobile user as a client reports the ambient WiFi APs and the server calculates the distances
based on the WiFi AP’s topological relationships. A series of technologies are explored to
improve the accuracy of the estimated distance and the corresponding algorithms are
proposed. We also prove the feasibility with the prototype of “Circle Your Friends” System
(CYFS) on Android phone which lets the mobile user know the distance between him and his
social network friends.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 PROOF OF OWNERSHIP IN DEDUPLICATED CLOUD STORAGE WITH

MOBILE DEVICE EFFICIENCY

1.1 ABSTRACT:

Cloud storage such as Dropbox and Bitcasa is one of the most popular cloud services.
Currently, with the prevalence of mobile cloud computing, users can even collaboratively edit
the newest version of documents and synchronize the newest files on their smart mobile
devices. A remarkable feature of current cloud storage is its virtually infinite storage. To
support unlimited storage, the cloud storage provider uses data deduplication techniques to
reduce the data to be stored and therefore reduce the storage expense. Moreover, the use of
data deduplication also helps significantly reduce the need for bandwidth and therefore
improve the user experience. Nevertheless, in spite of the above benefits, data deduplication
has its inherent security weaknesses. Among them, the most severe is that the adversary may
have an unauthorized file downloading via the file hash only. In this article we first review
the previous solutions and identify their performance weaknesses. Then we propose an
alternative design that achieves cloud server efficiency and especially mobile device
efficiency.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 PUBLIC INTEGRITY AUDITING FOR SHARED DYNAMIC CLOUD DATA

WITH GROUP USER REVOCATION

1.1 ABSTRACT:

The advent of the cloud computing makes storage outsourcing becomes a rising trend, which
promotes the secure remote data auditing a hot topic that appeared in the research literature.
Recently some research considers the problem of secure and efficient public data integrity
auditing for shared dynamic data. However, these schemes are still not secure against the
collusion of cloud storage server and revoked group users during user revocation in practical
cloud storage system.

In this paper, we figure out the collusion attack in the exiting scheme and provide an efficient
public integrity auditing scheme with secure group user revocation based on vector
commitment and verifier-local revocation group signature. We design a concrete scheme
based on our scheme definition.

We design an efficient and reliable scheme, while achieving secure group user revocation. To
the end, we propose a construction which not only supports group data encryption and
decryption during the data modification processing, but also realizes efficient and secure user
revocation. Our idea is to apply vector commitment scheme over the database.

Then we leverage the Asymmetric Group Key Agreement (AGKA) and group signatures to
support cipher text data base update among group users and efficient group user revocation
respectively. Specifically, the group user use the AGKA protocol to encrypt/decrypt the share
database, which will guarantee that a user in the group will be able to encrypt/decrypt a
message from any other group users.

Our scheme supports the public checking and efficient user revocation and also some nice
properties, such as confidently, efficiency, countability and traceability of secure group user

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
revocation. Finally, the security and experimental analysis show that compared with its
relevant schemes our scheme is also secure and efficient.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 REAL-TIME BIG DATA ANALYTICAL ARCHITECTURE FOR REMOTE

SENSING APPLICATION

ABSTRACT:

In today’s era, there is a great deal added to real-time remote sensing Big Data than it seems
at first, and extracting the useful information in an efficient manner leads a system toward a
major computational challenges, such as to analyze, aggregate, and store, where data are
remotely collected. Keeping in view the above mentioned factors, there is a need for
designing a system architecture that welcomes both realtime, as well as offline data
processing. In this paper, we propose real-time Big Data analytical architecture for remote
sensing satellite application.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 Real-time path planning based on hybrid-VANET-Enhanced Transportation System

Abstract:

In vehicular Ad hoc Networks Real-time path planning can efficiently relieve traffic
congestion in urban scenarios. However, how to design an efficient path-planning algorithm
to achieve a globally optimal vehicle traffic control still remains a challenging problem,
particularly when we take drivers’ individual preferences into consideration. Our proposed
system first establish a hybrid intelligent transportation system (ITS), i.e., a hybrid-VANET-
enhanced ITS, which utilizes both vehicular ad hoc networks (VANETs) and cellular systems
of the public transportation system to enable real-time communications among vehicles,
roadside units (RSUs), and a vehicle-traffic server in an efficient way. For these kind of
reason our proposed system implement the technology with a real-time path-planning
algorithm, which not only improves the overall spatial utilization of a road network but
reduces average vehicle travel cost for avoiding vehicles from getting stuck in congestion as
well.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 RECEIVER COOPERATION IN TOPOLOGY CONTROL FOR WIRELESS

AD-HOC NETWORKS

ABSTRACT:

We propose employing receiver cooperation in centralized topology control to improve

energy efficiency as well as network connectivity. The idea of transmitter cooperation has
been widely considered in topology control to improve network connectivity or energy
efficiency. However, receiver cooperation has not previously been considered in topology
control. In particular, we show that we can improve both connectivity and energy efficiency
if we employ receiver cooperation in addition to transmitter cooperation.

Consequently, we conclude that a system based both on transmitter and receiver cooperation
is generally superior to one based only on transmitter cooperation. We also show that the
increase in network connectivity caused by employing transmitter cooperation in addition to
receiver cooperation is at the expense of significantly increased energy consumption.
Consequently, system designers may opt for receiver-only cooperation in cases for which
energy efficiency is of the highest priority or when connectivity increase is no longer a
serious concern

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 DIDRIP PROTOCOL FOR DATA DISTRIBUTED IN MULTI-HOP WIRELESS

SENSOR NETWORKS

1.1 ABSTRACT:

Distributed data discovery and dissemination is an increasingly relevant matter in WSNs,

especially in the emergent context of shared sensor networks, where sensing/communication
infrastructures from multiple owners will be shared by applications from multiple users. For
example, large scale sensor networks are built in recent networks are owned by multiple
owners and used by various authorized third-party users. Moreover, it is expected that
network owners and different users may have different privileges of dissemination in the first
secure and distributed data discovery and dissemination protocol named DiDrip.

We propose DiDrip in the first distributed data discovery and dissemination protocol, which
allows network owners and authorized users to disseminate data items into WSNs without
relying on the base station. Moreover, our extensive analysis demonstrates that DiDrip
satisfies the security requirements of the protocols of its kind. In particular, we apply the
provable security technique to formally prove the authenticity and integrity of the
disseminated data items in DiDrip allows the network owners to authorize multiple network
users with different privileges to simultaneously and directly disseminate data items to the
sensor nodes.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
SECURITY OPTIMIZATION OF DYNAMIC NETWORKS WITH PROBABILISTIC
GRAPH MODELING AND LINEAR PROGRAMMING

1.1 ABSTRACT:

Securing the networks of large organizations is technically challenging due to the complex
configurations and constraints. Managing these networks requires rigorous and
comprehensive analysis tools. A network administrator needs to identify vulnerable
configurations, as well as tools for hardening the networks. Such networks usually have
dynamic and fluidic structures, thus one may have incomplete information about the
connectivity and availability of hosts.

In this paper, we address the problem of statically performing a rigorous assessment of a set
of network security defense strategies with the goal of reducing the probability of a
successful large-scale attack in dynamically changing and complex network architecture. We
describe a probabilistic graph model and algorithms for analyzing the security of complex
networks with the ultimate goal of reducing the probability of successful attacks.

Our model naturally utilizes a scalable state-of-the-art optimization technique called

sequential linear programming that is extensively applied and studied in various engineering
problems. In comparison to related solutions on attack graphs, our probabilistic model
provides mechanisms for expressing uncertainties in network configurations, which is not
reported elsewhere. We have performed comprehensive experimental validation with real-
world network configuration data of a sizable organization.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 SHARED AUTHORITY BASED PRIVACY-PRESERVING AUTHENTICATION

PROTOCOL IN CLOUD COMPUTING

1.1 ABSTRACT:

Cloud computing is emerging as a prevalent data interactive paradigm to realize users’ data
remotely stored in an online cloud server. Cloud services provide great conveniences for the
users to enjoy the on-demand cloud applications without considering the local infrastructure
limitations. During the data accessing, different users may be in a collaborative relationship,
and thus data sharing becomes significant to achieve productive benefits. The existing
security solutions mainly focus on the authentication to realize that a user’s privative data
cannot be unauthorized accessed, but neglect a subtle privacy issue during a user challenging
the cloud server to request other users for data sharing. The challenged access request itself
may reveal the user’s privacy no matter whether or not it can obtain the data access
permissions.

In this paper, we propose a shared authority based privacy-preserving authentication protocol

(SAPA) to address above privacy issue for cloud storage. In the SAPA, 1) shared access
authority is achieved by anonymous access request matching mechanism with security and
privacy considerations (e.g., authentication, data anonymity, user privacy, and forward
security); 2) attribute based access control is adopted to realize that the user can only access
its own data fields; 3) proxy re-encryption is applied by the cloud server to provide data
sharing among the multiple users. Meanwhile, universal composability (UC) model is
established to prove that the SAPA theoretically has the design correctness. It indicates that
the proposed protocol realizing privacy-preserving data access authority sharing is attractive
for multi-user collaborative cloud applications.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi
 STATISTICAL DISSEMINATION CONTROL IN LARGE MACHINE-TO-

MACHINE COMMUNICATION NETWORKS

1.1 ABSTRACT:

Cloud based machine-to-machine (M2M) communications have emerged to achieve

ubiquitous and autonomous data transportation for future daily life in the cyber-physical
world. In light of the need of network characterizations, we analyze the connected M2M
network in the machine swarm of geometric random graph topology, including degree
distribution, network diameter, and average distance (i.e., hops). Without the need of end-to-
end information to escape catastrophic complexity, information dissemination appears an
effective way in machine swarm. To fully understand practical data transportation, G/G/1
queuing network model is exploited to obtain average end-to-end delay and maximum
achievable system throughput.

Furthermore, as real applications may require dependable networking performance across the
swarm, quality of service (QoS) along with large network diameter creates a new intellectual
challenge. We extend the concept of small-world network to form shortcuts among data
aggregators as infrastructure-swarm two-tier heterogeneous network architecture, and then
leverage the statistical concept of network control instead of precise network optimization, to
innovatively achieve QoS guarantees. Simulation results further confirm the proposed
heterogeneous network architecture to effectively control delay guarantees in a statistical way
and to facilitate a new design paradigm in reliable M2M communications.

Engineering College Road, Annamalai Nagar, Chidambaram, 9865047685, 9944667791 www.infosyst.net

No 1, Meyappan Ambalam Street, 100 Feet Road, Near, Periyar Statue Signal, Karaikudi