TY - GEN
T1 - One-more matching conjugate problem and security of braid-based signatures
AU - Wang, Licheng
AU - Cao, Zhenfu
AU - Zeng, Peng
AU - Li, Xiangxue
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
KW - Braid-based signature
KW - One-more matching conjugate problem
KW - Provable security
UR - https://www.scopus.com/pages/publications/77952320351
U2 - 10.1145/1229285.1266996
DO - 10.1145/1229285.1266996
M3 - Conference contribution
AN - SCOPUS:77952320351
SN - 1595935746
SN - 9781595935748
T3 - eProceedings of the 2nd ACM Symposium on Information, Computer and Communications Security, ASIACCS '07
SP - 295
EP - 301
BT - Proceedings of the 2nd ACM Symposium on Information, Computer and Communications Security, ASIACCS '07
T2 - 2nd ACM Symposium on Information, Computer and Communications Security, ASIACCS '07
Y2 - 20 March 2007 through 22 March 2007
ER -