This paper proposes an efficient ID-based verifiably encrypted signature scheme based on Hess's ID-based signature scheme [3]. We provide some theoretical discussions for the security model of ID-based verifiably encrypted signature schemes, and show that our new scheme can be proven to be secure in the random oracle model. Our new scheme can be used as primitives to build efficient ID-based optimistic fair exchange protocols, which can be widely used in signing digital contracts, e-payment and other electronic commerce. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Gu, C., & Zhu, Y. (2005). An ID-based verifiable encrypted signature scheme based on Hess’s scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3822 LNCS, pp. 42–52). Springer Verlag. https://doi.org/10.1007/11599548_4
Mendeley helps you to discover research relevant for your work.