Abstract
We propose a convertible undeniable signature scheme without random oracles. Our construction is based on Waters' and Kurosawa and Heng's schemes that were proposed in Eurocrypt 2005. The security of our scheme is based on the CDH and the decision linear assumption. Comparing only the part of undeniable signatures, our scheme uses more standard assumptions than the existing undeniable signatures without random oracles due to Laguillamie and Vergnaud. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Yuen, T. H., Au, M. H., Liu, J. K., & Susilo, W. (2007). (Convertible) undeniable signatures without random oracles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4861 LNCS, pp. 83–97). Springer Verlag. https://doi.org/10.1007/978-3-540-77048-0_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
