Matthieu Rambaud

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 21

Top Topics

Linear Complexity

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Matthieu Rambaud
Faster Asynchronous Blockchain Consensus and MVBA. IACR Cryptol. ePrint Arch. 2024 (2024)
Antoine Urban, Matthieu Rambaud
Robust Multiparty Computation from Threshold Encryption Based on RLWE. IACR Cryptol. ePrint Arch. 2024 (2024)
Matthieu Rambaud, Christophe Levrat
Practical Non-interactive Multi-signatures, and a Multi-to-Aggregate Signatures Compiler. IACR Cryptol. ePrint Arch. 2024 (2024)
Matthieu Rambaud
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. IACR Cryptol. ePrint Arch. 2023 (2023)
Antoine Urban, Matthieu Rambaud
Share & Shrink: Ad-Hoc Threshold FHE with Short Ciphertexts and its Application to Almost-Asynchronous MPC. IACR Cryptol. ePrint Arch. 2022 (2022)
Matthieu Rambaud, Andrei Tonkikh, Mark Abspoel
Linear View Change in Optimistically Fast BFT. ConsensusDay@CCS (2022)
Matthieu Rambaud, Antoine Urban
Asynchronous Dynamic Proactive Secret Sharing under Honest Majority: Refreshing Without a Consistent View on Shares. IACR Cryptol. ePrint Arch. 2022 (2022)
Katarzyna Kapusta, Matthieu Rambaud, Ferdinand Sibleyras
Constant Size Secret Sharing: with General Thresholds, Towards Standard Assumptions, and Applications. IACR Cryptol. ePrint Arch. 2022 (2022)
Mark Abspoel, Thomas Attema, Matthieu Rambaud
Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders. PODC (2021)
Ronald Cramer, Matthieu Rambaud, Chaoping Xing
Asymptotically-Good Arithmetic Secret Sharing over $\mathbb {Z}/p^{\ell }\mathbb {Z}$ with Strong Multiplication and Its Applications to Efficient MPC. CRYPTO (3) (2021)
Matthieu Rambaud, Antoine Urban
Almost-Asynchronous MPC under Honest Majority, Revisited. IACR Cryptol. ePrint Arch. 2021 (2021)
Thomas Attema, Ronald Cramer, Matthieu Rambaud
Compressed $\varSigma $-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures. ASIACRYPT (4) (2021)
Katarzyna Kapusta, Matthieu Rambaud, Gérard Memmi
Revisiting Shared Data Protection Against Key Exposure. AsiaCCS (2020)
Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $. ASIACRYPT (3) (2020)
Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z. IACR Cryptol. ePrint Arch. 2020 (2020)
Thomas Attema, Ronald Cramer, Matthieu Rambaud
Compressed Sigma-Protocols for Bilinear Circuits and Applications to Logarithmic-Sized Transparent Threshold Signature Schemes. IACR Cryptol. ePrint Arch. 2020 (2020)
Matthieu Rambaud
Malicious Security Comes for Free in Consensus with Leaders. IACR Cryptol. ePrint Arch. 2020 (2020)
Ronald Cramer, Matthieu Rambaud, Chaoping Xing
Asymptotically-Good Arithmetic Secret Sharing over Z/(p^\ell Z) with Strong Multiplication and Its Applications to Efficient MPC. IACR Cryptol. ePrint Arch. 2019 (2019)
Régis Blache, Alain Couvreur, Emmanuel Hallouin, David Madore, Jade Nardi, Matthieu Rambaud, Hugues Randriam
Anticanonical codes from del Pezzo surfaces with Picard rank one. CoRR (2019)
Katarzyna Kapusta, Gérard Memmi, Matthieu Rambaud
Circular All-Or-Nothing: Revisiting Data Protection Against Key Exposure. CoRR (2019)
Stéphane Ballet, Julia Pieltant, Matthieu Rambaud
On some bounds for symmetric tensor rank of multiplication in finite fields. CoRR (2016)
Matthieu Rambaud
Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms. WAIFI (2014)