Elliptic curve implementation of zero-knowledge blobs (Q1180510)

In \textit{J. J. Boyar}, \textit{S. A. Kurtz} and \textit{M. W. Krentel} [J. Cryptology 2, 63-76 (1990; Zbl 0699.68035)] it is shown how to construct the building blocks for perfect zero-knowledge proofs (called blobs) using the discrete log problem. The purpose of this paper is to argue that a family of Mordell groups of suitably chosen elliptic curves is more likely to give a hard cryptographic suite than the multiplicative group of a prime finite field. The advantages arise because of the much greater choice available, the resulting possibility of limiting oneself to groups of prime order and the absence of any known discrete log algorithm which is not fully exponential.