14.00, room 455, PCRI
Abstract
Sender anonymity in location-based services (LBS) attempts to hide the identity of a mobile device user who sends
requests to the LBS provider for services in her proximity (e.g. “find the nearest gas station” etc.). The goal is to keep the requester’s interests private even from attackers who (via hacking or subpoenas) gain access to the request and to the locations of the mobile user and other nearby users at the time of the request. In an LBS context, the best-studied privacy guarantee is known as “sender k-anonymity”. We show that state-of-the art solutions for sender k-anonymity defend only against naive attackers who have no knowledge of the anonymization policy that is in use. We strengthen the privacy guarantee to defend against more realistic “policy-aware” attackers. We describe a polynomial algorithm to obtain an optimum anonymization policy. Our implementation and experiments show that the policy-aware sender k-anonymity has potential for practical impact: it is efficiently enforceable, with limited reduction in utility when compared to policy-unaware guarantees.
Joint work with Rick Hull (IBM TJ Watson), Avinash Vyas (Bell Labs, ex-UCSD) and Kevin Zhao (UCSD)
Permanent link to this article: https://team.inria.fr/oak/2012/06/26/alin-deutsch-policy-aware-sender-anonymity-in-location-based-services/
Permanent link to this article: https://team.inria.fr/oak/2012/06/22/oak-day-at-chateau-de-dampierre/
14.00, room 455, PCRI
Abstract
As an essential part of the W3C’s semantic web stack and linked data initiative, RDF data management systems (also known as triplestores) have drawn a lot of research attention. The majority of these systems use value-based indexes (e.g., B+-trees) for physical storage, and ignore many of the structural aspects present in RDF graphs. Structural indexes, on the other hand, have been successfully applied in XML and semi-structured data management to exploit structural graph information in query processing. In those settings, a structural index groups nodes in a graph based on some equivalence criterion, for example, indistinguishability with respect to some query workload (usually XPath). Motivated by this body of work, we have started the SAINT-DB project to study and develop a native RDF management system based on structural indexes. In this talk we present a principled framework for designing and using RDF structural indexes for practical fragments of SPARQL, based on recent formal structural characterizations of these fragments. We then explain how structural indexes can be incorporated in a typical query processing work ow; and discuss the design, implementation, and initial empirical evaluation of our approach.
You can find the slides of the talk here.
Permanent link to this article: https://team.inria.fr/oak/2012/06/08/jan-hidders-a-structural-approach-to-indexing-triples/
We particularly enjoyed this year’s SIGMOD in Scottsdale, Arizona. Proceedings are not online yet, but there was a promise to put them here: http://bit.ly/sigmod2012!
Continue reading
Permanent link to this article: https://team.inria.fr/oak/2012/05/25/sigmod-2012-was-great/
“SPARQL query answering with bitmap indexes” (short paper), Julien Leblay
4th International Workshop on Semantic Web Information Management – May 20, 2012, Scottsdale, AZ, USA.
Permanent link to this article: https://team.inria.fr/oak/2012/04/20/swim2012/
“ViP2P : Efficient XML Management in DHT Networks”,
Konstantinos Karanasos, Asterios Katsifodimos, Ioana Manolescu, Spyros Zoupanos.
To appear in the 12th International Conference on Web Engineering, 23-27 July 2012, Berlin, Germany (short paper).
Permanent link to this article: https://team.inria.fr/oak/2012/04/17/icwe-2012-vip2p-efficient-xml-management-in-dht-networks/
“Minersoft: Software Retrieval in Grid and Cloud Computing Infrastructures”,
Marios D. Dikaiakos, Asterios Katsifodimos, George Pallis.
To appear in ACM Transactions on Internet Technology (TOIT), 2012.
Permanent link to this article: https://team.inria.fr/oak/2012/04/16/acm-toit-minersoft-software-retrieval-in-grid-and-cloud-computing-infrastructures/
This is a set of notes I drafted in early 2010 for my students of that time. Current students asked that I blog them here, so here it goes:
It is a timeless truth that papers may need squeezing. Below, find a list of basic tricks, which are not subtle but very helpful, and which every successful author in the field knows.
As part of getting a PhD, you are supposed to learn these and apply them independently and appropriately.
1. Removing lines
This works tremendously well. The idea is that if a paragraph has a short last line, it is very often possible to rephrase it so that it is one line less. This helps a lot, because the box computed by LaTeX to surround the paragraph become smaller, then LateX may find a way to pull it from one page to another, from one column to another etc.
It is always possible to shorten the first version of a text (after 3 or 4 rounds of reformulation it starts becoming a bit cryptic 😉
Continue reading
Permanent link to this article: https://team.inria.fr/oak/2012/04/13/ioanas-latex-squeezing-tips/
The White House is launching a “Big Data is Big Deal” (more formally, “Big Data Research and Development Initiative”), for a total of $200M. Details can be found here and here.
For instance, within, there is the information that DARPA:
“intends to invest approximately $25 million annually for four years to develop computational techniques and software tools for analyzing large volumes of data, both semi-structured (e.g., tabular, relational, categorical, meta-data) and unstructured (e.g., text documents, message traffic).“
Permanent link to this article: https://team.inria.fr/oak/2012/04/13/usa-big-data-initiative/
Following insistent suggestions within the team, we start an Oak blog, which we will use to share & comment on interesting stories!
Permanent link to this article: https://team.inria.fr/oak/2012/04/13/welcome-to-the-oak-blog/
