Loading...
Loading...

Go to the content (press return)

Equivalences and black-box separations of Matrix Diffie-Hellman problems

Author
Villar, J.
Type of activity
Presentation of work at congresses
Name of edition
20th International Conference on Practice and Theory of Public-Key Cryptography
Date of publication
2017
Presentation's date
2017-03-30
Book of congress proceedings
Public key cryptography (PKC 2017): 20th IACR International Conference on Practice and Theory in Public-Key Cryptography: Amsterdam, The Netherlands: march 28-31, 2017: proceedings
First page
435
Last page
464
Publisher
Springer
DOI
https://doi.org/10.1007/978-3-662-54365-8_18 Open in new window
Repository
http://eprint.iacr.org/2017/001 Open in new window
http://hdl.handle.net/2117/113265 Open in new window
URL
http://link.springer.com/chapter/10.1007/978-3-662-54365-8_18 Open in new window
Abstract
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. Namely, we provide an algebraic criterion to decide whether there exists a generic black-box reduction, and in many cases, when the answer is positive we also build an explicit reduction with the following properties: it only makes a single oracle call, it is tight and it makes us...
Citation
Villar, J. Equivalences and Black-Box Separations of Matrix Diffie-Hellman Problems. A: International Conference on Practice and Theory in Public Key Cryptography. "Public-Key Cryptography - PKC 2017". Amsterdam: Springer, 2017, p. 435-464.
Keywords
Black-box reductions, Black-box separations, Decisional linear assumption, Matrix Diffie-Hellman problems
Group of research
MAK - Mathematics Applied to Cryptography

Participants

Attachments