Signatures with partially message recovery in which some parts of messages are not transmitted with signatures to make them shorter are useful where bandwidth is one of the crucial concern and especially in case of signing short messages in applications such as time stamping, certified email services and identitybased cryptosystems. In this paper, to have quantum-attackresistant short signature...

We propose a decentralized trust management model called anonymous role-based cascaded delegation. In this model, a delegator can issue authorizations on behalf of his role without revealing his own identity. Anonymous delegation protects sensitive membership information of a delegator and hides the internal structure of an organization. Certificates used in anonymous role-based cascaded delega...

Mobile ad hoc network (MANET) has been generally regarded as an ideal network model for group communications. However, the security deployment for MANET routing operations is problematic. Firstly, existing secured routing protocols are deficient in achieving both authentication efficiency and full scale of security. In addition, the diversity of routing protocols presents difficulties in the ge...

Juels, Catalano, and Jakobsson (JCJ) proposed at WPES 2005 the first voting scheme that considers real-world threats and that is more realistic for Internet elections. Their scheme, though, has a quadratic work factor and thereby is not efficient for large scale elections. Based on the work of JCJ, Smith proposed an efficient scheme that has a linear work factor. In this paper we first show tha...

In this paper, we present a practical attack on the signature scheme SFLASH proposed by Patarin, Goubin and Courtois in 2001 following a design they had introduced in 1998. The attack only needs the public key and requires about one second to forge a signature for any message, after a one-time computation of several minutes. It can be applied to both SFLASH which was accepted by NESSIE, as well...