( en | de | ru )

 

Disambiguation of "Rambaud, Matthieu"

Author of the publication

copydeleteadd this publication to your clipboard
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z.

, , , , , , and . IACR Cryptol. ePrint Arch., (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Thierry Rambaud

Matthieu Saubanère

Matthieu Felsinger

Matthieu Hammer

Friedrich Matthieu

 

Other publications of authors with the same name

On some bounds for symmetric tensor rank of multiplication in finite fields., , and . CoRR, (2016)Compressed Sigma-Protocols for Bilinear Circuits and Applications to Logarithmic-Sized Transparent Threshold Signature Schemes., , and . IACR Cryptol. ePrint Arch., (2020)Anticanonical codes from del Pezzo surfaces with Picard rank one., , , , , , and . CoRR, (2019)Asymptotically-Good Arithmetic Secret Sharing over Z/(p^Z) with Strong Multiplication and Its Applications to Efficient MPC., , and . IACR Cryptology ePrint Archive, (2019)Circular All-Or-Nothing: Revisiting Data Protection Against Key Exposure., , and . CoRR, (2019)Malicious Security Comes for Free in Consensus with Leaders.. IACR Cryptol. ePrint Arch., (2020)Compressed $\varSigma $-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures., , and . ASIACRYPT (4), volume 13093 of Lecture Notes in Computer Science, page 526-556. Springer, (2021)Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders., , and . PODC, page 195-198. ACM, (2021)Asymptotically-Good Arithmetic Secret Sharing over $Z/p^Z$ with Strong Multiplication and Its Applications to Efficient MPC., , and . CRYPTO (3), volume 12827 of Lecture Notes in Computer Science, page 656-686. Springer, (2021)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.. IACR Cryptol. ePrint Arch., (2023)