Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm

DOI10.1007/978-3-030-26834-3_5MaRDI QIDQ6488932

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

Publication date: 14 March 2024

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• Encryption switching protocols revisited: switching modulo \(p\)
• Efficient covert two-party computation
• On the message complexity of secure multiparty computation
• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
• Gaussian elimination is not optimal
• A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
• How to share a secret
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Foundations of Cryptography
• How to Simulate It – A Tutorial on the Simulation Proof Technique
• Secure Multiparty Computation and Secret Sharing

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