Prashant Dewan

Learn More
Peer-to-peer (P2P) networks use the fundamental assumption that the nodes in the network will cooperate and will not cheat. In the absence of any common goals shared by the nodes of a peer-to-peer network, external motivation to cooperate and be trustworthy is mandated. Digital Reputations can be used to inject trust among the nodes of a network. This paper(More)
Nodes in mobile ad hoc networks have a limited transmission range. Hence the nodes expect their neighbors to relay packets meant for far off destinations. These networks are based on the fundamental assumption that if a node promises to relay a packet, it will relay it and will not cheat. This assumption becomes invalid when the nodes in the network have(More)
An important goal of software security is to ensure sensitive/secret data owned by a program shall be exclusively accessible by the program. An obstacle to such security goal is that modern commodity operating systems (OS) for the sake of speed and flexibility have a unified linear address space--any OS kernel program can access all the linear addresses. As(More)
Peer-to-peer (P2P) networks are designed with an assumption that the nodes in a P2P network will cooperate each other. In the absence of any common goals shared by the nodes of a P2P network, external motivation to cooperate and be trustworthy is required. Digital Reputations can be used to inject trust among the autonomous nodes of a network and motivate(More)
—Peer-to-peer (P2P) networks are vulnerable to peers who cheat, propagate malicious code, leech on the network, or simply do not cooperate. The traditional security techniques developed for the centralized distributed systems like client-server networks are inappropriate for P2P networks by the virtue of their centralized nature. The absence of central(More)
Malicious root-kits modify the in-memory state of programs executing on an endpoint to hide themselves from security software. Such attacks negatively affect network-based security frameworks that depend on the trustworthiness of endpoint software. In network access control frameworks this issue is called the lying-endpoint problem, where a compromised(More)
This paper addresses the problem of DoS (Denial of Service) attacks. The technique proposed in this makes DoS attacks difficult by providing the location of a service only to the pre-registered users and hiding it from all others. In addition, a static service is converted to a relocating service and it relocates whenever attacked. The Domain Name Service(More)
Nodes in mobile ad hoc networks have limited transmission ranges that necessitate multihop communication. Hence the nodes expect their neighbours to relay the packets meant for nodes out of the transmission range of the source. Ad hoc networks are based on the fundamental assumption that if a node promises to relay a packet, it will relay the packet and(More)
Timing attacks exploit a loophole that allows any website to deduce confidential information f rom a web user visiting the website by peeping into the user's Internet cache or DNS resolver cache. Any unscrupulous attacker can also insert 'cache cookies' into the user's Internet cache. The solutions, which have been proposed so far, are disabling the caches,(More)
  • 1