default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthieu Rambaud
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Antoine Urban
, Matthieu Rambaud:
Robust Multiparty Computation from Threshold Encryption Based on RLWE. ISC (1) 2024: 294-314- [i15]Matthieu Rambaud, Christophe Levrat:
Practical Non-interactive Multi-signatures, and a Multi-to-Aggregate Signatures Compiler. IACR Cryptol. ePrint Arch. 2024: 1081 (2024) - [i14]Matthieu Rambaud:
Faster Asynchronous Blockchain Consensus and MVBA. IACR Cryptol. ePrint Arch. 2024: 1108 (2024) - [i13]Antoine Urban, Matthieu Rambaud:
Robust Multiparty Computation from Threshold Encryption Based on RLWE. IACR Cryptol. ePrint Arch. 2024: 1285 (2024) - 2023
- [i12]Matthieu Rambaud:
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: 1757 (2023) - 2022
- [c7]Matthieu Rambaud, Andrei Tonkikh, Mark Abspoel:
Linear View Change in Optimistically Fast BFT. ConsensusDay@CCS 2022: 67-78 - [i11]Antoine Urban, Matthieu Rambaud:
Share & Shrink: Ad-Hoc Threshold FHE with Short Ciphertexts and its Application to Almost-Asynchronous MPC. IACR Cryptol. ePrint Arch. 2022: 378 (2022) - [i10]Katarzyna Kapusta, Matthieu Rambaud, Ferdinand Sibleyras:
Constant Size Secret Sharing: with General Thresholds, Towards Standard Assumptions, and Applications. IACR Cryptol. ePrint Arch. 2022: 427 (2022) - [i9]Matthieu Rambaud, Antoine Urban:
Asynchronous Dynamic Proactive Secret Sharing under Honest Majority: Refreshing Without a Consistent View on Shares. IACR Cryptol. ePrint Arch. 2022: 619 (2022) - 2021
- [c6]Thomas Attema, Ronald Cramer, Matthieu Rambaud:
Compressed $\varSigma $-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures. ASIACRYPT (4) 2021: 526-556 - [c5]Ronald Cramer, Matthieu Rambaud, Chaoping Xing:
Asymptotically-Good Arithmetic Secret Sharing over $\mathbb {Z}/p^{\ell }\mathbb {Z}$ with Strong Multiplication and Its Applications to Efficient MPC. CRYPTO (3) 2021: 656-686 - [c4]Mark Abspoel, Thomas Attema, Matthieu Rambaud:
Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders. PODC 2021: 195-198 - [i8]Matthieu Rambaud, Antoine Urban:
Almost-Asynchronous MPC under Honest Majority, Revisited. IACR Cryptol. ePrint Arch. 2021: 503 (2021) - 2020
- [c3]Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan:
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $. ASIACRYPT (3) 2020: 151-180 - [c2]Katarzyna Kapusta, Matthieu Rambaud, Gérard Memmi:
Revisiting Shared Data Protection Against Key Exposure. AsiaCCS 2020: 165-177 - [i7]Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan:
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z. IACR Cryptol. ePrint Arch. 2020: 1256 (2020) - [i6]Thomas Attema, Ronald Cramer, Matthieu Rambaud:
Compressed Sigma-Protocols for Bilinear Circuits and Applications to Logarithmic-Sized Transparent Threshold Signature Schemes. IACR Cryptol. ePrint Arch. 2020: 1447 (2020) - [i5]Matthieu Rambaud:
Malicious Security Comes for Free in Consensus with Leaders. IACR Cryptol. ePrint Arch. 2020: 1480 (2020)
2010 – 2019
- 2019
- [i4]Katarzyna Kapusta, Gérard Memmi, Matthieu Rambaud:
Circular All-Or-Nothing: Revisiting Data Protection Against Key Exposure. CoRR abs/1901.08083 (2019) - [i3]Régis Blache, Alain Couvreur, Emmanuel Hallouin, David Madore, Jade Nardi, Matthieu Rambaud, Hugues Randriam:
Anticanonical codes from del Pezzo surfaces with Picard rank one. CoRR abs/1903.09397 (2019) - [i2]Ronald Cramer, Matthieu Rambaud, Chaoping Xing:
Asymptotically-Good Arithmetic Secret Sharing over Z/(p^\ell Z) with Strong Multiplication and Its Applications to Efficient MPC. IACR Cryptol. ePrint Arch. 2019: 832 (2019) - 2016
- [i1]Stéphane Ballet, Julia Pieltant, Matthieu Rambaud:
On some bounds for symmetric tensor rank of multiplication in finite fields. CoRR abs/1601.00126 (2016) - 2014
- [c1]Matthieu Rambaud:
Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms. WAIFI 2014: 45-60
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
