Pages that link to "Item:Q2096531"
From MaRDI portal
The following pages link to Efficient pseudorandom correlation generators from ring-LPN (Q2096531):
Displayed 31 items.
- The rise of Paillier: homomorphic secret sharing and public-key silent OT (Q2056710) (← links)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771) (← links)
- Sublinear GMW-style compiler for MPC with preprocessing (Q2128572) (← links)
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications (Q2139646) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
- Distributed (correlation) samplers: how to remove a trusted dealer in one round (Q2170033) (← links)
- Secure non-interactive simulation: feasibility and rate (Q2170112) (← links)
- Secure non-interactive reduction and spectral analysis of correlations (Q2170114) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- Sok: vector OLE-based zero-knowledge protocols (Q6063131) (← links)
- Improved private set intersection for sets with small entries (Q6067359) (← links)
- Pseudorandom correlation functions from variable-density LPN, revisited (Q6067361) (← links)
- Putting the online phase on a diet: covert security from short MACs (Q6080913) (← links)
- A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions (Q6083670) (← links)
- Short signatures from regular syndrome decoding in the head (Q6083678) (← links)
- On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator (Q6095188) (← links)
- Le Mans: dynamic and fluid MPC for dishonest majority (Q6097268) (← links)
- On codes and learning with errors over function fields (Q6104346) (← links)
- Authenticated garbling from simple correlations (Q6111541) (← links)
- Programmable distributed point functions (Q6111543) (← links)
- Secure non-interactive simulation from arbitrary joint distributions (Q6114278) (← links)
- Non-interactive secure computation of inner-product from LPN and LWE (Q6135407) (← links)
- Oblivious transfer with constant computational overhead (Q6138086) (← links)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260) (← links)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)
- Half-tree: halving the cost of tree expansion in COT and DPF (Q6178790) (← links)
- One-message secure reductions: on the cost of converting correlations (Q6186603) (← links)
- A framework for statistically sender private OT with optimal rate (Q6186604) (← links)
- Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions (Q6186607) (← links)
- Correlated pseudorandomness from the hardness of quasi-abelian decoding (Q6190123) (← links)