Co-authors: Hua Xu, Mariana Gama, Jiayi Kang

eprint.iacr.org/2025/1285

We have some practical solutions for this issue in the paper, but the real deal (negligible cost)is in the making (final touches) and will be published soon.

In contrast, we present a bivariate polynomial commitment scheme based on FRI, achieving a transparent and plausibly PQ alternative. It comes with a bit of communication cost.

We adapt the distributed proof generation technique introduced in Pianist (IEEE S&P 2024), which achieves linear scalability by encoding witnesses using bivariate polynomials and committing to them using the KZG polynomial commitment scheme.

So you basically can horizontally scale out your ZK proof generation. You want it to be faster? Add more worker nodes.

How hard is to hide the authors on in-submission eprints?
When accepted, the authors can reveal them. You can call it eprint blind submission. I think our community is good at blinding, unblinding stuff.
And, make this mandatory.
Or, just stop calling it double-blind peer review.

If I review a paper from my domain, there is a good chance that I already read the paper and know the authors before it is assigned to me.

Really interesting

#RealWorldCrypto2025