Josep Domingo‐Ferrer

Universidad Rovira i Virgili

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

David Sánchez

Universidad Rovira i Virgili

Alberto Blanco-Justicia

Universidad Rovira i Virgili

Francesc Sebé

Universitat de Lleida

Qianhong Wu

Beihang University

Jordi Soria-Comas

Agencia Catalana de L'Aigua

Vicenç Torra

Umeå University

Bo Qin

Renmin University of China

Sergio Mart́ınez

Universidad Rovira i Virgili

Antoni Martínez-Ballesté

Universidad Rovira i Virgili

Agustí Solanas

Universidad Rovira i Virgili

Cooperative Institutions

Universidad Rovira i Virgili

University of Pisa

Universitat Politècnica de Catalunya

Centre National de la Recherche Scientifique

Cornell University

National Research Council

Chinese Academy of Sciences

Universitat Autònoma de Barcelona

East China Normal University

Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo"

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Anonymization in the Time of Big Data

Lecture notes in computer science (2016)

Josep Domingo‐Ferrer Jordi Soria-Comas

k-Anonymity

Data anonymization

Information loss

Publication

Concreteness

Data publishing

10.1007/978-3-319-45381-1_5

Cite

Citations (17)

Selected Privacy Research Topics in the ARES Project: An Overview

Studies in computational intelligence (2014)

Jesús Manjón Josep Domingo‐Ferrer

Differential Privacy

10.1007/978-3-319-09885-2_2

Cite

Citations (3)

Privacy-Preserving Trust Management Mechanisms from Private Matching Schemes

arXiv (Cornell University) (2013)

Oriol Farràs Josep Domingo‐Ferrer Alberto Blanco-Justicia

Cryptographic primitives are essential for constructing privacy-preserving communication mechanisms. There are situations in which two parties that do not know each other need to exchange sensitive information on the Internet. Trust management mechanisms make use of digital credentials and certificates in order to establish trust among these strangers. We address the problem of choosing which credentials are exchanged. During this process, each party should learn no information about the preferences of the other party other than strictly required for trust establishment. We present a method to reach an agreement on the credentials to be exchanged that preserves the privacy of the parties. Our method is based on secure two-party computation protocols for set intersection. Namely, it is constructed from private matching schemes.

Oblivious transfer

Private information retrieval

Trust anchor

Web of trust

Trusted third party

10.48550/arxiv.1308.2435

Cite

Citations (0)

Privacy-preserving distributed statistical computation to a semi-honest multi-cloud

Aida Calviño Sara Ricci Josep Domingo‐Ferrer

We present the problem of privacy-preserving distributed statistical computing (PPDSC) in which one party vertically splits a data set among a set of honest-butcurious clouds and wishes to use the clouds' processing power to perform statistical computation on the overall data set. The cornerstone is to compute covariances and, more specifically, scalar products. Existing protocols for computing scalar products on split data are identified and compared, and new variants specifically designed for PPDSC are presented that improve privacy and performance.

Cornerstone

Data set

10.1109/cns.2015.7346863

Cite

Citations (9)

Identidad digital y privacidad en algunas TIC de nueva generación

Novática: Revista de la Asociación de Técnicos de Informática (2009)

Agustí Solanas Josep Domingo‐Ferrer Jordi Castellà Roca

Source

Cite

Citations (0)

Privacy in Statistical Databases: k-Anonymity Through Microaggregation

Josep Domingo‐Ferrer Agustí Solanas Antoni Martínez-Ballesté

The amount of computer-stored information is growing faster with each passing day. This growth and the way in which the stored data are accessed through a variety of channels have raised the alarm about the protection of the individual privacy of the respondents whose data are being collected and stored. On the one hand, data should be available to researchers and statistical agencies so that the necessary research and planning activities can be conducted. However, on the other hand, the right of respondents to privacy must be protected. Statistical disclosure control (SDC) is the discipline which cares about keeping a balance between data access and privacy protection. k-Anonymity is one particular approach to SDC for individual data (microdata): the record corresponding to a specific respondent is k-anonymous if an intruder can at best link the record to a group of k respondents containing the correct one. This paper surveys the use of a special clustering technique called microaggregation to provide k-anonymity.

Microdata (statistics)

k-Anonymity

Privacy Protection

10.1109/grc.2006.1635915

Cite

Citations (24)

h(k)‐private information retrieval from privacy‐uncooperative queryable databases

Online Information Review (2009)

Josep Domingo‐Ferrer Agustí Solanas Jordi Castellà‐Roca

Purpose This paper aims to address the privacy problem associated with the use of internet search engines. The purpose of the paper is to propose and validate a set of methods and protocols to guarantee the privacy of users' queries. Design/methodology/approach In this paper h ( k )‐private information retrieval ( h ( k )‐PIR) is defined as a practical compromise between computational efficiency and privacy. Also presented are h ( k )‐PIR protocols that can be used to query any database, which does not even need to know that the user is trying to preserve his or her privacy. Findings The proposed methods are able to properly protect the privacy of users' queries. When internet users apply the protocols, search engines (e.g. Google) are not able to determine unequivocally the real interests of their users. The quality of the results does decrease with the increase in privacy, but the obtained trade‐off is excellent. Practical implications Current private information retrieval (PIR) protocols suffer from two significant shortcomings: their computational complexity is O ( n ) where n is the number of records in the database, which precludes their use for very large databases and web search engines; and they assume that the database server cooperates in the PIR protocol, which prevents deployment in real‐life uncooperative settings. The proposed protocols overcome both problems. Originality/value This is the first set of protocols that offer practical protection for the privacy of the queries that internet users submit to an internet search engine. The proposal has been implemented and it will be released to the general public soon. It will help to protect the right to privacy of millions of internet users.

Private information retrieval

10.1108/14684520910985693

Cite

Citations (109)

Validating Distance-Based Record Linkage with Probabilistic Record Linkage

Lecture notes in computer science (2002)

Josep Domingo‐Ferrer Vicenç Torra

Categorical variable

Record Linkage

Linkage (software)

10.1007/3-540-36079-4_18

Cite