Suppose Alice owns a k-anonymous database and needs to determine whether her database, when inserted with a tuple owned by Bob, is still k-anonymous. Also,suppose that access to the database is strictly controlled, because for example data are used for certain experiments that need to be maintained confidential. Clearly,allowing Alice to directly read the contents […]
Nymble: Blocking Misbehaving Users in Anonymizing Networks
Anonymizing networks such as Tor allow users to access Internet services privately by using a series of routers to hide the client’s IP address from the server. The success of such networks, however, has been limited by users employing this anonymity for abusive purposes such as defacing popular Web sites. Web site administrators routinely rely […]
Robust Correlation of Encrypted Attack Traffic through Stepping Stones by Flow Watermarking
Network-based intruders seldom attack their victims directly from their own computer. Often, they stage their attacks through intermediate “stepping stones” in order to conceal their identity and origin. To identify the source of the attack behind the stepping stone(s), it is necessary to correlate the incoming and outgoing flows or connections of a stepping stone. […]
A Tamper-Resistant Programming Language System
An important and recurring security scenario involves the need to carry out trusted computations in the context of untrusted environments. It is shown how a tamper-resistant interpreter for a programming language-currently Lisp 1.5-combined with the use of a secure coprocessor can address this problem. This solution executes the interpreter on the secure coprocessor while the […]
A Policy Enforcing Mechanism for Trusted Ad Hoc Networks
To ensure fair and secure communication in Mobile Ad hoc Networks (MANETs), the applications running in these networks must be regulated by proper communication policies. However, enforcing policies in MANETs is challenging because they lack the infrastructure and trusted entities encountered in traditional distributed systems. This paper presents the design and implementation of a policy […]
A Spatiotemporal Approach for Secure Range Queries in Tiered Sensor Networks
We target a two-tier sensor network with resource-rich master nodes at the upper tier and resource-poor sensor nodes at the lower tier. Master nodes collect data from sensor nodes and answer the queries from the network owner. The reliance on master nodes for data storage and query processing raises serious concerns about both data confidentiality […]
Distributed Adaptation of Quantized Feedback for Downlink Network MIMO Systems
This paper focuses on quantized channel state information (CSI) feedback for downlink network MIMO systems. Specifically, we propose to quantize and feedback the CSI of a subset of BSs, namely the feedback set. Our analysis reveals the tradeoff between better interference mitigation with large feedback set and high CSI quantization precision with small feedback set. […]
Network Coding Based Privacy Preservation against Traffic Analysis in Multi-hop Wireless Networks
Privacy threat is one of the critical issues in multi-hop wireless networks, where attacks such as traffic analysis and flow tracing can be easily launched by a malicious adversary due to the open wireless medium. Network coding has the potential to thwart these attacks since the coding/mixing operation is encouraged at intermediate nodes. However, the […]
The Awareness Network, To Whom Should I Display My Actions? And, Whose Actions Should I Monitor?
The concept of awareness plays a pivotal role in research in Computer-Supported Cooperative Work. Recently, software engineering researchers interested in the collaborative nature of software development have explored the implications of this concept in the design of software development tools. A critical aspect of awareness is the associated coordinative work practices of displaying and monitoring […]
Continuous Neighbor Discovery in Asynchronous Sensor Networks
In most sensor networks, the nodes are static. Nevertheless, node connectivity is subject to changes because of disruptions in wireless communication, transmission power changes, or loss of synchronization between neighboring nodes. Hence, even after a sensor is aware of its immediate neighbors, it must continuously maintain its view, a process we call continuous neighbor discovery. […]
- « Previous Page
- 1
- …
- 4
- 5
- 6
- 7
- 8
- 9
- Next Page »