1.

Fuzzy Keyword Search over Encrypted Data in Cloud Computing

Domain Name: Cloud

Computing

As Cloud Computing becomes prevalent, more and more sensitive information are
being centralized into the cloud. For the protection of data privacy, sensitive data
usually have to be encrypted before outsourcing, which makes effective data
utilization a very challenging task. Although traditional searchable encryption
schemes allow a user to securely search over encrypted data through keywords and
selectively retrieve files of interest, these techniques support only exact keyword
search. That is, there is no tolerance of minor typos and format inconsistencies
which, on the other hand, are typical user searching behavior and happen very
frequently. This significant drawback makes existing techniques unsuitable in Cloud
Computing as it greatly affects system usability, rendering user searching
experiences very frustrating and system efficacy very low. In this paper, for the first
time we formalize and solve the problem of effective fuzzy keyword search over
encrypted cloud data while maintaining keyword privacy. Fuzzy keyword search
greatly enhances system usability by returning the matching files when users’
searching inputs exactly match the predefined keywords or the closest possible
matching files based on keyword similarity semantics, when exact match fails. In
our solution, we exploit edit distance to quantify keywords similarity and develop an
advanced technique on constructing fuzzy keyword sets, which greatly reduces the
storage and representation overheads. Through rigorous security analysis, we show
that our proposed solution is secure and privacy-preserving, while correctly realizing
the goal of fuzzy keyword search.

2.Optimal Accounting Policies for AAA Systems in Mobile

Telecommunications Networks

Domain Name: Mobile

Computing

Authentication, Authorization, and Accounting (AAA) deployments are expected to

grow significantly in emerging mobile systems as they offer a plethora of services
and mobile applications. In current systems, network access servers (NAS)
periodically report the service usage of mobile users located within their coverage
areas. The periodic reports are used by the billing systems to minimize the incurred
capital losses if the serving NAS fails. While shorter reporting intervals are desired
for lower losses, they can potentially result in undesirably high signaling load.
Because it is prohibitively difficult to obtain optimal reporting intervals in mobile
systems due to multitudes of services with different mobility profiles, current
accounting standards offer no quantitative measures for selecting a proper
reporting interval and AAA systems are typically designed via over provisioning. To
address this issue, we propose an adaptive optimization mechanism in multiservice
AAA systems which limits the potential loss without excessively generating
unnecessary usage reports. Our optimization mechanism embraces the current AAA
IETF standards RADIUS and its successor Diameter and does not require any
modifications to the AAA protocols nor to the network access servers’
implementation, and its implementation scope is limited to the AAA systems. The
results demonstrate that our mechanism is robust under various operational
conditions, easy to implement, and offers considerable potential for loss control
compared to the current static approaches.
Index Terms—AAA, accounting, RADIUS, Diameter, accounting interim interval.
3. A Global Contribution Approach to Maintain Fairness in P2P Networks

Domain Name: Cloud

Computing

For many P2P systems, implementing right incentives and policies to promote
efficient and fair resource sharing is the key to improve the overall system
performance. In this paper, we propose a points-based incentive mechanism named
Global Contribution (GC) approach that efficiently and naturally maintains fairness
in a P2P network. In this approach, a proposed GC algorithm first calculates a global
score for each peer that accurately reflects its bandwidth contribution to the entire
network. Then, these scores are used in a proposed data transfer policy to
determine whether one peer can download data from other peers. Thus, the GC
approach achieves: 1) efficiently preventing free-riding, 2) naturally balancing the
upload and download amounts in each peer, and 3) reducing rejections in
transactions between cooperative peers. Moreover, the GC algorithm requires only
private transaction history as an input and can be fully decentralized. Also, its time
complexities are approximately OðN2Þ in a centralized system and OðNÞ per peer
in a decentralized system.
Index Terms—P2P, free-riding, global contribution, fairness, distributed systems

4 Fault-tolerant Mobile Agent-based Monitoring Mechanism for Highly

Dynamic Distributed Networks
Domain Name: Network

Thanks to asynchronous and dynamic natures of mobile agents, a certain number of

mobile agent-based monitoring mechanisms have actively been developed to
monitor large-scale and dynamic distributed networked systems adaptively and
efficiently. Among them, some mechanisms attempt to adapt to dynamic changes
in various aspects such as network traffic patterns, resource addition and deletion,
network topology and so on. However, failures of some domain managers are very
critical to providing correct, real-time and efficient monitoring functionality in a
large-scale mobile agent-based distributed monitoring system. In this paper, we
present a novel fault tolerance mechanism to have the following advantageous
features appropriate for large-scale and dynamic hierarchical mobile agent-based
monitoring organizations. It supports fast failure detection functionality with low
failure-free overhead by each domain manager transmitting heart-beat messages to
its immediate higher-level manager. Also, it minimizes the number of non-faulty
monitoring managers affected by failures of domain managers. Moreover, it allows
consistent failure detection actions to be performed continuously in case of agent
creation, migration and termination, and is able to execute consistent takeover
actions even in concurrent failures of domain managers.

Keywords: Distributed Network, Fault-tolerance, Mobile Agent, Scalability, Takeover

5.Layered Approach Using Conditional Random Fields for Intrusion
Detection

Domain Name: Network

Security

Intrusion detection faces a number of challenges; an intrusion detection system

must reliably detect malicious activities in a network and must perform efficiently to
cope with the large amount of network traffic. In this paper, we address these two
issues of Accuracy and Efficiency using Conditional Random Fields and Layered
Approach. We demonstrate that high attack detection accuracy can be achieved by
using Conditional Random Fields and high efficiency by implementing the Layered
Approach. Experimental results on the benchmark KDD ’99 intrusion data set show
that our proposed system based on Layered Conditional Random Fields outperforms
other well-known methods such as the decision trees and the naive Bayes. The
improvement in attack detection accuracy is very high, particularly, for the U2R
attacks (34.8 percent improvement) and the R2L attacks (34.5 percent
improvement). Statistical Tests also demonstrate higher confidence in detection
accuracy for our method. Finally, we show that our system is robust and is able to
handle noisy data without compromising performance.

Index Terms—Intrusion detection, Layered Approach, Conditional Random Fields,

network security, decision trees, naive Bayes.