Low-communication multiparty triple generation for SPDZ from ring-LPN
From MaRDI portal
Publication:5087258
DOI10.1007/978-3-030-97121-2_9zbMATH Open1492.94052OpenAlexW4214775882MaRDI QIDQ5087258FDOQ5087258
Authors: Damiano Abram, Peter Scholl 
Publication date: 8 July 2022
Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-97121-2_9
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
- Multiparty Computation from Somewhat Homomorphic Encryption
- A new approach to practical active-secure two-party computation
- Fully homomorphic SIMD operations
- Title not available (Why is that?)
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Function secret sharing
- Overdrive: making SPDZ great again
- Distributed Point Functions and Their Applications
- Efficient 3-party distributed ORAM
- Efficient pseudorandom correlation generators: silent OT extension and more
- Low-communication multiparty triple generation for SPDZ from ring-LPN
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)
