Efficient pseudorandom correlation generators: silent OT extension and more

DOI10.1007/978-3-030-26954-8_16zbMath1498.68048OpenAlexW2968502565MaRDI QIDQ2304930

Yuval Ishai, Elette Boyle, Niv Gilboa, Lisa Kohl, Geoffroy Couteau, Peter Scholl

Publication date: 9 March 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-26954-8_16

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Computer security (68M25)

Related Items (66)

On the round complexity of black-box secure MPC ⋮ Oblivious key-value stores and amplification for private set intersection ⋮ Sublinear GMW-style compiler for MPC with preprocessing ⋮ Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions ⋮ MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ Dual-mode NIZKs: possibility and impossibility results for property transfer ⋮ Round-optimal black-box protocol compilers ⋮ Secure multiparty computation with sublinear preprocessing ⋮ Distributed (correlation) samplers: how to remove a trusted dealer in one round ⋮ Batch-OT with optimal rate ⋮ Secure non-interactive simulation: feasibility and rate ⋮ Secure non-interactive reduction and spectral analysis of correlations ⋮ Reusable Two-Round MPC from LPN ⋮ Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN ⋮ CNF-FSS and Its Applications ⋮ Secure computation with preprocessing via function secret sharing ⋮ PrORAM ⋮ Actively secure half-gates with minimum overhead under duplex networks ⋮ Sok: vector OLE-based zero-knowledge protocols ⋮ On homomorphic secret sharing from polynomial-modulus LWE ⋮ Improved private set intersection for sets with small entries ⋮ Pseudorandom correlation functions from variable-density LPN, revisited ⋮ Putting the online phase on a diet: covert security from short MACs ⋮ A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions ⋮ Short signatures from regular syndrome decoding in the head ⋮ Constrained pseudorandom functions from homomorphic secret sharing ⋮ Structure-aware private set intersection, with applications to fuzzy matching ⋮ Le Mans: dynamic and fluid MPC for dishonest majority ⋮ Authenticated garbling from simple correlations ⋮ Programmable distributed point functions ⋮ Sublinear secure computation from new assumptions ⋮ Secure non-interactive simulation from arbitrary joint distributions ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ Amortizing division and exponentiation ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Non-interactive secure computation of inner-product from LPN and LWE ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Oblivious transfer with constant computational overhead ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model ⋮ Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ An algebraic framework for silent preprocessing with trustless setup and active security ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Half-tree: halving the cost of tree expansion in COT and DPF ⋮ One-message secure reductions: on the cost of converting correlations ⋮ A framework for statistically sender private OT with optimal rate ⋮ Malicious secure, structure-aware private set intersection ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ Expand-convolute codes for pseudorandom correlation generators from LPN ⋮ \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ New constructions of statistical NIZKs: dual-mode DV-NIZKs and more ⋮ The rise of Paillier: homomorphic secret sharing and public-key silent OT ⋮ Breaking the circuit size barrier for secure computation under quasi-polynomial LPN ⋮ A geometric approach to homomorphic secret sharing ⋮ Masked triples. Amortizing multiplication triples across conditionals ⋮ Private set operations from oblivious switching ⋮ Actively secure setup for SPDZ ⋮ Efficient pseudorandom correlation generators from ring-LPN ⋮ Improved primitives for MPC over mixed arithmetic-binary circuits ⋮ Multiparty generation of an RSA modulus ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures

This page was built for publication: Efficient pseudorandom correlation generators: silent OT extension and more