Undeniable Signature Schemes Using Braid Groups
Tony Thomas, Arbind Kumar Lal · arXiv (Cornell University) · 2006
Artin's braid groups have been recently suggested as a new source for public-key cryptography. In this paper we propose the first undeniable signature schemes using the conjugacy problem and the decomposition problem in the braid groups which are believed to be hard problems.