Now showing items 13-24 of 47

    • Signcryption schemes with threshold unsigncryption, and applications 

      Herranz Sotoca, Javier; Ruiz, Alexandre; Sáez Moreno, Germán (2014-03)
      Article
      Open Access
      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
      Open Access
      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
      Open Access
      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; Ràfols Salvador, Carla; Villar Santos, Jorge Luis (2016-12)
      Article
      Open Access
      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
      Open Access
      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
      Restricted access - publisher's policy
      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
      Open Access
    • 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
      Open Access
      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
      Open Access
      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
      Open Access
      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
      Open Access
      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
      Open Access
      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 ...