Computer Science – Cryptography and Security
Scientific paper
2006-01-13
Computer Science
Cryptography and Security
Scientific paper
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.
Lal Arbind Kumar
Thomas Tony
No associations
LandOfFree
Undeniable Signature Schemes Using Braid Groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Undeniable Signature Schemes Using Braid Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Undeniable Signature Schemes Using Braid Groups will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-452092