Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm

DOI10.1007/978-3-030-26834-3_5MaRDI QIDQ6488932zbMATH OpenFDO

Authors Jean-Guillaume Dumas, Pascal Lafourcade, Julio López Fenner, David Lucas, Jean-Baptiste Orfila, Clément Pernet

Publication date 14 March 2024

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Network protocols (68M12)

Recommendations

• Maliciously secure matrix multiplication with applications to private deep learning
• A new secure matrix multiplication from ring-LWE
• Atomic Secure Multi-party Multiplication with Low Communication
• Theory of Cryptography
• Perfectly-Secure MPC with Linear Communication Complexity

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1303118 (Why is no real title available?)
• A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
• A practical algorithm for faster matrix multiplication
• Efficient covert two-party computation
• Encryption switching protocols revisited: switching modulo \(p\)
• Foundations of Cryptography
• Gaussian elimination is not optimal
• How to share a secret
• How to simulate it -- a tutorial on the simulation proof technique
• On the message complexity of secure multiparty computation
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Secure multiparty computation and secret sharing
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority

This page was built for publication: Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488932)