Undeniable Signature Schemes Using Braid Groups

dc.creatorThomas, Tony
dc.creatorLal, Arbind Kumar
dc.date2006-01-13
dc.date.accessioned2026-07-07T06:57:55Z
dc.date.available2026-07-07T06:57:55Z
dc.descriptionArtin'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.
dc.identifierhttps://arxiv.org/abs/cs/0601049
dc.identifierhttp://arxiv.org/abs/cs/0601049
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/107155
dc.subjectCryptography and Security
dc.titleUndeniable Signature Schemes Using Braid Groups
dc.typetext

Files

Collections