The concept of threshold ring signature in code-based cryptography was introduced by Aguilar et al. in [1]. Their proposal uses Stern’s identification scheme as basis. In this paper we construct a novel threshold ring signature scheme built on the q-SD identification scheme recently proposed by Cayrel et al. in [14]. Our proposed scheme benefits of a performance gain as a result of the reductio...

Frequency dissemination in phase-stabilized optical fiber networks for metrological frequency comparisons and precision measurements are promising candidates to overcome the limitations imposed by satellite techniques. However, an architecture shared with telecommunication data traffic, network constraints restrict availability of dedicated channels commonly-used C-band . Here, we demonstrate S...

This survey provides a comparative overview of code-based signature schemes with respect to security and performance. Furthermore, we explicitly describe serveral code-based signature schemes with additional properties such as identity-based, threshold ring and blind signatures.

Despite the growing growth of technology, handwritten signature has been selected as the first option between biometrics by users. In this paper, a new methodology for offline handwritten signature verification and recognition based on the Shearlet transform and transfer learning is proposed. Since, a large percentage of handwritten signatures are composed of curves and the performance of a sig...

A new certificateless blind ring signature scheme was proposed in this paper. The scheme could not only avoid the problem of certificate management of public key certificate cryptography, but also overcome the inherent key-escrow problem of identity-based public key cryptography. In the last, by using bilinear pairing technique, it was proved that this scheme satisfied the security of existenti...

The well-known forking lemma by Pointcheval and Stern has been used to prove the security of the so-called generic signature schemes. These signature schemes are obtained via the Fiat-Shamir transform from three-pass identification schemes. A number of five-pass identification protocols have been proposed in the last few years. Extending the forking lemma and the Fiat-Shamir transform would all...

In a variety of group-oriented applications cryptographic primitives like group signatures or ring signatures are valuable methods to achieve anonymity of group members. However, in their classical form, these schemes cannot be deployed for applications that simultaneously require (i) to avoid centralized management authority like group manager and (ii) the signer to be anonymous only against n...

A (di)graph G of order n is k-traceable (for some k, 1 ≤ k ≤ n) if every induced sub(di)graph of G of order k is traceable. It follows from Dirac’s degree condition for hamiltonicity that for k ≥ 2 every k-traceable graph of order at least 2k − 1 is hamiltonian. The same is true for strong oriented graphs when k = 2, 3, 4, but not when k ≥ 5. However, we conjecture that for k ≥ 2 every k-tracea...

A public key cryptosystem scheme is proposed that are based on conic curves over the ring Zn. Our scheme is motivated by KMOV scheme on elliptic curves, but our scheme remove some restrictive condition from KMOV scheme and constructed on conic curves. Its security bases on the difficulty of factoring a composite number n, just like RSA. It can resist some of the known attacks on RSA. We also co...

The identity of “Deep Throat”, a pseudonym of the information source in the Watergate scandal, remained mysterious for more than three decades. In 2005, an ex-FBI official claimed that he was the anonymous source. Nevertheless, some are still inconvinced. In this paper, we introduce a new notion of identity-committable signatures (ICS) to ensure the anonymity of “Deep Throat” inside a group. A ...