A robust verifiably encrypted signature scheme

16Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A verifiably encrypted signature can convince the verifier that a given cipher-text is the encryption of a signature on a given message. It is often used as a building block to construct optimistic fair exchange. Recently, Gu et.al gave an ID-based verifiably encrypted signature scheme and claimed that their scheme was secure in random oracle model. Unfortunately, in this works, we show that their scheme is insecure. And we can mount to universal forgery attack in their model. In other words, any one is able to forge a verifiably encrypted signature on arbitrary message m. Subsequently, a novel verifiably encrypted signature scheme (VES) is proposed and the scheme is proven secure in random oracle model. Moreover, the size of verifiably encrypted signature in our scheme is shorter than that of Gu et.al's signature. © IFIP International Federation for Information Processing 2006.

Cite

CITATION STYLE

APA

Zhang, J., & Zou, W. (2006). A robust verifiably encrypted signature scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4097 LNCS, pp. 731–740). Springer Verlag. https://doi.org/10.1007/11807964_74

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free