Mean-set attack: Cryptanalysis of Sibert et al. authentication protocol

Natalia Mosina, Alexander Ushakov

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

We analyze the Sibert et al. group-based (Feige-Fiat-Shamir type) authentication protocol and show that the protocol is not computationally zero-knowledge. In addition, we provide experimental evidence that our approach is practical and can succeed even for groups with no efficiently computable length function such as braid groups. The novelty of this work is that we are not attacking the protocol by trying to solve an underlying complex algebraic problem, namely, the conjugacy search problem, but use a probabilistic approach, instead.

Original languageEnglish
Pages (from-to)149-174
Number of pages26
JournalJournal of Mathematical Cryptology
Volume4
Issue number2
DOIs
StatePublished - Oct 2010

Keywords

  • Authentication protocol
  • Braid group
  • Group-based cryptography
  • Mean-set
  • Mean-set attack principle
  • Probability on graphs and groups
  • Shift search problem
  • Zero knowledge

Fingerprint

Dive into the research topics of 'Mean-set attack: Cryptanalysis of Sibert et al. authentication protocol'. Together they form a unique fingerprint.

Cite this