One-more matching conjugate problem and security of braid-based signatures

Authors:
Licheng Wang;Zhenfu Cao;Peng Zeng;Xiangxue Li
Affiliations:
Shanghai Jiao Tong University, Shanghai, China;Shanghai Jiao Tong University, Shanghai, China;Shanghai Jiao Tong University, Shanghai, China;Shanghai Jiao Tong University, Shanghai, China
Venue:
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Year:
2007

Citing 7
Cited 1

A public key cryptosystem based on the word problem

Proceedings of CRYPTO 84 on Advances in cryptology
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
A Linear Algebraic Attack on the AAFG1 Braid Group Cryptosystem

ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
New Key Agreement Protocols in Braid Group Cryptography

CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Potential Weaknesses of the Commutator Key Agreement Protocol Based on Braid Groups

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Shor's discrete logarithm quantum algorithm for elliptic curves

Quantum Information & Computation
A practical attack on a braid group based cryptographic protocol

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology

Transitive signatures from braid groups

INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Braid groups have recently attracted the attention of many cryptographers as an alternative to number-theoretic public key cryptography. But the published braid-based signatures have failed to reach the most desired security, i.e., existential unforgeability under adaptively chosen message attack (EUF-CMA). In this paper, we at first prompt a new kind of braid-based assumption --- one-more matching conjugate assumption; and then based on it, we prove that some braid-based signatures are EUF-CMA secure in the random oracle model.