TY - JOUR
N2 - In this paper we propose right-angled Artin groups as a platform for secret sharing schemes based on the efficiency (linear time) of the word problem. Inspired by previous work of Grigoriev-Shpilrain in the context of graphs, we define two new problems: Subgroup Isomorphism Problem and Group Homomorphism Problem. Based on them, we also propose two new authentication schemes. For right-angled Artin groups, the Group Homomorphism and 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 who shows there are right-angled Artin groups in which this problem is unsolvable.
L1 - http://journals.pan.pl/Content/118535/PDF/flores_Cryptography+with+right-angled.pdf
L2 - http://journals.pan.pl/Content/118535
EP - 8-16
KW - authentication schemes
KW - group homomorphism
KW - graph homomorphism
A1 - Flores, RamÃ³n
A1 - Kahrobaei, Delaram
T1 - Cryptography with right-angled Artin groups
SP - 8-16
DA - 2016
UR - http://journals.pan.pl/dlibra/docmetadata?id=118535
ER -