Equivalences and black-box separations of Matrix Diffie-Hellman problems
Visualitza/Obre
10.1007/978-3-662-54365-8_18
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/113268
Tipus de documentArticle
Data publicació2017-02
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
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 use only of operations in the base group. It is well known that two MDDH problems described by matrices with a different number of rows are separated by an oracle computing cer- tain multilinear map. Thus, we put the focus on MDDH problems of the same size. Then, we show that MDDH problems described with a different number of parameters are also separated (meaning that a suc- cessful reduction cannot decrease the amount of randomness used in the problem instance description). When comparing MDDH problems of the same size and number of pa- rameters, we show that they are either equivalent or incomparable. This suggests that a complete classification into equivalence classes could be done in the future. In this paper we give some positive and negative par- tial results about equivalence, in particular solving the open problem of whether the Linear and the Cascade MDDH problems are reducible to each other. The results given in the paper are limited by some technical restrictions in the shape of the matrices and in the degree of the polynomials defining them. However, these restrictions are also present in most of the work dealing with MDDH Problems. Therefore, our results apply to all known instances of practical interest.
Descripció
The final publication is available at link.springer.com
CitacióVillar, J. Equivalences and black-box separations of Matrix Diffie-Hellman problems. "Lecture notes in computer science", Febrer 2017, vol. 10174, p. 435-464.
ISSN0302-9743
Versió de l'editorhttp://link.springer.com/chapter/10.1007/978-3-662-54365-8_18
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
001.pdf | 492,6Kb | Visualitza/Obre |