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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Wang, L., Cao, Z., Zheng, S., Huang, X., & Yang, Y. (2007). Transitive signatures from braid groups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4859 LNCS, pp. 183–196). Springer Verlag. https://doi.org/10.1007/978-3-540-77026-8_14
Mendeley helps you to discover research relevant for your work.