Transitive signatures from braid groups

Authors:
Licheng Wang;Zhenfu Cao;Shihui Zheng;Xiaofang Huang;Yixian Yang
Affiliations:
Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, P.R. China;Dept. Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, P.R. China;Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, P.R. China;Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, P.R. China;Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, P.R. China
Venue:
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Year:
2007

Citing 13
Cited 1

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
A modification of Warshall's algorithm for the transitive closure of binary relations

Communications of the ACM
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
Transitive Signature Schemes

CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Transitive Signatures Based on Factoring and RSA

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
One-more matching conjugate problem and security of braid-based signatures

ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Towards generating secure keys for braid cryptography

Designs, Codes and Cryptography
Shor's discrete logarithm quantum algorithm for elliptic curves

Quantum Information & Computation
A provably secure short transitive signature scheme from bilinear group pairs

SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
A practical attack on a braid group based cryptographic protocol

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Directed transitive signature scheme

CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Transitive signatures: new schemes and proofs

IEEE Transactions on Information Theory

Computing on authenticated data for adjustable predicates

ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security

Quantified Score

Hi-index	0.01

Visualization

Abstract

Transitive signature is an interesting primitive due to Micali and Rivest. During the past years, many constructions of transitive signatures have been proposed based on various assumptions. In this paper, we provide the first construction of transitive signature schemes by using braid groups. In the random oracle model, our proposals are proved to be transitively unforgeable against adaptively chosen message attack under the assumption of the intractability of one-more matching conjugate problem (OM-MCP) over braid groups. Moreover, the proposed schemes are invulnerable to currently known quantum attacks.