Enviaments recents

  • On the optimization of bipartite secret sharing schemes 

    Farràs Ventura, Oriol; Metcalf-Burton, Jessica Ruth; Padró Laimon, Carles; Vázquez González, Leonor (2012-05-01)
    Article
    Accés obert
    Optimizing the ratio between the maximum length of the shares and the length of the secret value in secret sharing schemes for general access structures is an extremely difficult and long-standing open problem. In this ...
  • Ideal hierarchical secret sharing schemes 

    Farràs Ventura, Oriol; Padró Laimon, Carles (2012-01-24)
    Article
    Accés obert
    Hierarchical secret sharing is among the most natural generalizations of threshold secret sharing, and it has attracted a lot of attention since the invention of secret sharing until nowadays. Several constructions of ideal ...
  • Finding lower bounds on the complexity of secret sharing schemes by linear programming 

    Padró Laimon, Carles; Vázquez González, Leonor; Yang, An (2013-05-01)
    Article
    Accés obert
    Optimizing the maximum, or average, length of the shares in relation to the length of the secret for every given access structure is a difficult and long-standing open problem in cryptology. Most of the known lower bounds ...
  • Signcryption schemes with threshold unsigncryption, and applications 

    Herranz Sotoca, Javier; Ruiz, Alexandre; Sáez Moreno, Germán (2014-03)
    Article
    Accés obert
    The goal of a signcryption scheme is to achieve the same functionalities as encryption and signature together, but in a more efficient way than encrypting and signing separately. To increase security and reliability in ...
  • 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 ...
  • Efficient cryptosystems from 2k-th power residue symbols 

    Herranz Sotoca, Javier; Libert, Benoit; Joye, Marc; Benhamouda, Fabrice (2017-04)
    Article
    Accés restringit per política de l'editorial
    Goldwasser and Micali (J Comput Syst Sci 28(2):270–299, 1984) highlighted the importance of randomizing the plaintext for public-key encryption and introduced the notion of semantic security. They also realized a cryptosystem ...
  • The Kernel Matrix Diffie-Hellman Assumption 

    Morillo Bosch, M. Paz; Rafols Salvador, Carla; Villar Santos, Jorge Luis (2016-12)
    Article
    Accés obert
    We put forward a new family of computational assumptions, the Kernel Matrix Diffie-Hellman Assumption. Given some matrix A sampled from some distribution D, the kernel assumption says that it is hard to find “in the exponent” ...
  • Natural generalizations of threshold secret sharing 

    Farràs Ventura, Oriol; Padró Laimon, Carles; Xing, Chaoping; Yang, An (2014-01-14)
    Article
    Accés obert
    We present new families of access structures that, similarly to the multilevel and compartmented access structures introduced in previous works, are natural generalizations of threshold secret sharing. Namely, they admit ...
  • Soft and hard modelling methods for decovolution of mixtures of Raman spectra for pigment analysis: a qualitative and quantitative approach 

    Coma, L; Breitman Mansilla, Mónica Celia; Ruiz Moreno, Sergio (2000-01)
    Article
    Accés restringit per política de l'editorial
    Raman spectroscopy provides a means for the detection and identification of pictorial materials on artworks. As a non-destructive, applicable in situ and non-ambiguous technique, it is one of the most preferred to analyse ...
  • La espectroscopía raman aplicada a la identificación de materiales pictóricos 

    Ruiz Moreno, Sergio; Yúfera Gomez, José Manuel; Soneira Ferrando, M. José; Breitman Mansilla, Mónica Celia; Morillo Bosch, M. Paz; Gràcia Rivas, Ignacio (1996-01)
    Article
    Accés obert

Mostra'n més