Faster pseudorandom correlation generators via Walsh-Hadamard transform
From MaRDI portal
Cites work
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- A statistical decoding algorithm for general linear block codes
- A toolkit for ring-LWE cryptography
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Asymptotics and improvements of sieving for codes
- Blaze: fast SNARKs from interleaved RAA codes
- Compressing unit-vector correlations via sparse pseudorandom generators
- Correlated pseudorandom functions from variable-density LPN
- Correlated pseudorandomness from expand-accumulate codes
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- Cryptographic Boolean functions and applications
- Decoding linear codes with high error rate and its impact for LPN security
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Distributed Point Functions and Their Applications
- Efficient multiparty protocols using circuit randomization
- Efficient pseudorandom correlation generators for any finite field
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Efficient pseudorandom correlation generators: silent OT extension and more
- Expand-convolute codes for pseudorandom correlation generators from LPN
- Faster Walsh-Hadamard and discrete Fourier transforms from matrix non-rigidity
- Faster Walsh-Hadamard transform and matrix multiplication over finite fields using lookup tables
- Field-agnostic SNARKs from expand-accumulate codes
- FOLEAGE: \(\mathbb{F}_4\)OLE-based multi-party computation for Boolean circuits
- Function secret sharing
- Half-tree: halving the cost of tree expansion in COT and DPF
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 3525015 (Why is no real title available?)
- scientific article; zbMATH DE number 1957384 (Why is no real title available?)
- Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
- Lapin: an efficient authentication protocol based on ring-LPN
- Le Mans: dynamic and fluid MPC for dishonest majority
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- Multiparty Computation from Somewhat Homomorphic Encryption
- Oblivious transfer with constant computational overhead
- On computing nearest neighbors with applications to decoding of binary linear codes
- On the Equivalence Between One-Dimensional Discrete Walsh-Hadamard and Multidimensional Discrete Fourier Transforms
- Practical cryptanalysis of pseudorandom correlation generators based on quasi-abelian syndrome decoding
- Reduction from sparse LPN to LPN, dual attack 3.0
- Rigorous foundations for dual attacks in coding theory
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Sok: vector OLE-based zero-knowledge protocols
- Stationary syndrome decoding for improved PCGs
- Statistical decoding 2.0: reducing decoding to LPN
- Statistical Decoding Revisited
- The Fast Fourier Transform
- Thresholds of Random Quasi-Abelian Codes
This page was built for publication: Faster pseudorandom correlation generators via Walsh-Hadamard transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443579)