Decision and Search in Non-abelian Cramer Shoup Public Key Cryptosystem
This work addresses cryptographic security for applications requiring non-abelian structures, but it appears incremental as it builds on existing frameworks without reporting concrete results.
The paper tackles the problem of extending the Cramer-Shoup cryptosystem to non-abelian groups by exploring decision and search roles and suggesting solvable/polycyclic groups as a platform, while reviewing recent progress and posing open problems in non-abelian cryptography.
A method for non-abelian Cramer-Shoup cryptosystem is presented. The role of decision and search is explored, and the platform of solvable/polycyclic group is suggested. In the process we review recent progress in non-abelian cryptography and post some open problems that naturally arise from this path of research.