MoneroResearch.info |
Resource type: Proceedings Article BibTeX citation key: Esgin2022 View all bibliographic details |
Categories: Monero-focused Creators: Esgin, Steinfeld, Zhao Publisher: IEEE Collection: 2022 IEEE Symposium on Security and Privacy (SP) |
Views: 92/3224
|
Attachments MatRiCT.pdf [43/846] | URLs https://eprint.iacr.org/2021/545.pdf |
Abstract |
We introduce MatRiCT+, a practical private blockchain payment protocol based on “post-quantum” lattice assumptions. MatRiCT+ builds on MatRiCT due to Esgin et al. (ACM CCS’19) and, in general, follows the Ring Confidential Transactions (RingCT) approach used in Monero, the largest privacy-preserving cryptocurrency. In terms of the practical aspects, MatRiCT+ has 2–18× shorter proofs (depending on the number of input accounts, M ) and runs 3–11× faster (for a typical transaction) in comparison to MatRiCT. A significant advantage of MatRiCT+ is that the proof length’s dependence on M is very minimal (only O(log M )), while MatRiCT has a proof length linear in M . To support its efficiency, we devise several novel techniques in our design of MatRiCT+ to achieve compact lattice-based zero- knowledge proof systems, exploiting the algebraic properties of power-of-2 cyclotomic rings commonly used in practical lattice- based cryptography. Along the way, we design a family of “optimal” challenge spaces, using a technique we call partition- and-sample, with minimal `1-norm and invertible challenge differ- ences (with overwhelming probability), while supporting highly- splitting power-of-2 cyclotomic rings. We believe all these results to be widely applicable and of independent interest.
|
Notes |
Paper Presentation: https://m.youtube.com/watch?v=sWdckoTaao0 Code: https://gitlab.com/raykzhao/matrict_plus Added by: Jack Last edited by: Jack |