Web : www.kasanpro.com
Email : sales@kasanpro.com
http://kasanpro.com/ieee/final-year-project-center-nagapattinam-reviews
Title :Distributed Detection of Clone Attacks in Wireless Sensor Networks
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/detection-clone-attacks-wireless-sensor-networks-code
Abstract : Wireless Sensor Networks (WSNs) are often deployed in hostile environments where an adversary can
physically capture some of the nodes, first can reprogram, and then, can replicate them in a large number of clones,
easily taking control over the network. A few distributed solutions to address this fundamental problem have been
recently proposed. However, these solutions are not satisfactory. First, they are energy and memory demanding: A
serious drawback for any protocol to be used in the WSN - resource constrained environment. Further, they are
vulnerable to the specific adversary models introduced in this paper. The contributions of this work are threefold. First,
we analyze the desirable properties of a distributed mechanism for the detection of node replication attacks. Second,
we show that the known solutions for this problem do not completely meet our requirements. Third, we propose a new
self-healing, Randomized, Efficient, and Distributed (RED) protocol for the detection of node replication attacks, and
we show that it satisfies the introduced requirements. Finally, extensive simulations show that our protocol is highly
efficient in communication, memory, and computation; is much more effective than competing solutions in the
literature; and is resistant to the new kind of attacks introduced in this paper, while other solutions are not.
Title :Extracting Spread-Spectrum Hidden Data from Digital Media
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/extracting-spread-spectrum-hidden-data-digital-media
Abstract : We consider the problem of extracting blindly data embedded over a wide band in a spectrum (transform)
domain of a digital medium (image, audio, video). We develop a novel multi- carrier/signature iterative generalized
least-squares (M-IGLS) core procedure to seek unknown data hidden in hosts via multi- carrier spread-spectrum
embedding. Neither the original host nor the embedding carriers are assumed available. Experimental studies on
images show that the developed algorithm can achieve recovery probability of error close to what may be attained
with known embedding carriers and host autocorrelation matrix.
M.E Computer Science Secure Computing Projects
and compare it to a set of idealized security and functionality requirements. We show that it is vulnerable to several
attacks, including impersonation, collusion, and privacy breaching, even though it was designed specifically for
security. Mindful of the possible pitfalls, we construct a flexible frame- work for secure encounter-based social
networks, which can be used to construct networks that offer different security, privacy, and availability guarantees.
We describe two example constructions derived from this framework, and consider each in terms of the ideal
requirements. Some of our new designs fulfill more requirements in terms of system security, reliability, and privacy
than previous work. We also evaluate real-world performance of one of our designs by implementing a
proof-of-concept iPhone application called MeetUp. Experiments highlight the potential of our system and hint at the
deployability of our designs on a large scale.
Title :Secure Encounter-based Mobile Social Networks: Requirements, Designs, and Tradeoffs
Language : NS2
Project Link :
http://kasanpro.com/p/ns2/secure-encounter-based-mobile-social-networks-requirements-designs-tradeoffs-code
Abstract : Encounter-based social networks and encounter-based systems link users who share a location at the
same time, as opposed to the traditional social network paradigm of linking users who have an offline friendship. This
new approach presents challenges that are fundamentally different from those tackled by previous social network
designs. In this paper, we explore the functional and security requirements for these new systems, such as
availability, security, and privacy, and present several design options for building secure encounter-based social
networks. To highlight these challenges we examine one recently proposed encounter-based social network design
and compare it to a set of idealized security and functionality requirements. We show that it is vulnerable to several
attacks, including impersonation, collusion, and privacy breaching, even though it was designed specifically for
security. Mindful of the possible pitfalls, we construct a flexible frame- work for secure encounter-based social
networks, which can be used to construct networks that offer different security, privacy, and availability guarantees.
We describe two example constructions derived from this framework, and consider each in terms of the ideal
requirements. Some of our new designs fulfill more requirements in terms of system security, reliability, and privacy
than previous work. We also evaluate real-world performance of one of our designs by implementing a
proof-of-concept iPhone application called MeetUp. Experiments highlight the potential of our system and hint at the
deployability of our designs on a large scale.
M.E Computer Science Secure Computing Projects
Title :Balancing Performance, Accuracy, and Precision for Secure Cloud Transactions
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/balancing-performance-accuracy-precision-secure-cloud-transactions
Abstract : In distributed transactional database systems deployed over cloud servers, entities cooperate to form
proofs of authorization that are justified by collections of certified credentials. These proofs and credentials may be
evaluated and collected over extended time periods under the risk of having the underlying authorization policies or
the user credentials being in inconsistent states. It therefore becomes possible for policy-based authorization systems
to make unsafe decisions that might threaten sensitive resources. In this paper, we highlight the criticality of the
problem. We then define the notion of trusted transactions when dealing with proofs of authorization. Accordingly, we
propose several increasingly stringent levels of policy consistency constraints, and present different enforcement
approaches to guarantee the trustworthiness of transactions executing on cloud servers. We propose a Two-Phase
Validation Commit protocol as a solution, which is a modified version of the basic Two-Phase Commit protocols. We
finally analyze the different approaches presented using both analytical evaluation of the overheads and simulations
to guide the decision makers to which approach to use.
http://kasanpro.com/ieee/final-year-project-center-nagapattinam-reviews
Title :Balancing Performance, Accuracy, and Precision for Secure Cloud Transactions
Language : NS2
Project Link :
http://kasanpro.com/p/ns2/balancing-performance-accuracy-precision-secure-cloud-distributed-transactions
Abstract : In distributed transactional database systems deployed over cloud servers, entities cooperate to form
proofs of authorization that are justified by collections of certified credentials. These proofs and credentials may be
evaluated and collected over extended time periods under the risk of having the underlying authorization policies or
the user credentials being in inconsistent states. It therefore becomes possible for policy-based authorization systems
to make unsafe decisions that might threaten sensitive resources. In this paper, we highlight the criticality of the
problem. We then define the notion of trusted transactions when dealing with proofs of authorization. Accordingly, we
propose several increasingly stringent levels of policy consistency constraints, and present different enforcement
approaches to guarantee the trustworthiness of transactions executing on cloud servers. We propose a Two-Phase
Validation Commit protocol as a solution, which is a modified version of the basic Two-Phase Commit protocols. We
finally analyze the different approaches presented using both analytical evaluation of the overheads and simulations
to guide the decision makers to which approach to use.