Stationary Syndrome Decoding for Improved PCGs
Vladimir Kolesnikov, Stanislav Peceny, Srinivasan Raghuraman, Peter Rindal
Abstract
Syndrome decoding (SD), and equivalently Learning Parity with Noise (LPN), is a fundamental problem in cryptography, which states that for a field , some compressing public matrix , and a secret sparse vector sampled from some noise distribution, is indistinguishable from uniform. Recently, the SD has gained significant interest due to its use in pseudorandom correlation generators (PCGs).
In pursuit of better efficiency, we propose a new assumption called Stationary Syndrome Decoding (SSD). In SSD, we consider correlated noise vectors and associated instances where the noise vectors are restricted to having non-zeros in the same small subset of positions . That is, for all , is uniformly random, while for all other , .
Although naively reusing the noise vector renders SD and LPN insecure via simple Gaussian elimination, we observe known attacks do not extend to our correlated noise. We show SSD is unconditionally secure against so-called linear attacks, e.g., advanced information set decoding and representation techniques (Esser and Santini, Crypto 2024). We further adapt the state-of-the-art nonlinear attack (Briaud and Oygarden, Eurocrypt 2023) to SSD and demonstrate both theoretically and experimentally resistance to the attack.
We apply SSD to PCGs to amortize the cost of noise generation protocol. For OT and VOLE generation, each instance requires communication instead of . For suggested parameters, we observe a improvement in the running time or between 6 and reduction in communication. For Beaver triple generation using Ring LPN, our techniques have the potential for substantial amortization due to the high concrete overhead of the Ring LPN noise generation.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 39ecb898-0a8d-4206-96f7-55b99c87d335Cited by top-tier papers5
- Encrypted Matrix-Vector Products from Secret Dual CodesFabrice Benhamouda, Caicai Chen, Shai Halevi, Yuval Ishai et al.CCS 2025 · 1 citation
- Post-quantum Public-Key Pseudorandom Correlation Functions for OTShweta Agrawal, Kaartik Bhushan, Geoffroy Couteau, Mahshid RiahiniaCRYPTO 2026
- From OT to OLE with Subquadratic CommunicationJack Doerner, Iftach Haitner, Yuval Ishai, Nikolaos MakriyannisCCS 2025
- A Minrank-Based Encryption Scheme à la Alekhnovich-RegevThomas Debris-Alazard, Philippe Gaborit, Romaric Neveu, Olivier RuattaEUROCRYPT 2026
- Succinct Two-Round Two-Party Signing from PCFsLennart Braun, Geoffroy Couteau, Kelsey Melissaris, Mahshid Riahinia et al.CRYPTO 2026
Related papers
- A New Algebraic Approach to the Regular Syndrome Decoding Problem and Implications for PCG ConstructionsPierre Briaud, Morten ØygardenEUROCRYPT 2023 · 21 citations
- Correlated Pseudorandomness from the Hardness of Quasi-Abelian DecodingMaxime Bombar, Geoffroy Couteau, Alain Couvreur, Clément DucrosCRYPTO 2023 · 27 citations
- Efficient Pseudorandom Correlation Generators from Ring-LPNElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai et al.CRYPTO 2020 · 113 citations
- Dory: Streaming PCG with Small MemoryXiaojie Guo, Hanlin Liu, Zhicong Huang, Hongrui Cui et al.S&P 2026 · 1 citation
- Faster Pseudorandom Correlation Generators via Walsh-Hadamard TransformZhe Li, Hongqing Liu, Chaoping Xing, Yizhou Yao et al.CRYPTO 2026
