We propose a protocol for secure mining of association rules in horizontally distributed databases. The current leading protocol is that of Kantarcioglu and Clifton . The main ingredients in our protocol are two novel secure multi-party algorithms — one that computes the union of private subsets that each of the interacting players hold, and another […]
Preserving m-privacy to Anonymize a horizontally distributed Dataset
In this paper the m-privacy verification algorithms and protocols, we can use it to anonymize a horizontally distributed dataset while preserving m-privacyFirst, we introduce the notion of m-privacy, which guarantees that the anonymized data satisfies a given privacy constraint against any group of up to m colluding data providers. Second, we present heuristic algorithms exploiting […]
Sequential Clustering Anonymization of Centralized and Distributed Social Networks
We presented sequential clustering algorithms for anonymizing social networks. Those algorithms produce anonymizations by means of clustering with better utility than those achieved by existing algorithms. The goal is to arrive at an anonymized view of the unified network without revealing to any of the data holders information about links between nodes that are controlled […]
Optimal Multiserver Configuration for Profit Maximization in Cloud Computing
As cloud computing becomes more and more popular, understanding the economics of cloud computing becomes critically important. To maximize the profit, a service provider should understand both service charges and business costs, and how they are determined by the characteristics of the applications and the configuration of a multiserver system. The problem of optimal multiserver […]
Differentially-private data release for vertically partitioned Data between two parties
In this paper, we address the problem of private data publishing, where different attributes for the same set of individuals are held by two parties. In particular, we present an algorithm for differentially private data release for vertically-partitioned data between two parties in the semi-honest adversary model. To achieve thiss, we first present a two-party […]
ALERT: An Anonymous Location-Based Efficient Routing Protocol in MANETs
Mobile Ad Hoc Networks (MANETs) use anonymous routing protocols that hide node identities and/or routes from outside observers in order to provide anonymity protection. However, existing anonymous routing protocols relying on either hop-by-hop encryption or redundant traffic, either generate high cost or cannot provide full anonymity protection to data sources, destinations, and routes. The high […]
A generic framework for constructing encounter-based social Networks
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 […]
executing computations on untrusted machines in a trustworthy manner
We present sTile, a technique for building software systems that distribute large computations onto the cloud while providing guarantees that the cloud nodes cannot learn the computation’s private data. sTile is based on a nature-inspired, theoretical model of self-assembly. While sTile’s computational model is Turing universal, in this paper, we present a prototype implementation that […]
Detecting Distributed Reflection DoS Attacks based on Rank Correlation
DDoS presents a serious threat to the Internet since its inception, where lots of controlled hosts flood the victim site with massive packets. Moreover, in Distributed Reflection DoS (DRDoS), attackers fool innocent servers (reflectors) into flushing packets to the victim. But most of current DRDoS detection mechanisms are associated with specific protocols and cannot be […]
TDMA SCHEDULE FOR CONTINUOUS DATA COLLECTION WITH DYNAMIC TRAFFIC PATTERNS
We have presented a TDMA schedule that is suited to continuous data collection with dynamic traffic patterns. In contrast to most existing TDMA schedules designed for a static network traffic pattern, this paper proposes a novel TDMA schedule that is capable of efficiently collecting sensor data for any network traffic pattern and is thus well […]
- « Previous Page
- 1
- …
- 6
- 7
- 8
- 9
- Next Page »