Matthieu Rambaud

According to our database, Matthieu Rambaud authored at least 19 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

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

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

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

Matthieu Rambaud, Antoine Urban

IACR Cryptol. ePrint Arch., 2022

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

Katarzyna Kapusta, Matthieu Rambaud, Ferdinand Sibleyras

IACR Cryptol. ePrint Arch., 2022

Linear View Change in Optimistically Fast BFT.

Matthieu Rambaud, Andrei Tonkikh, Mark Abspoel

Proceedings of the 2022 ACM Workshop on Developments in Consensus, 2022

2021

Almost-Asynchronous MPC under Honest Majority, Revisited.

Matthieu Rambaud, Antoine Urban

IACR Cryptol. ePrint Arch., 2021

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

Mark Abspoel, Thomas Attema, Matthieu Rambaud

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 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

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

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

Thomas Attema, Ronald Cramer, Matthieu Rambaud

Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020

Malicious Security Comes for Free in Consensus with Leaders.

Matthieu Rambaud

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

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, Matthieu Rambaud, Chaoping Xing, Chen Yuan

IACR Cryptol. ePrint Arch., 2020

Revisiting Shared Data Protection Against Key Exposure.

Katarzyna Kapusta, Matthieu Rambaud, Gérard Memmi

Proceedings of the ASIA CCS '20: The 15th ACM Asia Conference on Computer and Communications Security, 2020

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, Matthieu Rambaud, Chaoping Xing, Chen Yuan

Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

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

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

Circular All-Or-Nothing: Revisiting Data Protection Against Key Exposure.

Katarzyna Kapusta, Gérard Memmi, Matthieu Rambaud

CoRR, 2019

2016

On some bounds for symmetric tensor rank of multiplication in finite fields.

Stéphane Ballet, Julia Pieltant, Matthieu Rambaud

CoRR, 2016

2014

Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms.

Matthieu Rambaud

Proceedings of the Arithmetic of Finite Fields - 5th International Workshop, 2014