The hardness of LPN over any integer ring and field for PCG applications
From MaRDI portal
Publication:6637566
DOI10.1007/978-3-031-58751-1_6zbMATH Open1548.9489MaRDI QIDQ6637566
Hanlin Liu, Xiao Wang, Yu Yu, Kang Yang
Publication date: 13 November 2024
zero-knowledge proofslearning parity with noisesecure multi-party computationprivate set intersection
Related Items (3)
Group encryption: full dynamicity, message filtering and code-based instantiation ⋮ Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks ⋮ More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
This page was built for publication: The hardness of LPN over any integer ring and field for PCG applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637566)
