Telecom ParisTech, Aces team
Email: matthieu.rambaud@telecom-paris...
- The latency costs of Optimistically fast output and of Strong unanimity, in authenticated leader-based Byzantine consensus under partial synchrony.
- On the communication complexity of authenticated leader-based Byzantine consensus under partial synchrony. Closing the gaps from quadratic to linear for: optimistically fast output, strong unanimity, and responsiveness with optimal latency, simultaneously (short arguments for disagreement).
- Closing the latency gap in deterministic BFT protocols with responsiveness and linear communication complexity.
- Lower bounds for authenticated randomized Byzantine consensus under (partial) synchrony: the limits of standalone digital signatures.
- Anticanonical codes from del Pezzo surfaces with Picard rank one. (with R. Blache, A. Couvreur, E. Hallouin, D. Madore, J. Nardi and H. Randriam). Accepted in Transactions of the AMS.
- Secret Sharing Made Faster. (joint work.)
- Asymptotically-Good Arithmetic Secret Sharing over Z/p^\ell Z with Strong Multiplication and Its Applications to Efficient MPC (with R. Cramer and C. Xing). (Multiplication friendly lifts of algebraic geometry codes over local rings)
Program (in Magma)
Elementary Lifting of Arithmetic Secret Sharing over Finite Fields to Local Rings, Its Limitations and Its Applications (joint work). (General theory of codes over local rings)
- Revisiting Shared Data Protection Against Key Exposure. (with K. Kapusta and G. Memmi). Accepted in AsiaCCS 2020.
- Thesis writeup, cover, half-page summary/résumé, 22pp-résumé en Français and presentation.
- Dense families of curves with many points of higher degree. Applications to multiplication. (Thesis work, still to be finished.)
- On some bounds for symmetric tensor rank of multiplication in finite fields (with S. Ballet, J. Pieltant and J. Sijsling). Proceedings of AGCT15 (AMS Contemp. Math. 2017). (& Counterexamples to descent of Shimura curves over their field of moduli.)
- Optimal Chudnovsky and Chudnovsky algorithms. errata , see thesis writeup I, II, VII & Appendix §2 instead. Proceedings of the WAIFI 2014. (& Bilinear complexity of multiplication in small algebras.)
- Dense families of curves with many points after field extension. Applications to multiplication. Slides (thesis defense version):
- ICSSEA (6/2017): Current issues in cryptography (broad audience). Slides.
- Toric surfaces (blackboard) and Toric codes (no slides but this reference). (For the ANR Manta, 2016/17).
- Optimal Chudnovsky and Chudnovsky algorithms. Transparencies inflicted to :
- The Workgroup VACHES (Variétés Abéliennes, Courbes hyperelliptiques et de Shimura).
Proofreadings (Or how to bomb one's name among famous researchers)