You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
\caption{The timed results compared between CAAUrdleProofs and Curdleproofs}%
9
10
\label{fig:resulttimes}%
10
11
\end{figure*}
11
-
And they are very good
12
+
13
+
After running the experiment where Curdleproofs and CAAUrdleproofs were compared across different shuffle sizes, we obtained the results shown in \autoref{fig:resulttimes}.
14
+
15
+
As mentioned in \autoref{sec:CAAUrdleproof-experiment}, CAAUdleproofs was run with a shuffle size $\ell$ of $\{8,9,\dots,256\}$ but Curdleproofs was only run with a shuffle size $\ell$ of $\{8,16,32,64,128,256\}$.
16
+
This is why the results for Curdleproofs show the shuffle size, $\ell$, instantly goes up to the next power of 2, because it theoretically would have to pad the input set until it reached the next power of 2.
17
+
18
+
From the results, we can see that CAAUrdleproofs and Curdleproofs have similar proving and verifying times when $\ell$ is a power of 2.
19
+
However, when $\ell$ is not a power of 2, CAAUrdleproofs is faster.
20
+
21
+
The results for the verifying time also shows that the verifying time jumps up the first four times it reaches a power of 2.
22
+
23
+
Additional to the proving and verifying times, the time used on shuffling is also lower for any $\ell$ that is not a power of 2.
24
+
Though, that was to be expected since CAAUrdleproofs uses the same shuffling algorithm as Curdleproofs but does not have to add additional padding values to the non power of 2 input sizes.
\caption{The results of the shuffle security experiment showing the mean amount of honest shuffles necessary with one standard deviation}%
37
+
\label{fig:shufflesecurity}%
38
+
\end{figure*}
39
+
40
+
The results of the shuffle security experiment are shown in \autoref{fig:shufflesecurity}.
41
+
42
+
\autoref{fig:shufflesecurity} shows the mean of the 1000 runs of each shuffle size $\ell$ as well as one standard deviation higher and lower.
43
+
44
+
We can see that the bigger the shuffle size $\ell$ is, the less honest shuffles are necessary to make the shuffle secure.
45
+
We also see that the bigger the shuffle size the narrower the standard deviation gets.
46
+
47
+
From the results of the experiment with $\alpha=8192$ we can see that number of honest shuffles necessary to make the shuffle secure sharply goes down until a size of $\ell=64$, and then it starts to flatten out.
48
+
we can see that with a size of $\ell=75$ we need about 1/3 of the shuffles to be honest to make the shuffle secure.
49
+
Likewise, we can see the at $\ell=108$ we need about 1/4 of the shuffles to be honest to make the shuffle secure.
50
+
51
+
In general all three of the experiments, despite the difference in $\alpha$, show the same trend.
52
+
They all level out but the higher the $\alpha$ is, the lower the leveling happens but the later it happens as well.
53
+
There are two things however that are different between the experiments.
54
+
At an $\alpha$ of 4096 we can see that at the start, with $\ell=32$, the mean number of honest shuffles necessary to make the shuffle secure is $\sim500$ lower than the 2 others.
55
+
As $\ell$ increases, the mean number of honest shuffles necessary to make the shuffle secure becomes similar to the other $\alpha$ values.
56
+
Another thing that differs between the experiments is that they all have sudden dip later on in the experiment.
57
+
Here we can see a trend that the lower the~$\alpha$ is, the earlier the dip happens.
0 commit comments