Enviaments recents

  • An algebraic framework for Diffie–Hellman assumptions 

    Escala Ribas, Alex; Herold, Gottfried; Kiltz, Eike; Ràfols Salvador, Carla; Villar Santos, Jorge Luis (2015-10-22)
    Article
    Accés restringit per política de l'editorial
    We put forward a new algebraic framework to generalize and analyze Diffie-Hellman like Decisional Assumptions which allows us to argue about security and applications by considering only algebraic properties. Our D`,k-MDDH ...
  • Extending Brickell-Davenport theorem to non-perfect secret sharing schemes 

    Farràs Ventura, Oriol; Padró Laimon, Carles (2015-02)
    Article
    Accés restringit per política de l'editorial
    One important result in secret sharing is the Brickell-Davenport Theorem: every ideal perfect secret sharing scheme de nes a matroid that is uniquely determined by the access structure. Even though a few attempts have been ...
  • On secret sharing with nonlinear product reconstruction 

    Cascudo, Ignacio; Cramer, Ronald; Mirandola, Diego; Padró Laimon, Carles; Xing, Chaoping (2015-06-24)
    Article
    Accés restringit per política de l'editorial
    Multiplicative linear secret sharing is a fundamental notion in the area of secure multi- party computation (MPC) and, since recently, in the area of two-party cryptography as well. In a nutshell, this notion guarantees ...
  • Attribute-based versions of Schnorr and ElGamal 

    Herranz Sotoca, Javier (2016-01)
    Article
    Accés restringit per política de l'editorial
    We design in this paper the first attribute-based cryptosystems that work in the classical discrete logarithm, pairing-free, setting. The attribute-based signature scheme can be seen as an extension of Schnorr signatures, ...
  • Secret sharing, rank inequalities, and information inequalities 

    Martín Mollevi, Sebastià; Padró Laimon, Carles; Yang, An (2016-01)
    Article
    Accés obert
    Beimel and Orlov proved that all information inequalities on four or five variables, together with all information inequalities on more than five variables that are known to date, provide lower bounds on the size of the ...
  • 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 restringit per política de l'editorial
    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 ...
  • Vote validatability in Mix-Net-based eVoting 

    Bibiloni, Pedro; Escala Ribas, Alex; Morillo Bosch, M. Paz (2015)
    Article
    Accés restringit per política de l'editorial
    One way to build secure electronic voting systems is to use Mix-Nets, which break any correlation between voters and their votes. One of the characteristics of Mix-Net-based eVoting is that ballots are usually decrypted ...
  • Secure and efficient anonymization of distributed confidential databases 

    Herranz Sotoca, Javier; Nin Guerrero, Jordi (2014)
    Article
    Accés restringit per política de l'editorial
    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
    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 the representability of the biuniform matroid 

    Ball, Simeon Michael; Padró Laimon, Carles; Weiner, Zsuzsa; Xing, Chaoping (2013-08-22)
    Article
    Accés obert
    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 ...

Mostra'n més