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
Copy file name to clipboardexpand all lines: auditor-docs/privacy-preserving-proof-of-assets.tex
+32-2
Original file line number
Diff line number
Diff line change
@@ -82,7 +82,7 @@ \subsection{The 1000ft view}
82
82
83
83
\subsection{Earlier work on the problem}
84
84
85
-
The seminal work ``Provisions'' addresses the same ``proof of assets'' scenario, as well as ``proof of liabilities'' (specifically for asset custodians), but using only standard $\Sigma$-protocol techniques (including proof of commitment to bit representations). Thus it is the perhaps canonical example of category (1) in the list above. Hence it is probably impractical for very large anonymity sets. To quote the paper itself:
85
+
The seminal work ``Provisions''{[}\protect\hyperlink{anchor-1}{1}{]} addresses the same ``proof of assets'' scenario, as well as ``proof of liabilities'' (specifically for asset custodians), but using only standard $\Sigma$-protocol techniques (including proof of commitment to bit representations). Thus it is the perhaps canonical example of category (1) in the list above. Hence it is probably impractical for very large anonymity sets. To quote the paper itself:
86
86
87
87
\begin{quote}
88
88
Provisions scales linearly in proof size, construction and verification time with respect to its inputs: the proof of assets scales with the size of the anonymity set $\ldots$
The sample results in \ref{table:prfsize} do not include proof batching, hence the sizes vary with the size of the witness utxo set primarily. Note for example that the exponent, which is the value $n$ in the formula $k < \sum_i v_i > k + 2^n$, has either little, or no effect on the proof size which is helpful for proving larger integer ranges of satoshis.
324
+
325
+
\vspace{5 pt}
326
+
327
+
Note that it is specifically the curve tree proof that could be easily batched, and the range proof also with some work; the number of individual bulletproofs could be reduced from $3n$ to $2$ (in case of tree depth $2$, which isn't always optimal but usually close to optimal).
322
328
329
+
\vspace{5 pt}
323
330
331
+
Even without that optimization, the proof sizes are manageable for small numbers of utxos.
332
+
333
+
\begin{table}[ht]
334
+
\caption{Audit proof sizes in bytes}
335
+
\centering
336
+
\begin{tabular}{c c c c}
337
+
\hline\hline
338
+
\# utxos & anon set size & range exponent & Bytes \\ [0.5ex]
0 commit comments