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

DOI10.1515/JMC.2010.006MaRDI QIDQ3056340zbMATH OpenFDO

Authors Natalia Mosina, Alexander Ushakov

Publication date 12 November 2010

Published in Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1006.4850

zbMATH Keywords

authentication protocolbraid groupgroup-based cryptographymean-setmean-set attack principleprobability on graphs and groupsshift search problemzero knowledge

Mathematics Subject Classification ID

Braid groups; Artin groups (20F36) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

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.

Recommendations

• An attack on the Needham-Schroeder public-key authentication protocol
• Non-standard Attacks against Cryptographic Protocols, with an Example over a Simplified Mutual Authentication Protocol
• Cryptanalysis of the shifted conjugacy authentication protocol
• scientific article; zbMATH DE number 2006822
• Cryptanalysis of Tseng et al.'s authenticated encryption schemes
• scientific article; zbMATH DE number 1406774
• Two attacks on Neuman-Stubblebine authentication protocols
• Cryptanalysis of an improvement of robust deniable authentication protocol
• Cryptanalysis of Farash et al.'s SIP authentication protocol

Cites work

• A fast method for comparing braids
• A Practical Attack on a Braid Group Based Cryptographic Protocol
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Conjugacy in Garside groups. III: Periodic braids.
• Entity authentication schemes using braid word reduction
• Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol
• MULTIPLICATIVE MEASURES ON FREE GROUPS
• Probability Inequalities for Sums of Bounded Random Variables
• Stallings foldings and subgroups of free groups
• The set of minimal braids is co-NP-complete

Cited in

(4)

• Probability on groups and an application to cryptography
• Strong law of large numbers on graphs and groups
• Authenticated commutator key agreement protocol
• Two attacks on Neuman-Stubblebine authentication protocols

This page was built for publication: Mean-set attack: cryptanalysis of Sibert et al. authentication protocol

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3056340)