Low-communication multiparty triple generation for SPDZ from ring-LPN
From MaRDI portal
Publication:5087258
Recommendations
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Better preprocessing for secure multiparty computation
- Secure multiparty computation with sublinear preprocessing
Cites work
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- A new approach to practical active-secure two-party computation
- Distributed Point Functions and Their Applications
- Efficient 3-party distributed ORAM
- Efficient pseudorandom correlation generators: silent OT extension and more
- Fully homomorphic SIMD operations
- Function secret sharing
- Low-communication multiparty triple generation for SPDZ from ring-LPN
- Multiparty Computation from Somewhat Homomorphic Encryption
- Overdrive: making SPDZ great again
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
Cited in
(6)- The hardness of LPN over any integer ring and field for PCG applications
- Secure multiparty computation with sublinear preprocessing
- Low-communication multiparty triple generation for SPDZ from ring-LPN
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Actively secure setup for SPDZ
This page was built for publication: Low-communication multiparty triple generation for SPDZ from ring-LPN
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087258)