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 […]
Discovery and Resolution of Anomalies in Web Access Control Policies
Emerging computing technologies such as Web services, service-oriented architecture, and cloud computing has enabled us to perform business services more efficiently and effectively. However, we still suffer from unintended security leakages by unauthorized actions in business services while providing more convenient services to Internet users through such a cutting-edge technological growth. Furthermore, designing and managing […]
A Stochastic Model to Investigate Data Center Performance and QoS in IaaS Cloud Computing Systems
Cloud data center management is a key problem due to the numerous and heterogeneous strategies that can be applied, ranging from the VM placement to the federation with other clouds. Performance evaluation of Cloud Computing infrastructures is required to predict and quantify the cost-benefit of a strategy portfolio and the corresponding Quality of Service (QoS) […]
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 […]
Memory access virtualization to deal with stack buffer overflow attacks
In this paper we presented Memory access virtualization is a key mechanism we used to deal with stack buffer overflow attacks. The key technique of our solution is to virtualize memory accesses and move the vulnerable buffer into protected memory regions, which provides a fundamental and effective protection against recurrence of the same attack without […]
- « Previous Page
- 1
- …
- 5
- 6
- 7
- 8
- 9
- …
- 12
- Next Page »