M. Rambaud

发表

The latency costs of Optimistically fast output and of Strong unanimity, in authenticated leader-based Byzantine consensus under partial synchrony

M. Rambaud, Télécom Paris, 2020 .

On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry

M. Rambaud, H. Randriambololona, R. Rolland, 2011, 1906.07456.

Asymptotically-Good Arithmetic Secret Sharing over Z/pZ with Strong Multiplication and Its Applications to E cient MPC

R. Cramer, C. Xing, M. Rambaud, 2021 .

Compressed $\varSigma $-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures

Ronald Cramer, Matthieu Rambaud, Thomas Attema, 2021, ASIACRYPT.

Asynchronous Dynamic Proactive Secret Sharing under Honest Majority: Refreshing Without a Consistent View on Shares

M. Rambaud, Antoine Urban, 2022, IACR Cryptol. ePrint Arch..

Asymptotically-Good Arithmetic Secret Sharing over $\mathbb {Z}/p^{\ell }\mathbb {Z}$ with Strong Multiplication and Its Applications to Efficient MPC

Ronald Cramer, Chaoping Xing, Matthieu Rambaud, 2021, CRYPTO.

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z

Ivan Damgård, Ronald Cramer, Chaoping Xing, 2020, IACR Cryptol. ePrint Arch..

Collaborative learning from encrypted secrets

M. Rambaud, 2021 .

Linear View Change in Optimistically Fast BFT

Mark Abspoel, M. Rambaud, Andrei Tonkikh, 2022, Proceedings of the 2022 ACM Workshop on Developments in Consensus on ACM Workshop on Developments in Consensus.

Proactive Secret Sharing over Asynchronous Channels under Honest Majority (with Ephemeral Roles): Refreshing Without a Consistent View on Shares

M. Rambaud, 2022 .

Anticanonical codes from del Pezzo surfaces with Picard rank one pdf

Alain Couvreur, Hugues Randriam, Emmanuel Hallouin, 2019, Transactions of the American Mathematical Society.

Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders

Matthieu Rambaud, M. Rambaud, 2021, IACR Cryptol. ePrint Arch..

Proofs of non-Supermajority: the missing link for two-phase BFT with responsive view-change and linear complexity

M. Rambaud, Christophe Levrat, 2023 .

Constant Size Secret Sharing: with General Thresholds, Towards Standard Assumptions, and Applications

M. Rambaud, K. Kapusta, Ferdinand Sibleyras, 2022, IACR Cryptology ePrint Archive.

Revisiting Shared Data Protection Against Key Exposure

Katarzyna Kapusta, Matthieu Rambaud, Gerard Memmi, 2019, AsiaCCS.

Almost-Asynchronous MPC under Honest Majority, Revisited

Matthieu Rambaud, Antoine Urban, M. Rambaud, 2021, IACR Cryptol. ePrint Arch..

The Latency Costs of Optimism and of Strong Unanimity

M. Rambaud, 2021 .