Is elliptic curve point multiplication semantically secure? Is elliptic curve point multiplication semantically secure? I'd like to know if there are some sets of elliptic curve parameters (e.g. NIST curves) that are proved to be semantically secure or that are not disproved.

By "elliptic curve point multiplication is semantically secure", I mean the following:

Suppose an elliptic curve over a finite field $\mathbb{F}_p$ where $p$ is a prime number. The equation is $y^2 = x^3 + ax + b$. $G$ is a base point and it generates all the points $E = \{G, 2G, ..., (q-1)G, \mathcal{O}\}$ in the curve. Here $q$ is prime and it is the order of the curve. We have the following cryptosystem:


The encryption of a point $P$ ($P \ne \mathcal{O}$) is $sP$ where $s$ is a random secret key and $1 \le s &lt; q$.
The decryption of a point $Q$ is $s^{-1}Q$ where $ss^{-1} \equiv 1 \mod q$


Suppose there is a set of $n$ distinct points $\{P_1, P_2, ..., P_n\}$ and their encryptions $\{Q_1, Q_2, ..., Q_n\}$ with a secret key $s$. The orders are not necessarily the same, i.e. $Q_1$ might or might not be the encryption of $P_1$. If it is infeasible to determine which encryption belongs to which point better than random guessing, then this cryptosystem is semantically secure.
If an attacker can choose the points $P_i$, than this system is not semantically secure. For example, they may choose $P_2=2P_1$, and the corresponding encryption $Q_2$ would be equal to $2Q_1$.

If the points are chosen at random, this system is semantically secure if decisional Diffie-Hellman assumption holds for the curve. This assumption is presumed to hold for elliptic curves typically used in cryptography, unless the curve is chosen to have a bilinear pairing.