Opened Access Cryptography with right-angled Artin groups

Citas

buscar en

Estadísticas
Icon
Exportar a
Autor: Flores Díaz, Ramón Jesús
Kahrobaei, Delaram
Departamento: Universidad de Sevilla. Departamento de Geometría y Topología
Fecha: 2016
Publicado en: Theoretical and Applied Informatics, 28 (3), 8-16.
Tipo de documento: Artículo
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 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.
openaireFP7/336983
Tamaño: 230.0Kb
Formato: PDF

URI: http://hdl.handle.net/11441/62682

DOI: 10.20904/283008

Ver versión del editor

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones