Undeniable Signature Schemes Using Braid Groups
Cryptography and Security
2007-05-23 v1
Abstract
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.
Keywords
Cite
@article{arxiv.cs/0601049,
title = {Undeniable Signature Schemes Using Braid Groups},
author = {Tony Thomas and Arbind Kumar Lal},
journal= {arXiv preprint arXiv:cs/0601049},
year = {2007}
}