On an elliptic curve we have
- point addition $C:=A+B$ defined for any two points $A$ and $B$ of the curve (often with special rules for $A=B$ or some special points, depending on the coordinate system).
- neutral $\infty$ such that $A+\infty=\infty+A=A$ for all $A$ on the curve (including $\infty$)
- opposite $-A$ of any $A$ on the curve such that $A+(-A)=(-A)+A=\infty$ (with $\infty$ it's own opposite).
Point addition is associative, and commutative.
From this we can define point multiplication by an integer $i\in\mathbb Z$ (also known as scalar multiplication), as
$$i\times A\underset{\text{def}}=\begin{cases}
\infty&\text{if }i=0\\
((i-1)\times A)+A&\text{if }i>0\\
(-i)\times (-A)&\text{if }i<0
\end{cases}$$
From this it follows that for all $A$ and $B$ on the curve (including $\infty$) and all integers $i$, $j$, it holds
$$\begin{align}
(i+j)\times A&=(i\times A)+(j\times A)\\
i\times(A+B)&=(i\times A)+(i\times B)\\
(i\times j)\times A&=i\times (j\times A)\\
\end{align}$$
where in the above, the top left addition and bottom left multiplication are in $\mathbb Z$, and all the other operations are point addition or point multiplication by an integer.
When we talk about multiplication in Elliptic Curve cryptography, that's most often this multiplication by an integer.
In order to define multiplication of points, we need to designate a particular point $G$ and restrict to points $A$ that can be obtained as $A=a\times G$ for some integer $a\in\mathbb Z$. They form a subgroup of the curve. Many groups used in Elliptic Curve Cryptography are cyclic, meaning there exists $G$ such that any point of the group can be obtained in this way. For some curves (those with a prime number of point including $\infty$, e.g secp256k1 or secp384r1), any point $G$ other than $\infty$ can be used and all points of the curve are of this form $A=a\times G$.
For elliptic curves on a finite field as used in cryptography, there is some minimal strictly positive integer $n$ such that $n\times G=\infty$ (the order of $G$), and that's also the order (the number of elements) of said subgroup. For any $A$ in this subgroup, there is a uniquely defined $a\in[0,n)$ with $A=a\times G$.
We can then define the product of point $A=a\times G$ and $B=b\times G$ with $a,b\in[0,n)$ as the point
$$A\times B\underset{\text{def}}=(a\times b\bmod n)\times G$$
That product of elliptic curve points inherits associativity, commutativity, neutral $G$, from the corresponding properties of multiplication in $\mathbb Z_n$. Distributivity w.r.t. point addition holds. Also, $(i\times A)\times B=i\times(A\times B)$ holds for all points $A$, $B$ which product is defined, and all integers $i$.
When $n$ is prime (which holds for most curves and generators $G$ used in ECC), any point $A$ except $\infty$ has inverse $A^{-1}$ such that $A\times A^{-1}=A^{-1}\times A=G$. If $A=a\times G$, then $A^{-1}=(a^{-1}\bmod n)\times G$.
Notice that this definition of multiplication depends on the choice of $G$, and is for the whole curve only when the elliptic curve group is cyclic.
Also, we can compute $C=A\times B$ efficiently if we know $a$ with $A=a\times G$ (as $C:=a\times B$) or know $b$ with $B=b\times G$ (as $C:=b\times A$). But otherwise, the best known algorithms have cost $\Theta(\sqrt n)$ on standard computers, thus are not polynomial time w.r.t. the bit size of $n$.
