Now showing items 1-12 of 12

• #### A fair and abuse-free contract signing protocol from Boneh-Boyen signature ﻿

(Springer Verlag, 2010)
Conference report
Restricted access - publisher's policy
A fair contract signing protocol is used to enable two mistrusted parties to exchange two signatures on a given contract, in such a way that either both of them get the other party’s signature, or none of them gets anything. ...
• #### An algebraic framework for Diffie-Hellman assumptions ﻿

(2017-01)
Article
Open Access
We put forward a new algebraic framework to generalize and analyze Di e-Hellman like Decisional Assumptions which allows us to argue about security and applications by considering only algebraic properties. Our D;k-MDDH ...
• #### An algebraic framework for Diffie–Hellman assumptions ﻿

(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 ...
• #### Anonymous subscription schemes : a flexible fonstruction for on-line services access ﻿

(IEEE Press. Institute of Electrical and Electronics Engineers, 2010)
Conference report
Restricted access - publisher's policy
In traditional e-cash systems, the tradeoff between anonymity and fraud-detection is solved by hiding the identity of the user into the e-coin, and providing an additional triggering mechanism that opens this identity in ...
• #### Compartición de secretos en criptografía ﻿

(Escola Tècnica Superior d'Enginyers de Telecomunicació de Barcelona, 1997)
Article
Open Access
• #### Equivalences and black-box separations of Matrix Diffie-Hellman problems ﻿

(2017-02)
Article
Open Access
In this paper we provide new algebraic tools to study the relationship between different Matrix Diffie-Hellman (MDDH) Problems, which are recently introduced as a natural generalization of the so-called Linear Problem. ...
• #### Equivalences and Black-Box Separations of Matrix Diffie-Hellman Problems ﻿

(Springer, 2017)
Conference lecture
Open Access
In this paper we provide new algebraic tools to study the relationship between different Matrix Diffie-Hellman (MDDH) Problems, which are recently introduced as a natural generalization of the so-called Linear Problem. ...
• #### Matrix computational assumptions in multilinear groups ﻿

(2015-04-20)
External research report
Open Access
We put forward a new family of computational assumptions, the Kernel Matrix Di e- Hellman Assumption. Given some matrix A sampled from some distribution D `;k , the kernel as- sumption says that it is hard to nd \in the exponent
• #### Métodos numéricos con MATLAB : aplicación a las telecomunicaciones ﻿

(Edicions UPC, 2003)
Book
Restricted access to UB, UAB, UPC, UPF, UdG, UdL, URV, UOC, BC, UVic, UJI, URL, UIC users
El contenido de este libro corresponde a una asignatura semestral de formación general sobre métodos numéricos en Ingeniería de Telecomunicación. La obra se estructura en tres partes. La primera contiene una introducción ...
• #### Public verifiability from pairings in secret sharing schemes ﻿

(2009)
Article
Restricted access - publisher's policy
In this paper we propose a new publicly verifiable secret sharing scheme using pairings with close relations to Shoenmakers’ scheme. This scheme is efficient, multiplicatively homomorphic and with unconditional verifiability ...
• #### The Kernel Matrix Diffie-Hellman assumption ﻿

(Springer, 2016)
Conference lecture
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” ...
• #### The Kernel Matrix Diffie-Hellman Assumption ﻿

(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” ...