Packet-Hiding Methods for Preventing Selective Jamming Attacks

Packet-Hiding Methods for Preventing Selective Jamming Attacks Dependable and Secure Computing 2012- January- February 2012 Technology Used: JAVA The open nature of the wireless medium leaves it vulnerable to intentional interference attacks, typically referred to as jamming. This intentional interference with wireless transmissions can be used as a launchpad for mounting Denial-of-Service attacks on wireless networks. Typically, jamming has been addressed under an external threat model. However, adversaries with internal knowledge of protocol specifications and network secrets can launch low-effort jamming attacks that are difficult to detect and counter. In…

Read More

pCloud: A Distributed System for Practical PIR

pCloud: A Distributed System for Practical PIR –  projects 2012 Dependable and Secure Computing – projects 2012 projects 2012 – January- February 2012 Technology Used: Java/J2EE Computational Private Information Retrieval (cPIR) protocols allow a client to retrieve one bit from a database, without the server inferring any information about the queried bit. These protocols are too costly in practice because they invoke complex arithmetic operations for every bit of the database. In this paper, we present pCloud, a distributed system that constitutes the first attempt toward practical cPIR. Our approach assumes…

Read More

Multiple Exposure Fusion for High Dynamic Range Image Acquisition

Multiple Exposure Fusion for High Dynamic Range Image Acquisition -  projects 2012 Image Processing – projects 2012 projects 2012- January 2012 Technology Used: DOT NET A multiple exposure fusion to enhance the dynamic range of an image is proposed. The construction of high dynamic range images (HDRIs) is performed by combining multiple images taken with different exposures and estimating the irradiance value for each pixel. This is a common process for HDRI acquisition. During this process, displacements of the images caused by object movements often yield motion blur and ghosting…

Read More

Pareto-Based Dominant Graph: An Efficient Indexing Structure To Answer Top-K Queries

Pareto-Based Dominant Graph: An Efficient Indexing Structure To Answer Top-K Queries Technology Used: Dot Net Knowledge and Data Engineering, 2011 Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investigate the intrinsic connection between top-k queries and dominant relationships between records, and based on which, we propose an efficient layer-based indexing structure, Pareto-Based Dominant Graph (DG), to improve the query efficiency. Specifically, DG is built…

Read More