Pages that link to "Item:Q2055713"
From MaRDI portal
The following pages link to Multi-key fully-homomorphic encryption in the plain model (Q2055713):
Displayed 12 items.
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Unbounded multi-party computation from learning with errors (Q2056765) (← links)
- Round-optimal and communication-efficient multiparty computation (Q2169992) (← links)
- Distributed (correlation) samplers: how to remove a trusted dealer in one round (Q2170033) (← links)
- SLAP: simpler, improved private stream aggregation from ring learning with errors (Q2693220) (← links)
- Partitioned searchable encryption (Q2697909) (← links)
- Reusable Two-Round MPC from LPN (Q5087256) (← links)
- Black-box reusable NISC with random oracles (Q6061353) (← links)
- A polynomial time algorithm for breaking NTRU encryption with multiple keys (Q6109713) (← links)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260) (← links)
- Reusable secure computation in the plain model (Q6186599) (← links)
- Security-preserving distributed samplers: how to generate any CRS in one round without random oracles (Q6186601) (← links)