Pages that link to "Item:Q2175917"
From MaRDI portal
The following pages link to Secure computation with preprocessing via function secret sharing (Q2175917):
Displaying 13 items.
- Recent advances in function and homomorphic secret sharing (invited talk) (Q1746821) (← links)
- Function secret sharing for mixed-mode and fixed-point secure computation (Q2056774) (← links)
- A geometric approach to homomorphic secret sharing (Q2061949) (← links)
- Efficient pseudorandom correlation generators from ring-LPN (Q2096531) (← links)
- Improved primitives for MPC over mixed arithmetic-binary circuits (Q2096551) (← links)
- Sublinear GMW-style compiler for MPC with preprocessing (Q2128572) (← links)
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications (Q2139646) (← links)
- Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
- Secure two-party input-size reduction: challenges, solutions and applications (Q6081302) (← links)
- Programmable distributed point functions (Q6111543) (← links)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)
- An algebraic framework for silent preprocessing with trustless setup and active security (Q6166960) (← links)
- Explicit and nearly tight lower bound for 2-party perfectly secure FSS (Q6535135) (← links)
