Pages that link to "Item:Q2096531"
From MaRDI portal
The following pages link to Efficient pseudorandom correlation generators from ring-LPN (Q2096531):
Displaying 30 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)
- SPRING: Fast Pseudorandom Functions from Rounded Ring Products (Q2946902) (← links)
- Fast Time-Recursive Block Correlators for Pseudorandom Sequences (Q4956806) (← links)
- Sok: vector OLE-based zero-knowledge protocols (Q6063131) (← 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)
- Group Structure in Correlations and Its Applications in Cryptography. (Q6107248) (← 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)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260) (← links)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)
- Maliciously Secure Multi-party PSI with Lower Bandwidth and Faster Computation (Q6487351) (← links)
- Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography (Q6595926) (← links)
- Toward malicious constant-rate 2PC via arithmetic garbling (Q6637552) (← links)
- The hardness of LPN over any integer ring and field for PCG applications (Q6637566) (← links)
- Two-round maliciously-secure oblivious transfer with optimal rate (Q6637571) (← links)
- Lossy cryptography from code-based assumptions (Q6652889) (← links)
- Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks (Q6652985) (← links)
- Cheater identification on a budget: MPC with identifiable abort from pairwise MACs (Q6653036) (← links)
