Encryption is the most useful technique used for security of data during storage and transmission. A well-known encryption scheme called Double Random Phase encoding was introduced by Refregier Javidi. But due to its linear nature, this has been proven vulnerable against Known plaintext chosen attacks. Here in paper, we propose a chaotic map-based nonlinear that enhances DRPE images. Clifford a...

In MANET, routing plays a vital role in packet interaction and data transmission. It is always easy to manage the transmission over MANET because of uncentralized control on nodes. Since efficient route controls packets does not simplify between source destination. Hence maintenance becomes crucial process. Methods: critical enhance decrease attacker sustain successful transfers via Network. ot...

Resource management problems play an important role in technology and economy. In general, resource management tries to use an enterprise’s resources as efficiently as possible to maximize a (potentially financial) benefit. This thesis addresses two specific resource management problems in computer networks. Resource Management during Denial-of-Service Attacks During a denial-of-service (DoS) a...

We develop an economic model of an offline password cracker which allows us to make quantitative predictions about the fraction of accounts that a rational password attacker would crack in the event of an authentication server breach. We apply our economic model to analyze recent massive password breaches at Yahoo!, Dropbox, LastPass and AshleyMadison. All four organizations were using key-stre...

Concurrent non-malleable zero-knowledge (CNMZK) considers the concurrent execution of zero-knowledge protocols in a setting where the attacker can simultaneously corrupt multiple provers and verifiers. We provide the first construction of a CNMZK protocol that, without any trusted set-up, remains secure even if the attacker may adaptively select the statements to receive proofs of; previous wor...

The Internet is large, but it is finite. We examine the case of several attackers seeking victims in a large population where there is some prior statistic indicating likely viablility. We show that collisions reduce attacker gains: the sum of what several attackers can extract is always less than what a single attacker would extract alone. The problem gets worse as the density of victims in th...

We propose to design, develop and experiment a new approach of formal security proofs. One of the main issues in formal security proofs is to design an attacker model. Such a model is always disputable; even when a proof is completed in some model, one can find an attack in another model. This project aims at bypassing the problem, roughly by specifying what an attacker cannot do, instead of sp...

This paper discusses basic security aspects of distributed random number generation in potentially hostile environments. The goal is to outline and discuss a distributed approach, which comes to question in the case of attacker being able to target one or several mobile devices. We define communication paths and attacker models instead of providing technical details of local generation. This pa...