In 2004, Libert and Quisquater proposed an identity based undeniable signature scheme using pairings over elliptic curves. In this article, we show that the scheme is not secure. ...
Zichen Li, C. F. Chong, Lucas Chi Kwong Hui, Siu-M...
Three main methods with favorable security and efficiency can be considered in the design of cryptosystems. These methods are integer factorization systems (of which RSA is the be...
This article presents optimization results on the recent MOVA undeniable signature scheme presented by Monnerat and Vaudenay at PKC ’04 as well as its generalization proposed at ...
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Di...
In this paper, we first introduce a new kind of adversarial goal called forge-and-impersonate in undeniable signature schemes. Note that forgeability does not necessarily imply im...