In cryptography, zero-knowledge proof has become frequently used in several types of
transactions, for example, the authorization to access a server, the communication between …

In cryptography, a zero-knowledge proof is the process allowing Alice, the customer or the
client to prove herself to Bob, a bank or a server. Without obtaining any secret information …

This paper studies the problem of Zero-Knowledge Protocol (ZKP) and elliptic curve
cryptographic implementation in a computationally limited environment, such as, the smart …

In this thesis we follow two directions: Zero Knowledge Protocols and the Discrete Logarithm
Problem. In each direction we present the necessary background and we give a new …

A protocol for zero-knowledge proofs of identity based on ElGamal on conic is proposed in
this paper. The solution to a hard puzzle is divided into two parts, and the P (prover) …

In order to construct the border solutions for nonsupersingular elliptic curve equations, some
common used models need to be adapted from linear treated cases for use in particular …

In this paper, a zero-knowledge identification protocol is proposed by extending from the
rational of natural integers ℤ, to the ring of Gaussian integers ℤ [i]. Its security relies on the …

Zero knowledge turned out to be a useful tool for many cryptographic applications. Many
cryptographic protocols based on bilinear pairings, namely the Weil and Tate pairings, have …

LNCS 2964 - Cryptanalysis of a Zero-Knowledge Identification Protocol of Eurocrypt ‘95
Page 1 Cryptanalysis of a Zero-Knowledge Identification Protocol of Eurocrypt ’95 Jean-Sébastien …

Elliptic Curves when compared to other encryptions scheme such as RSA etc., provides an
equivalent security, smaller key sizes, less power consumption, faster calculations, less …