Efficient pseudorandom correlation generators from ring-LPN
From MaRDI portal
Publication:2096531
Recommendations
- Efficient pseudorandom correlation generators: silent OT extension and more
- Low-communication multiparty triple generation for SPDZ from ring-LPN
- Correlated pseudorandomness from expand-accumulate codes
- Secure multiparty computation with sublinear preprocessing
- Better preprocessing for secure multiparty computation
Cites work
- A New Algorithm for Solving Ring-LPN With a Reducible Polynomial
- A new approach to practical active-secure two-party computation
- A note on the communication complexity of multiparty computation in the correlated randomness model
- A toolkit for ring-LWE cryptography
- Batch codes and their applications
- Breaking the circuit size barrier for secure computation under DDH
- Distributed Point Functions and Their Applications
- Efficient Encryption From Random Quasi-Cyclic Codes
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient pseudorandom correlation generators: silent OT extension and more
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Founding Cryptography on Oblivious Transfer – Efficiently
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic SIMD operations
- Function secret sharing
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Homomorphic secret sharing from lattices without FHE
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (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
- Multiparty Computation from Somewhat Homomorphic Encryption
- Never Trust a Bunny
- NFLlib: NTT-Based Fast Lattice Library
- Oblivious transfer and polynomial evaluation
- On lattices, learning with errors, random linear codes, and cryptography
- On the power of correlated randomness in secure computation
- Overdrive: making SPDZ great again
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Secure Arithmetic Computation with No Honest Majority
- Secure computation with preprocessing via function secret sharing
- Semi-homomorphic encryption and multiparty computation
- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
- Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
Cited in
(81)- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- 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
- Efficient, actively secure MPC with a dishonest majority: a survey
- Efficient pseudorandom correlation generators: silent OT extension and more
- SPRING: Fast Pseudorandom Functions from Rounded Ring Products
- Fast Time-Recursive Block Correlators for Pseudorandom Sequences
- Low-communication multiparty triple generation for SPDZ from ring-LPN
- 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
- Group Structure in Correlations and Its Applications in Cryptography.
- 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
- Expand-convolute codes for pseudorandom correlation generators from LPN
- Maliciously Secure Multi-party PSI with Lower Bandwidth and Faster Computation
- Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography
- Toward malicious constant-rate 2PC via arithmetic garbling
- Fast public-key silent OT and more from constrained Naor-Reingold
- The hardness of LPN over any integer ring and field for PCG applications
- Two-round maliciously-secure oblivious transfer with optimal rate
- Lossy cryptography from code-based assumptions
- Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks
- Compressing unit-vector correlations via sparse pseudorandom generators
- Cheater identification on a budget: MPC with identifiable abort from pairwise MACs
- Multiparty garbling from OT with linear scaling and RAM support
- Row reduction techniques for n-party garbling
- Efficient pseudorandom correlation generators over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Multiparty distributed point functions
- Actively secure MPC in the dishonest majority setting: achieving constant complexity in online communication, computation per gate, rounds, and private input size
- Resolving the efficiency-utility dilemma of threshold linearly homomorphic encryption via message-space adapter
- Stationary syndrome decoding for improved PCGs
- On the soundness of algebraic attacks against code-based assumptions
- Weakly super-invertible matrices and constant communication dishonest majority MPC
- Efficient pseudorandom correlation generators for any finite field
- Multi-key homomorphic secret sharing
- Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
- Arctic: lightweight and stateless threshold Schnorr signatures
- Non-interactive distributed point functions
- Faster signatures from MPC-in-the-head
- Dishonest majority multiparty computation over matrix rings
- Dishonest majority constant-round MPC with linear communication from DDH
- Constrained pseudorandom functions for inner-product predicates from weaker assumptions
- Generation of authenticated secret-shared scaled unit vectors for beaver triples
- Actively secure half-gates with minimum overhead under duplex networks
- A hybrid algorithm for the regular syndrome decoding problem
- Laconic cryptography with preprocessing
- New framework for structure-aware PSI from distributed function secret sharing
- Pseudorandom correlation functions from Ring-LWR
- Fast pseudorandom correlation functions from sparse LPN
- Pseudorandom correlation generators for multiparty Beaver triples over \(\mathbb{F}_2\)
- Practical secure delegated linear algebra with trapdoored matrices
- Pseudorandom correlation functions for garbled circuits
- Multiparty homomorphic secret sharing and more from LPN and MQ
- Non-interactive secure computation with constant communication overhead
- Amortizing Circuit-PSI in the multiple sender/receiver setting
- Multi-committee MPC: from unanimous to identifiable abort
- On the power of Sumcheck in secure multiparty computation
- Malicious homomorphic secret sharing with applications to DV-NIZK and more
This page was built for publication: Efficient pseudorandom correlation generators from ring-LPN
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096531)
