@ARTICLE{Flores_Ramón_Cryptography_2016,
 author={Flores, Ramón and Kahrobaei, Delaram},
 volume={vol. 28},
 number={No 3},
 journal={Theoretical and Applied Informatics},
 pages={8-16},
 howpublished={online},
 year={2016},
 publisher={Committee of Informatics of Polish Academy of Science},
 publisher={Institute of Theoretical and Applied Informatics of Polish Academy of Science},
 abstract={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.},
 type={Article},
 title={Cryptography with right-angled Artin groups},
 URL={http://journals.pan.pl/Content/118535/PDF/flores_Cryptography%20with%20right-angled.pdf},
 keywords={authentication schemes, group homomorphism, graph homomorphism},
}