Abstract
In this paper, we propose a new approach for constructing selectively convertible undeniable signature schemes, and present two efficient schemes based on RSA. Our approach allows a more direct selective conversion than the previous schemes, and the security can be proved formally. Further, our disavowal protocols do not require parallelization techniques to reach a significant soundness probability. Also, our second scheme is the first selectively convertible scheme which is provably secure without random oracles. © 2006 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Kurosawa, K., & Takagi, T. (2006). New approach for selectively convertible undeniable signature schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4284 LNCS, pp. 428–443). https://doi.org/10.1007/11935230_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.