Linear spaces and transversal designs: k-anonymous combinatorial configurations for anonymous database search notes

  title={Linear spaces and transversal designs: k-anonymous combinatorial configurations for anonymous database search notes},
  author={Klara Stokes and Oriol Farr{\`a}s},
  journal={Designs, Codes and Cryptography},
  • K. Stokes, O. Farràs
  • Published 26 June 2012
  • Computer Science, Mathematics
  • Designs, Codes and Cryptography
Anonymous database search protocols allow users to query a database anonymously. This can be achieved by letting the users form a peer-to-peer community and post queries on behalf of each other. In this article we discuss an application of combinatorial configurations (also known as regular and uniform partial linear spaces) to a protocol for anonymous database search, as defining the key-distribution within the user community that implements the protocol. The degree of anonymity that can be… 

Extended results on privacy against coalitions of users in user-private information retrieval protocols

This work provides an analysis of the probabilistic advantage user coalitions have in guessing the source of a query, and analyzes the use of query hops as a mitigation technique, in which queries are probabilistically written to one or more memory spaces before forwarding to the database.

A Survey on the Use of Combinatorial Configurations for Anonymous Database Search

This chapter surveys currently available results on how to choose combinatorial configurations for P2P UPIR, an anonymous database search protocol in which users collaborate in order to protect their privacy.

Unconditionally Secure Cryptography: Signature Schemes, User-Private Information Retrieval, and the Generalized Russian Cards Problem

This work focuses on three different types of multi-party cryptographic protocols, in the area of unconditionally secure signature schemes, and on cooperative protocols in which users help each other maintain privacy while querying a database, called userprivate information retrieval protocols.

Unique on the Road: Re-identification of Vehicular Location-Based Metadata

The privacy issue in VLBS (Vehicular Location-Based Service) is studied by investigating the re-identification problem of vehicular location-based metadata in a VL BS server and it is found that the trajectories of vehicles are highly unique after studying 131 millions mobility traces of taxis in Shenzhen and 1.1 billions of taxisIn Shanghai.

Re-identification of Vehicular Location-Based Metadata

It is found that the trajectories of vehicles are highly unique after studying 131 millions mobility traces of taxis and indicates that there exists a high risk of re-identification in VLBS even identity has been protected by traditional methods.

Privacy by design in big data: An overview of privacy enhancing technologies in the era of big data analytics

An analysis of the proposed privacy by design strategies in the different phases of the big data value chain, and a review of privacy enhancing technologies of special interest for the current and future big data landscape.

Data privacy

These are the main topics related to data privacy and privacy‐enhancing technologies that have attracted the interest of researchers, practitioners, and companies.

Selected Privacy Research Topics in the ARES Project: An Overview

This chapter gives an overview of some of the data privacy research carried out by the team at Universitat Rovira i Virgili within the ARES project. Topics reviewed include query profile privacy,

User’s Privacy

This chapter discusses user privacy in communications and in information retrieval, where users have an active role to protect their own privacy.

Privacy Models and Disclosure Risk Measures

A fundamental issue in order to define effective methods for ensuring confidentiality is to define privacy models as well as measures for disclosure risk assessment. In this chapter we review the



Extended combinatorial constructions for peer-to-peer user-private information retrieval

This paper argues that any solution providing privacy against the database should attempt to minimize any corresponding loss of privacy against other users, and establishes a strengthened model for P2P UPIR and clarify the privacy goals of such schemes using standard terminology from the field of privacy research.

k-Anonymity: A Model for Protecting Privacy

  • L. Sweeney
  • Computer Science
    Int. J. Uncertain. Fuzziness Knowl. Based Syst.
  • 2002
The solution provided in this paper includes a formal protection model named k-anonymity and a set of accompanying policies for deployment and examines re-identification attacks that can be realized on releases that adhere to k- anonymity unless accompanying policies are respected.

On query self-submission in peer-to-peer user-private information retrieval

It will be explained why the P2P UPIR protocol may have a flaw in the protection of the privacy of the client in front of the server, and why the projective planes are still the optimal configurations for P2p UPIR for the modified protocol.

Peer-to-Peer Private Information Retrieval

A peer-to-peer PIR system is described in this paper which relies on an underlying combinatorial structure to reduce the required key material and increase availability.

Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression

The concept of minimal generalization is introduced, which captures the property of the release process not to distort the data more than needed to achieve k-anonymity, and possible preference policies to choose among diierent minimal generalizations are illustrated.

Crowds: anonymity for Web transactions

The design, implementation, security, performance, and scalability of the Crowds system for protecting users' anonymity on the world-wide-web are described and degrees of anonymity as an important tool for describing and proving anonymity properties are introduced.

A Three-Dimensional Conceptual Framework for Database Privacy

A conceptual framework for technologies in database privacy in terms of three dimensions is given, depending on whose privacy is considered: i) respondent privacy (to avoid reidentification of patients or other individuals to whom the database records refer); ii) owner privacy (To ensure that the owner must not give away his dataset); and iii) user privacy ( to preserve the privacy of queries submitted by a data user.

An Alternative Way to Generalize the Pentagon

We introduce the concept of a pentagonal geometry as a generalization of the pentagon and the Desargues configuration, in the same vein that the generalized polygons share the fundamental properties