Ara es mostren els items 24-43 de 49

    • How (not) to achieve both coercion resistance and cast as intended verifiability in remote eVoting 

      Finogina, Tamara; Herranz Sotoca, Javier; Larraia, Enrique (2021)
      Text en actes de congrés
      Accés obert
      We consider the problem of achieving, at the same time, cast-as-intended verifiability and coercion resistance, in remote electronic voting systems where there are no secure channels through which voters can receive secret ...
    • How to avoid repetitions in lattice-based deniable zero-knowledge proofs 

      Arnal i Clemente, Xavier; Cano Aguilera, Abraham; Finogina, Tamara; Herranz Sotoca, Javier (2022-06-23)
      Report de recerca
      Accés obert
      Interactive zero-knowledge systems are a very important cryptographic primitive, used in many applications, especially when deniability (also known as non-transferability) is desired. In the lattice-based setting, the ...
    • How to group attributes in multivariate microaggregation 

      Nin Guerrero, Jordi; Herranz Sotoca, Javier; Torra i Reventós, Vicenç (2008-04-01)
      Article
      Accés restringit per política de l'editorial
      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 ...
    • Ideal homogeneous access structures constructed from graphs 

      Herranz Sotoca, Javier (2009)
      Article
      Accés obert
      Starting from a new relation between graphs and secret sharing schemes introduced by Xiao, Liu and Zhang, we show a method to construct more general ideal homogeneous access structures. The method has some advantages: it ...
    • Kd-trees and the real disclosure risks of large statistical databases 

      Herranz Sotoca, Javier; Nin Guerrero, Jordi; Solé Simó, Marc (Elsevier, 2011)
      Article
      Accés restringit per política de l'editorial
      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. ...
    • MATEMÀTIQUES I (Examen final, 1r quadrimestre) 

      Herranz Sotoca, Javier (Universitat Politècnica de Catalunya, 2024-01-08)
      Examen
      Accés restringit a la comunitat UPC
    • MATEMÀTIQUES I (Reavaluació, 1r quadrimestre) 

      Herranz Sotoca, Javier (Universitat Politècnica de Catalunya, 2024-02-02)
      Examen
      Accés restringit a la comunitat UPC
    • Máxima seguridad para firmas digitales con verificación distribuida 

      Herranz Sotoca, Javier; Ruiz Rodríguez, Alexandre; Sáez Moreno, Germán (Publicacions de l'ETSE de la URV, 2010)
      Text en actes de congrés
      Accés obert
      Una de las opciones para proteger el nivel de anonimato o privacidad de un firmante es construir firmas digitales con verificación distribuida: se requiere la colaboración de un subconjunto autorizado de usuarios para ...
    • 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
      Accés restringit per política de l'editorial
      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 ...
    • 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
      Accés obert
      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 method-specific record linkage for risk assessment 

      Nin Guerrero, Jordi; Herranz Sotoca, Javier; Torra i Reventós, Vicenç (2007)
      Text en actes de congrés
      Accés obert
      Nowadays, the need for privacy motivates the use of methods that permit us to protect a microdata file both minimizing the disclosure risk and preserving the statistical utility. Nevertheless, research is usually focused ...
    • On remote electronic voting with both coercion resistance and cast-as-intended verifiability 

      Finogina, Tamara; Herranz Sotoca, Javier (2023-08-01)
      Article
      Accés obert
      In this work, we study two essential but apparently contradictory properties of electronic voting systems: coercion resistance (CR) and cast-as-intended verifiability (CAI). Informally, the CR property ensures that a voter ...
    • On server trust in private proxy auctions 

      Di Crescenzo, Giovanni; Herranz Sotoca, Javier; Sáez Moreno, Germán (2010-10-09)
      Article
      Accés restringit per política de l'editorial
      We investigate proxy auctions, an auction model which is proving very successful for on-line businesses (e.g.http://www.ebay.com), where a trusted server manages bids from clients by continuously updating the current price ...
    • On the computational security of a distributed key distribution scheme 

      Daza, Vanesa; Herranz Sotoca, Javier; Sáez Moreno, Germán (IEEE, 2008-08)
      Article
      Accés obert
      In a distributed key distribution scheme, a set of servers helps a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some servers and some users has no information about ...
    • 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
      Accés restringit per política de l'editorial
      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. ...
    • On the efficiency of revocation in RSA-based anonymous systems 

      Fueyo, María; Herranz Sotoca, Javier (2016-08-01)
      Article
      Accés obert
      The problem of revocation in anonymous authentication systems is subtle and has motivated a lot of work. One of the preferable solutions consists in maintaining either a whitelist L-W of non-revoked users or a blacklist ...
    • Optimal symbol alignment distance: a new distance for sequences of symbols 

      Herranz Sotoca, Javier; Nin Guerrero, Jordi; Solé Simó, Marc (IEEE Press. Institute of Electrical and Electronics Engineers, 2010-10-14)
      Article
      Accés obert
      Comparison functions for sequences (of symbols) are important components of many applications, for example clustering, data cleansing and integration. For years, many efforts have been made to improve the performance of ...
    • Partial symbol ordering distance 

      Herranz Sotoca, Javier; Nin Guerrero, Jordi (Springer Verlag, 2009)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      Nowadays sequences of symbols are becoming more important, as they are the standard format for representing information in a large variety of domains such as ontologies, sequential patterns or non numerical attributes in ...
    • Revisiting distance-based record linkage for privacy-preserving release of statistical datasets 

      Herranz Sotoca, Javier; Nin Guerrero, Jordi; Rodríguez, Pablo; Tassa, Tamir (Elsevier, 2015-07-17)
      Article
      Accés obert
      Statistical Disclosure Control (SDC, for short) studies the problem of privacy-preserving data publishing in cases where the data is expected to be used for statistical analysis. An original dataset T containing sensitive ...
    • Secret sharing schemes for (k, n)-consecutive access structures 

      Herranz Sotoca, Javier; Sáez Moreno, Germán (Springer, 2018-09-01)
      Article
      Accés restringit per política de l'editorial
      We consider access structures over a set P of n participants, defined by a parameter k with 1 = k = n in the following way: a subset is authorized if it contains participants i, i + 1,...,i + k - 1, for some i ¿ {1,...,n-k+1}. ...