Artículo
Cryptography with right-angled Artin groups
Autor/es | Flores Díaz, Ramón Jesús
Kahrobaei, Delaram |
Departamento | Universidad de Sevilla. Departamento de Geometría y Topología |
Fecha de publicación | 2016 |
Fecha de depósito | 2017-07-19 |
Publicado en |
|
Resumen | In this paper we propose right-angled Artin groups as a platform for secret sharingschemes based on the efficiency (linear time) of the word problem. Inspired by previous work of Grigoriev-Shpilrain in the context of ... In this paper we propose right-angled Artin groups as a platform for secret sharingschemes based on the efficiency (linear time) of the word problem. Inspired by previous work of Grigoriev-Shpilrain in the context of graphs, we de ne two new problems: SubgroupIsomorphism Problem and Group Homomorphism Problem. Based on them, we also proposetwo new authentication schemes. For right-angled Artin groups, the Group Homomorphismand Graph Homomorphism problems are equivalent, and the later is known to be NP-complete.In the case of the Subgroup Isomorphism problem, we bring some results due to Bridson whoshows there are right-angled Artin groups in which this problem is unsolvable. |
Identificador del proyecto | 00014-15-1-2164
info:eu-repo/grantAgreement/EC/FP7/336983 CF-1564968 MTM2010-20692 |
Cita | Flores Díaz, R.J. y Kahrobaei, D. (2016). Cryptography with right-angled Artin groups. Theoretical and Applied Informatics, 28 (3), 8-16. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Cryptography with right-angled ... | 230.0Kb | [PDF] | Ver/ | |