Paper 2002/187
Entity Authentication Schemes Using Braid Word Reduction
Hervé SIBERT, Patrick DEHORNOY, and Marc GIRAULT
Abstract
Artin's braid groups currently provide a promising background for cryptographical applications, since the first cryptosystems using braids were introduced in \cite{SCY,AAF, AAG, KLC}. A variety of key agreement protocols based on braids have been described, but few authentication or signature schemes have been proposed so far. We introduce three authentication schemes based on braids, two of them being zero-knowledge interactive proofs of knowledge. Then we discuss their possible implementations, involving normal forms or an alternative braid algorithm, called handle reduction, which can achieve good efficiency under specific requirements.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- braid groupauthenticationzero knowledgehandle reduction
- Contact author(s)
- herve sibert @ math unicaen fr
- History
- 2002-12-13: last of 2 revisions
- 2002-12-05: received
- See all versions
- Short URL
- https://ia.cr/2002/187
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2002/187,
author = {Hervé SIBERT and Patrick DEHORNOY and Marc GIRAULT},
title = {Entity Authentication Schemes Using Braid Word Reduction},
howpublished = {Cryptology {ePrint} Archive, Paper 2002/187},
year = {2002},
url = {https://eprint.iacr.org/2002/187}
}
