Show simple item record

dc.contributor.author Morillo, Paz
dc.contributor.author Ràfols, Carla
dc.contributor.author Villar, Jorge L.
dc.date.accessioned 2019-08-01T13:06:50Z
dc.date.available 2019-08-01T13:06:50Z
dc.date.issued 2016
dc.identifier.citation Morillo P, Ràfols C, Villar JL. The Kernel Matrix Diffie-Hellman assumption. In: Cheon J., Takagi T, editors. Advances in Cryptology – ASIACRYPT 2016. 22nd International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part I; 2016 Dec 4-6; Hanoi, Vietnam. Berlin: Springer; 2016. p. 729-58. (LNCS; no. 10.031). DOI: 10.1007/978-3-662-53887-6_27
dc.identifier.issn 0302-9743
dc.identifier.uri http://hdl.handle.net/10230/42225
dc.description Comunicació presentada a: ASIACRYPT 2016, celebrat a Hanoi, Vietnam, del 4 al 6 de desembre de 2016.
dc.description.abstract We put forward a new family of computational assumptions, the Kernel Matrix Diffi-Hellman Assumption. Given some matrix A sampled from some distribution D, the kernel assumption says that it is hard to find \in the exponent" a nonzero vector in the kernel of A>. This family is a natural computational analogue of the Matrix Decisional Diffie-Hellman Assumption (MDDH), proposed by Escala et al. As such it allows to extend the advantages of their algebraic framework to com- putational assumptions. The k-Decisional Linear Assumption is an example of a family of de- cisional assumptions of strictly increasing hardness when k grows. We show that for any such family of MDDH assumptions, the corresponding Kernel assumptions are also strictly increasingly weaker. This requires ruling out the existence of some black-box reductions between exible problems (i.e., computational problems with a non unique solution).
dc.format.mimetype application/pdf
dc.language.iso eng
dc.publisher Springer
dc.relation.ispartof Cheon J., Takagi T, editors. Advances in Cryptology – ASIACRYPT 2016. 22nd International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part I; 2016 Dec 4-6; Hanoi, Vietnam. Berlin: Springer; 2016. p. 729-58. (LNCS; no. 10.031).
dc.rights © International Association for Cryptologic Research 2016 The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-53887-6_27
dc.title The Kernel Matrix Diffie-Hellman assumption
dc.type info:eu-repo/semantics/conferenceObject
dc.identifier.doi http://dx.doi.org/10.1007/978-3-662-53887-6_27
dc.subject.keyword Matrix assumptions
dc.subject.keyword Computational problems
dc.subject.keyword Black-box reductions
dc.subject.keyword Structure preserving cryptography
dc.rights.accessRights info:eu-repo/semantics/openAccess
dc.type.version info:eu-repo/semantics/acceptedVersion


This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics

Compliant to Partaking