L'objectiu del grup de recerca és l'estudi dels problemes matemàtics de més actualitat en el camp de la criptologia. Els temes de recerca se centren principalment en els aspectes següents:
- Criptografia distribu´da. Les parts implicades en el protocol criptogràfic són col·lectius que hauran de compartir certa informació secreta.
En aquest punt cal destacar la computació multipart i els esquemes de distribució de secrets.
- Protocols criptogràfics segurs. En aquest punt es tracta d'analitzar i dissenyar protocols, tant de xifratge com de signatura digital, que siguin eficients i segurs. La definició de seguretat també és tema d'estudi.
Destaquem també l'estudi de les aplicacions de les corbes el·líptiques a la criptografia.

http://futur.upc.edu/MAK

The main goal of the research group is the study of mathematical problems in cryptology.
The main research areas are the following:
- Distributed cryptography. The groups working on cryptographic protocols have to share secret information. Multi-party computation and secret-sharing schemes are also studied.
- Secure cryptographic protocols. The aim is to analyse and design efficient and secure protocols, both for encryption and for digital signatures.
The definition of security is also the subject of research. The applications of elliptic curves in cryptography are also studied.

http://futur.upc.edu/MAK

The main goal of the research group is the study of mathematical problems in cryptology.
The main research areas are the following:
- Distributed cryptography. The groups working on cryptographic protocols have to share secret information. Multi-party computation and secret-sharing schemes are also studied.
- Secure cryptographic protocols. The aim is to analyse and design efficient and secure protocols, both for encryption and for digital signatures.
The definition of security is also the subject of research. The applications of elliptic curves in cryptography are also studied.

http://futur.upc.edu/MAK

Enviaments recents

  • Ideal hierarchical secret sharing schemes 

    Farràs Ventura, Oriol; Padró Laimon, Carles (Springer, 2010)
    Text en actes de congrés
    Accés obert
    Hierarchical secret sharing is among the most natural generalizations of threshold secret sharing, and it has attracted a lot of attention from the invention of secret sharing until nowadays. Several constructions of ideal ...
  • Optimal non-perfect uniform secret sharing schemes 

    Farràs Ventura, Oriol; Hansen, Torben; Kaced, Tarik; Padró Laimon, Carles (Springer, 2014)
    Text en actes de congrés
    Accés obert
    A secret sharing scheme is non-perfect if some subsets of participants that cannot recover the secret value have partial information about it. The information ratio of a secret sharing scheme is the ratio between the maximum ...
  • 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 (Springer, 2016)
    Comunicació de congrés
    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” ...
  • 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” ...

Mostra'n més