In a blind signature scheme, the user can get a signature sig(m) on message m generated from the signer's blind signature sig(m ) on blinded message m , but the signer can...
Agreement algorithms can be categorized in different ways. One categorization of such algorithms is based on whether the final decisions are exact or inexact. In inexact algorithm...
Azad H. Azadmanesh, Alireza Farahani, Lotfi Najjar
We present a new short signature scheme based on a variant of the Boneh-Boyen's short signatures schemes. Our short signature scheme is secure without requiring the random or...
The notion of rational exchange introduced by Syverson in 1998 is a particularly interesting alternative when an efficient scheme for fair exchange is required but the existence o...
In this paper the security of "golden" cryptography, which has been proposed recently, is tackled. Specifically, it is shown that the security of such cryptosystem is tr...
Multi-Designated Verifier Signatures (MDVS) are privacy-oriented signatures that can only be verified by a set of users specified by the signer. We propose two new generic constru...
A new concept of society-oriented designated confirmer signatures (SDCS) is introduced in this paper. SDCS is well suited to applications where the capability of the signer and th...
Recently, M. Abdalla et al. proposed a slightly different variant of AuthA, based on the scheme proposed by E. Bresson et al., and provided the first complete proof of forward-sec...
In the last few years, multicasting is increasingly used as an efficient communication mechanism for group-oriented applications in the Internet. Some multicast applications requi...
Said Gharout, Yacine Challal, Abdelmadjid Bouabdal...