Skip to Main content Skip to Navigation
New interface


hal-03800650v1  Conference papers
Mark AbspoelThomas AttemaMatthieu Rambaud. Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders
PODC '21: ACM Symposium on Principles of Distributed Computing, Jul 2021, Virtual Event Italy, France. pp.195-198, ⟨10.1145/3465084.3467953⟩
hal-02287379v1  Conference papers
Matthieu Rambaud. optimal Chudnovsky Chudnovsky multiplication algorithms
WAIFI 2014, Jul 2015, gebze, Turkey
...
hal-03022599v1  Journal articles
Gerard MemmiMatthieu Rambaud. Note sur la cryptanalyse de Diffie-Hellman
Génie logiciel : le magazine de l'ingénierie du logiciel et des systèmes, 2017
hal-01318315v1  Book sections
Stéphane BalletJulia PieltantMatthieu RambaudJeroen Sijsling. On some bounds for symmetric tensor rank of multiplication in finite fields
Alp Bassa, Alain Couvreur and David Kohel. ARITHMETIC, GEOMETRY, CRYPTOGRAPHY AND CODING THEORY, 686, AMER MATHEMATICAL SOC, pp.93 - 121, 2017, Contemporary Mathematics, 978-1-4704-2810-5. ⟨10.1090/conm/686/13779⟩
hal-02287591v1  Journal articles
Matthieu RambaudGérard Memmi. Note sur la cryptanalyse de Diffie-Hellman
Génie Logiiel, 2017, 120, pp.56-60
hal-03800630v1  Book sections
Thomas AttemaRonald CramerMatthieu Rambaud. Compressed Σ-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
Advances in Cryptology – ASIACRYPT 2021, 13093, Springer International Publishing, pp.526-556, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-92068-5_18⟩
hal-03800662v1  Book sections
Mark AbspoelRonald CramerIvan DamgårdDaniel EscuderoMatthieu Rambaud et al.  Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/pkZ
Advances in Cryptology – ASIACRYPT 2020, 12493, Springer International Publishing, pp.151-180, 2020, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-64840-4_6⟩
hal-03800642v1  Book sections
Ronald CramerMatthieu RambaudChaoping Xing. Asymptotically-Good Arithmetic Secret Sharing over Z/pℓZ with Strong Multiplication and Its Applications to Efficient MPC
Advances in Cryptology – CRYPTO 2021, 12827, Springer International Publishing, pp.656-686, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-84252-9_22⟩