Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN

DOI10.1007/978-3-030-97121-2_9zbMath1492.94052OpenAlexW4214775882MaRDI QIDQ5087258

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

zbMATH Keywords

communication complexitysecure computationdistributed protocols

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (2)

Secure multiparty computation with sublinear preprocessing ⋮ Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN

Cites Work

• Unnamed Item
• Overdrive: making SPDZ great again
• Efficient 3-party distributed ORAM
• Efficient pseudorandom correlation generators: silent OT extension and more
• Fully homomorphic SIMD operations
• Multiparty Computation from Somewhat Homomorphic Encryption
• A New Approach to Practical Active-Secure Two-Party Computation
• Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
• Function Secret Sharing
• Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN
• Distributed Point Functions and Their Applications

This page was built for publication: Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN