Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
From MaRDI portal
Recommendations
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
- More efficient oblivious transfer extensions
- Founding Cryptography on Oblivious Transfer – Efficiently
- Universally composable oblivious transfer based on a variant of LPN
- Improved OT extension for transferring short secrets
Cites work
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 4037759 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 3437021 (Why is no real title available?)
- scientific article; zbMATH DE number 1942427 (Why is no real title available?)
- A Statistical Decoding Algorithm for General Linear Block Codes
- Actively secure 1-out-of-N OT extension with application to private set intersection
- Actively secure OT extension with optimal overhead
- Advances in Cryptology - CRYPTO 2003
- An Improved LPN Algorithm
- Analysis of information set decoding for a sub-linear error weight
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
- Constrained pseudorandom functions and their applications
- Constructions of low-degree and error-correcting -biased generators
- Cryptography with constant computational overhead
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding linear codes with high error rate and its impact for LPN security
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Efficient encoding of low-density parity-check codes
- Efficient pseudorandom correlation generators: silent OT extension and more
- Faster algorithms for solving LPN
- Functional signatures and pseudorandom functions
- Information-set decoding for linear codes over F_q
- Inter-reciprocity applied to electrical networks
- LP solutions of vectorial integer subset sums -- cryptanalysis of Galbraith's binary matrix LWE
- LPN decoded
- Linear-time encodable and decodable error-correcting codes
- Linearization Attacks Against Syndrome Based Hashes
- Modeling Bit Flipping Decoding Based on Nonorthogonal Check Sums With Application to Iterative Decoding Attack of McEliece Cryptosystem
- Noise-tolerant learning, the parity problem, and the statistical query model
- On agnostic learning of parities, monomials, and halfspaces
- On computing nearest neighbors with applications to decoding of binary linear codes
- On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
- On solving LPN using BKW and variants, Implementation and analysis
- Optimization of \(\mathsf {LPN}\) solving algorithms
- PSI from PaXoS: fast, malicious private set intersection
- Pseudorandom functions: three decades later
- Quantum information set decoding algorithms
- Relations between average case complexity and approximation complexity
- Searching for linear codes with large minimum distance
- Secure arithmetic computation with constant computational overhead
- Security bounds for the design of code-based cryptosystems
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Smaller decoding exponents: ball-collision decoding
- Solving LPN Using Covering Codes
- Statistical Decoding Revisited
- The complexity of information set decoding
- The intractability of computing the minimum distance of a code
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
- Weight Distribution of Low-Density Parity-Check Codes
Cited in
(47)- Actively secure half-gates with minimum overhead under duplex networks
- Amortizing division and exponentiation
- Secure approximate nearest neighbor search with locality-sensitive hashing
- Faster signatures from MPC-in-the-head
- Attaining GOD beyond honest majority with friends and foes
- Non-interactive secure computation of inner-product from LPN and LWE
- Oblivious transfer with constant computational overhead
- Reverse firewalls for oblivious transfer extension and applications to zero-knowledge
- Revisiting OKVS-based OPRF and PSI: cryptanalysis and better construction
- Dishonest majority multiparty computation over matrix rings
- Updatable private set intersection revisited: extended functionalities, deletion, and worst-case complexity
- FOLEAGE: \(\mathbb{F}_4\)OLE-based multi-party computation for Boolean circuits
- QuietOT: lightweight oblivious transfer with a public-key setup
- The hardness of LPN over any integer ring and field for PCG applications
- On the correlation complexity of MPC with cheater identification
- Correlated pseudorandomness from expand-accumulate codes
- Half-tree: halving the cost of tree expansion in COT and DPF
- Actively secure half-gates with minimum overhead under duplex networks
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- A hybrid algorithm for the regular syndrome decoding problem
- Malicious secure, structure-aware private set intersection
- One-message secure reductions: on the cost of converting correlations
- Fast pseudorandom correlation functions from sparse LPN
- Pseudorandom correlation generators for multiparty Beaver triples over \(\mathbb{F}_2\)
- Improved circuit-based PSI via equality preserving compression
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- Expand-convolute codes for pseudorandom correlation generators from LPN
- Improved private set intersection for sets with small entries
- Pseudorandom correlation functions from variable-density LPN, revisited
- Stationary syndrome decoding for improved PCGs
- Short signatures from regular syndrome decoding in the head
- Fast public-key silent OT and more from constrained Naor-Reingold
- Silver
- Instantiating the hash-then-evaluate paradigm: strengthening PRFs, PCFs, and OPRFs
- Authenticated garbling from simple correlations
- Maliciously Secure Multi-party PSI with Lower Bandwidth and Faster Computation
- Structure-aware private set intersection, with applications to fuzzy matching
- A systematic study of sparse LWE
- Lossy cryptography from code-based assumptions
- Computation efficient structure-aware PSI from incremental function secret sharing
- Non-interactive zero-knowledge from LPN and MQ
- Non-interactive threshold BBS+ from pseudorandom correlations
- \textsf{LR-OT}: leakage-resilient oblivious transfer
- Instantiating the hash-then-evaluate paradigm: strengthening PRFs, PCFs, and OPRFs
- LR-OT: leakage-resilient oblivious transfer
- Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
This page was built for publication: Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129008)
