Zero-Knowledge Identification Scheme Using LDPC Codes

Efficient Zero-Knowledge Identification Scheme for Smart Cards

A New Zero Knowledge Identification Scheme based on Weil Pairing

Many identification schemes have been proposed in which security are based on the intractability of factoring or DLP (Discrete Logarithm Problem). In 2009, Massoud et.al gave identification scheme whose security was based on solving ECDLP (Elliptic Curve Discrete Logarithm Problem). The security of this scheme is improved in order to propose a more secure and efficient scheme. The security of p...

A Zero-Knowledge Identification Scheme in Gap Diffie-Hellman Groups

The Weil [10] and Tate pairings are bilinear maps defined on elliptic curves. They became popular for the design of new schemes since Joux’s tripartite key exchange [8]. When used with specific classes (supersingular and MNT [11]) of curves, they can be computed very efficiently. The existence of pairings gives rise to a new class of problems on these curves, such as the Bilinear Diffie-Hellman...

A Novel Quantum Signature Scheme with Quantum LDPC Codes

This paper presents a novel quantum signature scheme by using quantum quasi-cyclic low density parity check (QC-LDPC) codes and quantum hash function. We construct quantum public keys by using quantum QC-LDPC Codes. Decoding general linear codes is NP-complete problem. The security of our scheme relies on the fact that NP-complete problem can not be solved on quantum Turing machines. Based on t...

Using of Ldpc Codes in Steganography

Steganography is the art of secret communication [1] Since the advent of modern steganography, in the 2000s, many approaches based on error correcting codes (Hamming, BCH, RS ...) have been proposed to reduce the number of changes in the roof while inserting the maximum bit. Jessica Fridrich's works have shown that sparse codes best approach the theoretical limit of efficiency of insertion. Our...