Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms. - Matthieu Rambaud (WAIFI, 2014)

On some bounds for symmetric tensor rank of multiplication in finite fields. - Stéphane Ballet; Julia Pieltant; Matthieu Rambaud (CoRR, 2016)

Circular All-Or-Nothing: Revisiting Data Protection Against Key Exposure. - Katarzyna Kapusta; Gérard Memmi; Matthieu Rambaud (CoRR, 2019)

Anticanonical codes from del Pezzo surfaces with Picard rank one. - Régis Blache; Alain Couvreur; Emmanuel Hallouin; David Madore; Jade Nardi; Matthieu Rambaud; Hugues Randriam (CoRR, 2019)

Asymptotically-Good Arithmetic Secret Sharing over Z/(p^ ell Z) with Strong Multiplication and Its Applications to Efficient MPC. - Ronald Cramer; Matthieu Rambaud; Chaoping Xing (IACR Cryptol. ePrint Arch., 2019)

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $ mathbb {Z}/p^k mathbb {Z} $. - Mark Abspoel; Ronald Cramer; Ivan Damgård; Daniel Escudero 001; Matthieu Rambaud; Chaoping Xing; Chen Yuan 003 (ASIACRYPT (3), 2020)

Revisiting Shared Data Protection Against Key Exposure. - Katarzyna Kapusta; Matthieu Rambaud; Gérard Memmi (AsiaCCS, 2020)

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z. - Mark Abspoel; Ronald Cramer; Ivan Damgård; Daniel Escudero 001; Matthieu Rambaud; Chaoping Xing; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2020)

Compressed Sigma-Protocols for Bilinear Circuits and Applications to Logarithmic-Sized Transparent Threshold Signature Schemes. - Thomas Attema; Ronald Cramer; Matthieu Rambaud (IACR Cryptol. ePrint Arch., 2020)

Malicious Security Comes for Free in Consensus with Leaders. - Matthieu Rambaud (IACR Cryptol. ePrint Arch., 2020)

Compressed $ varSigma $-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures. - Thomas Attema; Ronald Cramer; Matthieu Rambaud (ASIACRYPT (4), 2021)

Asymptotically-Good Arithmetic Secret Sharing over $ mathbb {Z}/p^{ ell } mathbb {Z}$ with Strong Multiplication and Its Applications to Efficient MPC. - Ronald Cramer; Matthieu Rambaud; Chaoping Xing (CRYPTO (3), 2021)

Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders. - Mark Abspoel; Thomas Attema; Matthieu Rambaud (PODC, 2021)

Almost-Asynchronous MPC under Honest Majority, Revisited. - Matthieu Rambaud; Antoine Urban (IACR Cryptol. ePrint Arch., 2021)

Linear View Change in Optimistically Fast BFT. - Matthieu Rambaud; Andrei Tonkikh; Mark Abspoel (ConsensusDay@CCS, 2022)

Constant Size Secret Sharing: with General Thresholds, Towards Standard Assumptions, and Applications. - Katarzyna Kapusta; Matthieu Rambaud; Ferdinand Sibleyras (IACR Cryptol. ePrint Arch., 2022)

Asynchronous Dynamic Proactive Secret Sharing under Honest Majority: Refreshing Without a Consistent View on Shares. - Matthieu Rambaud; Antoine Urban (IACR Cryptol. ePrint Arch., 2022)

Share & Shrink: Ad-Hoc Threshold FHE with Short Ciphertexts and its Application to Almost-Asynchronous MPC. - Antoine Urban; Matthieu Rambaud (IACR Cryptol. ePrint Arch., 2022)

Adaptively Secure Consensus with Linear Complexity and Constant Round under Honest Majority in the Bare PKI Model, and Separation Bounds from the Idealized Message-Authentication Model. - Matthieu Rambaud (IACR Cryptol. ePrint Arch., 2023)

Faster Asynchronous Blockchain Consensus and MVBA. - Matthieu Rambaud (IACR Cryptol. ePrint Arch., 2024)

Practical Non-interactive Multi-signatures, and a Multi-to-Aggregate Signatures Compiler. - Matthieu Rambaud; Christophe Levrat (IACR Cryptol. ePrint Arch., 2024)

Robust Multiparty Computation from Threshold Encryption Based on RLWE. - Antoine Urban; Matthieu Rambaud (IACR Cryptol. ePrint Arch., 2024)

Share&Shrink: Efficient and Delegatable MPC in One Broadcast then Asynchrony. - Antoine Urban; Matthieu Rambaud (ACNS (1), 2025)