Search

Multi-proxy signature schemes (MPSS) allow n proxy signers to generate a valid signature on behalf of the original signer. A new efficient self-certified MPSS with message recovery based on the Elliptic Curve Discrete Logarithm Problem (i.e., ECDLP) is proposed in this paper. A rationale for proposing a new scheme is to improve the verification process performance by combining the verification process with message recovery in one single stage (i.e., simultaneously). The security and performance analysis shows, the new scheme has many advantages over the traditional MPS schemes. These benefits include decreasing costs (i.e., certificate sizes, consumption time, and bandwidth requirements) and increasing speed. [ABSTRACT FROM AUTHOR]

There has been a great deal of interest in researching the behavior of chaotic systems over the past decade. They are distinguished by their sensitivity to initial conditions, continuous broad-band power spectrum, and similarity to random behavior. Chaos has possible applications in the encryption, compression, and modulation blocks of a digital communication system. The possibility of self-synchronization of chaotic oscillations has spawned a deluge of research on the cryptographic applications of chaos. FAC (Factoring) and CM (Chaotic maps) are used in this research to develop a new signature system (CM). Our system has a higher security level than any other based on a single hard number-theoretic problem since it is extremely unlikely that FAC and CM can be solved effectively at the same time. We further demonstrate that the scheme's performance involves only minimal operations in signing and validating logarithms, and that it is impervious to attack. [ABSTRACT FROM AUTHOR]