Efficient pseudorandom correlation generators from ring-LPN
From MaRDI portal
Publication:2096531
DOI10.1007/978-3-030-56880-1_14zbMath1501.94033OpenAlexW3048468015MaRDI QIDQ2096531
Niv Gilboa, Elette Boyle, Yuval Ishai, Geoffroy Couteau, Peter Scholl, Lisa Kohl
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_14
Related Items (31)
Sublinear GMW-style compiler for MPC with preprocessing ⋮ MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ Asymptotically quasi-optimal cryptography ⋮ Secure multiparty computation with sublinear preprocessing ⋮ Distributed (correlation) samplers: how to remove a trusted dealer in one round ⋮ Secure non-interactive simulation: feasibility and rate ⋮ Secure non-interactive reduction and spectral analysis of correlations ⋮ Sok: vector OLE-based zero-knowledge protocols ⋮ 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 ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ Le Mans: dynamic and fluid MPC for dishonest majority ⋮ On codes and learning with errors over function fields ⋮ Authenticated garbling from simple correlations ⋮ Programmable distributed point functions ⋮ Secure non-interactive simulation from arbitrary joint distributions ⋮ Non-interactive secure computation of inner-product from LPN and LWE ⋮ Oblivious transfer with constant computational overhead ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ 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 ⋮ Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ The rise of Paillier: homomorphic secret sharing and public-key silent OT ⋮ Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Overdrive: making SPDZ great again
- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
- Secure computation with preprocessing via function secret sharing
- Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
- Homomorphic secret sharing from lattices without FHE
- A note on the communication complexity of multiparty computation in the correlated randomness model
- Efficient pseudorandom correlation generators: silent OT extension and more
- Fully homomorphic SIMD operations
- NFLlib: NTT-Based Fast Lattice Library
- Oblivious transfer and polynomial evaluation
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Never Trust a Bunny
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Function Secret Sharing
- A New Algorithm for Solving Ring-LPN With a Reducible Polynomial
- Semi-homomorphic Encryption and Multiparty Computation
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Batch codes and their applications
- Founding Cryptography on Oblivious Transfer – Efficiently
- Secure Arithmetic Computation with No Honest Majority
- Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
- Lapin: An Efficient Authentication Protocol Based on Ring-LPN
- On the Power of Correlated Randomness in Secure Computation
- A Toolkit for Ring-LWE Cryptography
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Efficient Encryption From Random Quasi-Cyclic Codes
- Distributed Point Functions and Their Applications
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Efficient pseudorandom correlation generators from ring-LPN
