More Efficient Zero-Knowledge Protocols over $\mathbb {Z}_{2^k}$ via Galois Rings
- 16 August 2024
- book chapter
- Published by Springer Nature
- p. 424-457
Abstract
No abstract availableKeywords
This publication has 56 references indexed in Scilit:
- MHz2k: MPC from HE over $\mathbb {Z}_{2^k}$ with New Packing, Simpler Reshare, and Better ZKP2021
- Asymptotically-Good Arithmetic Secret Sharing over $\mathbb {Z}/p^{\ell }\mathbb {Z}$ with Strong Multiplication and Its Applications to Efficient MPC2021
- TurboIKOS: Improved Non-interactive Zero Knowledge and Post-quantum Signatures2021
- A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity2020
- Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup2020
- Stacked Garbling for Disjunctive Zero-Knowledge Proofs2020
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS2020
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography2020
- Efficient Pseudorandom Correlation Generators: Silent OT Extension and More2019
- Aurora: Transparent Succinct Arguments for R1CS2019