Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm

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

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

Publication date: 14 March 2024

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

Mathematics Subject Classification ID

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

Cites Work

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

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)