Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
From MaRDI portal
Publication:2129008
DOI10.1007/978-3-030-84252-9_17OpenAlexW3190233621MaRDI QIDQ2129008
Peter Rindal, Srinivasan Raghuraman, Geoffroy Couteau
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84252-9_17
Related Items
Actively secure half-gates with minimum overhead under duplex networks, Improved private set intersection for sets with small entries, Pseudorandom correlation functions from variable-density LPN, revisited, Short signatures from regular syndrome decoding in the head, Structure-aware private set intersection, with applications to fuzzy matching, Authenticated garbling from simple correlations, Amortizing division and exponentiation, Non-interactive secure computation of inner-product from LPN and LWE, Attaining GOD beyond honest majority with friends and foes, Reverse firewalls for oblivious transfer extension and applications to zero-knowledge, Oblivious transfer with constant computational overhead, SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model, Correlated pseudorandomness from expand-accumulate codes, Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\), Half-tree: halving the cost of tree expansion in COT and DPF, One-message secure reductions: on the cost of converting correlations, Malicious secure, structure-aware private set intersection, Correlated pseudorandomness from the hardness of quasi-abelian decoding, Expand-convolute codes for pseudorandom correlation generators from LPN, Silver
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On solving LPN using BKW and variants, Implementation and analysis
- Constructions of low-degree and error-correcting \(\varepsilon \)-biased generators
- Decoding linear codes with high error rate and its impact for LPN security
- Quantum information set decoding algorithms
- Secure arithmetic computation with constant computational overhead
- LPN decoded
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
- PSI from PaXoS: fast, malicious private set intersection
- Efficient pseudorandom correlation generators: silent OT extension and more
- On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
- Analysis of Information Set Decoding for a Sub-linear Error Weight
- Faster Algorithms for Solving LPN
- Constrained Pseudorandom Functions and Their Applications
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Solving LPN Using Covering Codes
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Optimization of $$\mathsf {LPN}$$ Solving Algorithms
- Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
- Candidate weak pseudorandom functions in AC 0 ○ MOD 2
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Linear-time encodable and decodable error-correcting codes
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Inter-reciprocity applied to electrical networks
- Actively Secure OT Extension with Optimal Overhead
- Searching for linear codes with large minimum distance
- An Improved LPN Algorithm
- Weight Distribution of Low-Density Parity-Check Codes
- Modeling Bit Flipping Decoding Based on Nonorthogonal Check Sums With Application to Iterative Decoding Attack of McEliece Cryptosystem
- On Agnostic Learning of Parities, Monomials, and Halfspaces
- Information-Set Decoding for Linear Codes over F q
- Relations between average case complexity and approximation complexity
- Security Bounds for the Design of Code-Based Cryptosystems
- The complexity of information set decoding
- The intractability of computing the minimum distance of a code
- Efficient encoding of low-density parity-check codes
- A Statistical Decoding Algorithm for General Linear Block Codes
- Pseudorandom Functions: Three Decades Later
- Smaller Decoding Exponents: Ball-Collision Decoding
- Functional Signatures and Pseudorandom Functions
- Advances in Cryptology - CRYPTO 2003
- Linearization Attacks Against Syndrome Based Hashes
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- LP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWE
- Statistical Decoding Revisited
- Noise-tolerant learning, the parity problem, and the statistical query model
