Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 7
Encontrada(s) 1 página(s)

UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Digital hyper-transparency: leading e-government against privacy

  • Rodríguez Hoyos, Ana
  • Estrada Jiménez, José
  • Urquiza Aguiar, Luis
  • Parra Arnau, Javier|||0000-0002-1772-1088
  • Forné Muñoz, Jorge|||0000-0002-8401-3292
© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., For a long time, the Internet and web technologies have supported a more fluid interaction between public institutions and citizens through e-government. With this spirit, several public services are being offered online. One of such services, though not a standard one, is transparency. Strongly encouraged by open-data initiatives, transparency is being marketed as a powerful mechanism to fight corruption. Leveraging communication technologies, societies are broadly adopting online transparency practices to give the general public more control over the scrutiny of state institutions. However, a neglected implementation of transparency may cause almost unlimited access to large amounts of information, a side effect we call hyper-transparency. Inevitably, serious privacy risks arise for the individuals in this context. In this work, we analyze the emergence of hyper-transparent practices in Ecuador, a country recently involved in a fierce attempt to offer free access to public information as a fundamental right enabled through e-government. Moreover, we systematically dissect the large amount of microdata released online by Ecuadorian public institutions. Accordingly, we also unveil here a scenario where sensitive information of public employees is openly released under transparency laws. After exposing potential privacy violations, we elaborate on some mechanisms aimed at protecting citizens from such violations, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

On the information ratio of non-perfect secret sharing schemes

  • Farràs Ventura, Oriol
  • Hansen, Torben
  • Kaced, Tarik
  • Padró Laimon, Carles|||0000-0002-8644-5929
The final publication is available at Springer via http://dx.doi.org/10.1007/s00453-016-0217-9, A secret sharing scheme is non-perfect if some subsets of players that cannot recover the secret value have partial information about it. The information ratio of a secret sharing scheme is the ratio between the maximum length of the shares and the length of the secret. This work is dedicated to the search of bounds on the information ratio of non-perfect secret sharing schemes and the construction of efficient linear non-perfect secret sharing schemes. To this end, we extend the known connections between matroids, polymatroids and perfect secret sharing schemes to the non-perfect case. In order to study non-perfect secret sharing schemes in all generality, we describe their structure through their access function, a real function that measures the amount of information on the secret value that is obtained by each subset of players. We prove that there exists a secret sharing scheme for every access function. Uniform access functions, that is, access functions whose values depend only on the number of players, generalize the threshold access structures. The optimal information ratio of the uniform access functions with rational values has been determined by Yoshida, Fujiwara and Fossorier. By using the tools that are described in our work, we provide a much simpler proof of that result and we extend it to access functions with real values., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

On the regulation of personal data distribution in online advertising platforms

  • Estrada Jiménez, José Antonio
  • Parra Arnau, Javier|||0000-0002-1772-1088
  • Rodríguez Hoyos, Ana Fernanda
  • Forné Muñoz, Jorge|||0000-0002-8401-3292
Online tracking is the key enabling technology of modern online advertising. In the recently established model of real-time bidding (RTB), the web pages tracked by ad platforms are shared with advertising agencies (also called DSPs), which, in an auction-based system, may bid for user ad impressions. Since tracking data are no longer confined to ad platforms, RTB poses serious risks to privacy, especially with regard to user profiling, a practice that can be conducted at a very low cost by any DSP or related agency, as we reveal here. In this work, we illustrate these privacy risks by examining a data set with the real ad-auctions of a DSP, and show that for at least 55% of the users tracked by this agency, it paid nothing for their browsing data. To mitigate this abuse, we propose a system that regulates the distribution of bid requests (containing user tracking data) to potentially interested bidders, depending on their previous behavior. In our approach, an ad platform restricts the sharing of tracking data by limiting the number of DSPs participating in each auction, thereby leaving unchanged the current RTB architecture and protocols. However, doing so may have an evident impact on the ad platform’s revenue. The proposed system is designed accordingly, to ensure the revenue is maximized while the abuse by DSPs is prevented to a large degree. Experimental results seem to suggest that our system is able to correct misbehaving DSPs, and consequently enhance user privacy., Peer Reviewed
O2, repositorio institucional de la UOC
Publication Artículo científico (JournalArticle)

Utility-preserving privacy protection of nominal data sets via semantic rank swapping

  • Rodríguez García, Mercedes
  • Batet, Montserrat
  • Sánchez, David
Personal data are of great interest for research but, at the same time, they pose a serious privacy risk. Therefore, appropriate data protection measures should be undertaken by the data controller before making personal data available for secondary use. Also, such data protection should be done in a way that data are still useful for analysis. In the last years, a plethora of data protection mechanisms have been proposed. Among them, rank swapping is considered one of the best with respect to disclosure risk minimization and data utility preservation. Because rank swapping is based on sorting input data to swap values that are close to each other, in principle, it is a method restricted to numerical and ordinal categorical data. However, a significant amount of personal data currently compiled and used in data analysis are nominal, and their utility depends on the semantics they convey. To properly cope with this type of data, in this paper, we present rank swapping methods capable of protecting nominal data from a semantic perspective. Specifically, by exploiting ontologies, our methods are able to protect nominal data while properly preserving their semantics and, thus, their analytical utility. For that, we provide a suitable binary relation to semantically sort nominal data. Our proposal is capable of managing both independent individual attributes and non-independent multivariate data sets, being the latter especially relevant for data analysis. Empirical experiments carried on real clinical records and using a standard medical ontology show that our methods are able to preserve the semantic features of nominal data significantly better than standard permutation mechanisms.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

On the information ratio of non-perfect secret sharing schemes

  • Farràs Ventura, Oriol
  • Hansen, Torben
  • Kaced, Tarik
  • Padró Laimon, Carles
The final publication is available at Springer via http://dx.doi.org/10.1007/s00453-016-0217-9, A secret sharing scheme is non-perfect if some subsets of players that cannot recover the secret value have partial information about it. The information ratio of a secret sharing scheme is the ratio between the maximum length of the shares and the length of the secret. This work is dedicated to the search of bounds on the information ratio of non-perfect secret sharing schemes and the construction of efficient linear non-perfect secret sharing schemes. To this end, we extend the known connections between matroids, polymatroids and perfect secret sharing schemes to the non-perfect case. In order to study non-perfect secret sharing schemes in all generality, we describe their structure through their access function, a real function that measures the amount of information on the secret value that is obtained by each subset of players. We prove that there exists a secret sharing scheme for every access function. Uniform access functions, that is, access functions whose values depend only on the number of players, generalize the threshold access structures. The optimal information ratio of the uniform access functions with rational values has been determined by Yoshida, Fujiwara and Fossorier. By using the tools that are described in our work, we provide a much simpler proof of that result and we extend it to access functions with real values., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Digital hyper-transparency: leading e-government against privacy

  • Rodríguez Hoyos, Ana
  • Estrada Jiménez, José
  • Urquiza Aguiar, Luis
  • Parra Arnau, Javier
  • Forné Muñoz, Jorge
© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., For a long time, the Internet and web technologies have supported a more fluid interaction between public institutions and citizens through e-government. With this spirit, several public services are being offered online. One of such services, though not a standard one, is transparency. Strongly encouraged by open-data initiatives, transparency is being marketed as a powerful mechanism to fight corruption. Leveraging communication technologies, societies are broadly adopting online transparency practices to give the general public more control over the scrutiny of state institutions. However, a neglected implementation of transparency may cause almost unlimited access to large amounts of information, a side effect we call hyper-transparency. Inevitably, serious privacy risks arise for the individuals in this context. In this work, we analyze the emergence of hyper-transparent practices in Ecuador, a country recently involved in a fierce attempt to offer free access to public information as a fundamental right enabled through e-government. Moreover, we systematically dissect the large amount of microdata released online by Ecuadorian public institutions. Accordingly, we also unveil here a scenario where sensitive information of public employees is openly released under transparency laws. After exposing potential privacy violations, we elaborate on some mechanisms aimed at protecting citizens from such violations, Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

On the regulation of personal data distribution in online advertising platforms

  • Estrada Jiménez, José Antonio
  • Parra Arnau, Javier
  • Rodríguez Hoyos, Ana Fernanda
  • Forné Muñoz, Jorge
Online tracking is the key enabling technology of modern online advertising. In the recently established model of real-time bidding (RTB), the web pages tracked by ad platforms are shared with advertising agencies (also called DSPs), which, in an auction-based system, may bid for user ad impressions. Since tracking data are no longer confined to ad platforms, RTB poses serious risks to privacy, especially with regard to user profiling, a practice that can be conducted at a very low cost by any DSP or related agency, as we reveal here. In this work, we illustrate these privacy risks by examining a data set with the real ad-auctions of a DSP, and show that for at least 55% of the users tracked by this agency, it paid nothing for their browsing data. To mitigate this abuse, we propose a system that regulates the distribution of bid requests (containing user tracking data) to potentially interested bidders, depending on their previous behavior. In our approach, an ad platform restricts the sharing of tracking data by limiting the number of DSPs participating in each auction, thereby leaving unchanged the current RTB architecture and protocols. However, doing so may have an evident impact on the ad platform’s revenue. The proposed system is designed accordingly, to ensure the revenue is maximized while the abuse by DSPs is prevented to a large degree. Experimental results seem to suggest that our system is able to correct misbehaving DSPs, and consequently enhance user privacy., Peer Reviewed, Postprint (author's final draft)