Recent Submissions

  • Secure and efficient anonymization of distributed confidential databases 

    Herranz Sotoca, Javier; Nin Guerrero, Jordi (2014)
    Article
    Restricted access - publisher's policy
    Let us consider the following situation: t entities (e.g., hospitals) hold different databases containing different records for the same type of confidential (e.g., medical) data. They want to deliver a protected version ...
  • New results and applications for multi-secret sharing schemes 

    Herranz Sotoca, Javier; Ruiz Rodríguez, Alexandre; Sáez Moreno, Germán (2014-12-01)
    Article
    Open Access
    In a multi-secret sharing scheme (MSSS), different secrets are distributed among the players in some set , each one according to an access structure. The trivial solution to this problem is to run independent instances of ...
  • On the representability of the biuniform matroid 

    Ball, Simeon Michael; Padró Laimon, Carles; Weiner, Zsuzsa; Xing, Chaoping (2013-08-22)
    Article
    Open Access
    Every biuniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for ...
  • Cropping Euler factors of modular L-functions 

    González Rovira, Josep; Jiménez Urroz, Jorge; Lario Loyo, Joan Carles (2013-09)
    Article
    Open Access
    According to the Birch and Swinnerton-Dyer conjectures, if A/Q is an abelian variety, then its L-function must capture a substantial part of the properties of A. The smallest number field L where A has all its endomorphisms ...
  • More hybrid and secure protection of statistical data sets 

    Herranz Sotoca, Javier; Nin Guerrero, Jordi; Solé Simó, Marc (IEEE Computer Society Publications, 2012-09)
    Article
    Restricted access - publisher's policy
    Different methods and paradigms to protect data sets containing sensitive statistical information have been proposed and studied. The idea is to publish a perturbed version of the data set that does not leak confidential ...
  • Kd-trees and the real disclosure risks of large statistical databases 

    Herranz Sotoca, Javier; Nin Guerrero, Jordi; Solé Simó, Marc (Elsevier, 2011)
    Article
    Restricted access - publisher's policy
    In data privacy, record linkage can be used as an estimator of the disclosure risk of protected data. To model the worst case scenario one normally attempts to link records from the original data to the protected data. ...
  • Orders of CM elliptic curves modulo p with at most two primes 

    Iwaniec, H.; Jiménez Urroz, Jorge (2010)
    Article
    Restricted access - publisher's policy
    Nowadays the generation of cryptosystems requires two main aspects. First the security, and then the size of the keys involved in the construction and comunication process. About the former one needs a di±cult ...
  • Classifying data from protected statistical datasets 

    Herranz Sotoca, Javier; Matwin, Stan; Nin Guerrero, Jordi; Torra i Reventós, Vicenç (2010-06-09)
    Article
    Open Access
    Statistical Disclosure Control (SDC) is an active research area in the recent years. The goal is to transform an original dataset X into a protected one X0, such that X0 does not reveal any relation between confidential ...
  • On the disclosure risk of multivariate microaggregation 

    Nin Guerrero, Jordi; Herranz Sotoca, Javier; Torra i Reventós, Vicenç (Elsevier Science Ltd., 2008-07-22)
    Article
    Restricted access - publisher's policy
    The aim of data protection methods is to protect a microdata file both minimizing the disclosure risk and preserving the data utility. Microaggregation is one of the most popular such methods among statistical agencies. ...
  • How to group attributes in multivariate microaggregation 

    Nin Guerrero, Jordi; Herranz Sotoca, Javier; Torra i Reventós, Vicenç (2008-04-01)
    Article
    Restricted access - publisher's policy
    Microaggregation is one of the most employed microdata protection methods. It builds clusters of at least k original records, and then replaces these records with the centroid of the cluster. When the number of attributes ...

View more