|
Telecom Paris, Département Infres
Email: matthieu.rambaud@telecom-paris...
- Robust Multiparty Computation from Threshold Encryption Based on RLWE. (with Antoine Urban). ISC'24.
- Faster Asynchronous Blockchain Consensus and MVBA. Eprint.
- Practical Non-interactive Multi-Signatures, and a Multi-to-Aggregate Signatures Compiler. (with Christophe Levrat)
- 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. Slides for the 2023-11-03 UMD Crypto reading group
- Breaking the t<n/3 Consensus Bound: Asynchronous Dynamic Proactive Secret Sharing under Honest Majority. (with Christophe Levrat and Antoine Urban). Eprint.
- Linear View Change in Optimistically Fast BFT. (with Mark Abspoel and Andrei Tonkikh). ConsensusDay'22.
- Share & Shrink: Ad-Hoc Threshold FHE with Short Ciphertexts and its Application to Almost-Asynchronous MPC. (with Antoine Urban). Eprint.
- Almost-Asynchronous MPC under Honest Majority, Revisited. (with Antoine Urban). Eprint.
- Constant Size Secret Sharing: Cryptographic Assumptions, General Threshold, and Applications. (with Katarzyna Kapusta and Ferdinand Sibleyras)
- Compressed Sigma-Protocols for Bilinear Circuits and Applications to Logarithmic-Sized Transparent Threshold Signature Schemes (with Thomas Attema and Ronald Cramer). Asiacrypt'21 + unpublished section 7.
- Brief announcement: Malicious Security Comes for Free in Consensus with Leaders (with Mark Abspoel and Thomas Attema). Podc'21 short video, longer video
- Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z (with Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Chaoping Xing and Chen Yuan). Asiacrypt'20.
- Latency of 1–Message Fast Partially Synchronous Leader-Based Consensus: a Complete Characterization. (with Elena Berardini)
- Anticanonical codes from del Pezzo surfaces with Picard rank one. (with R. Blache, A. Couvreur, E. Hallouin, D. Madore, J. Nardi and H. Randriam). Transactions of the AMS 2020.
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry. (with Stéphane Ballet, Jean Chaumine, Julia Pieltant, Hugues Randriam and Robert Rolland). to appear in Russian Math Surveys.
- Asymptotically-Good Arithmetic Secret Sharing over Z/p^\ell Z with Strong Multiplication and Its Applications to Efficient MPC (with Ronald Cramer and Chaoping Xing). Crypto'21. (Multiplication friendly lifts of algebraic geometry codes over local rings. Please refer to the preprint version instead.)
Program (in Magma)
- Revisiting Shared Data Protection Against Key Exposure. (with Katarzyna Kapusta and Gérard Memmi). AsiaCCS 2020.
- Thesis Writeup (Please refer to Survey to appear in Russian Math Survey), Cover, half-page Summary & Résumé, 22pp-Résumé en Français and Presentation. Program for monodromy computation (in Magma), illustrated in §V.3.2.
- On some bounds for symmetric tensor rank of multiplication in finite fields (with S. Ballet, J. Pieltant and J. Sijsling). Proceedings of AGCT 2015 (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):
- 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).
Cryptographie appliquée