Titlebook: Data and Applications Security and Privacy XXIV; 24th Annual IFIP WG Sara Foresti,Sushil Jajodia Conference proceedings 2010 IFIP Internat

Interferons

Understanding Privacy Risk of Publishing Decision Treesential risk to privacy. However, there is not much investigation on the privacy consequence of publishing decision trees. To understand this problem, we need to quantitatively measure privacy risk..Based on the well-established maximum entropy theory, we have developed a systematic method to quantif

肉體

Secure Outsourcing of DNA Searching via Finite Automatarvice provider has a pattern that corresponds to a genetic test. Error-resilient searching is achieved by representing the pattern as a finite automaton and evaluating it on the DNA sequence, where privacy of both the pattern and the DNA sequence must be preserved. Interactive solutions to this prob

fledged

抵消

Role Mining in the Presence of Noiseent years. The role mining problem (RMP) and several of its variants have been proposed in the literature. While the basic RMP discovers roles that exactly represent the UPA, the . variants, such as the .-approx RMP and MinNoise-RMP, allow for some inexactness in the sense that the discovered roles

相同

Distributed and Secure Access Control in P2P Databases demand adequate mechanisms to restrict the access to authorized parties. In this paper, we study a distributed access control model, where data items are stored, queried and authenticated in a totally decentralized fashion. Our contribution focuses on the design of a comprehensive framework for acc

Integrate

Constructing Key Assignment Schemes from Chain Partitions first contribution is to improve an existing cryptographic access control mechanism for scalable multimedia formats. We then show how our methods can be applied to a chain partition to develop alternative mechanisms for scalable multimedia formats and how these methods can themselves be extended to

gustation

Query: SPARQL Query Rewriting to Enforce Data Confidentialitysive language to query RDF databases. SPARQL has been defined to easily localize and extract data in an RDF graph. Since confidential data are accessed, SPARQL queries must be filtered so that only authorized data are returned with respect to some confidentiality policy. In this paper, we model a co

FLAIL

改變立場(chǎng)

Query Racing: Fast Completeness Certification of Query Resultstion is the concept of “Query Race”: we split up a general query into several single attribute queries, and exploit concurrency and speed to bind the complexity to the fastest of them. Our method supports selection queries with general composition of conjunctive and disjunctive order-based condition

In-Situ