You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In the last PATCG meeting, a discussion was raised about the use of MPC or TEE for aggregating the reports. I would like to take part in this group by comparing performances of both MPC and TEE in the attribution reporting case. It seems to be a consensus that MPC is better for privacy, but I would like to measure the execution time on a large dataset.
I have been through the IPA research prototype. MP-SPDZ seems powerful. Do you think MP-SPDZ is suitable for performance test?
I would like to try different sorting algorithms. Do you know any other one than the one you are implementing?
The text was updated successfully, but these errors were encountered:
There are many MPC sorting algorithms I'm familiar with.
We've been implementing the one from this paper: https://eprint.iacr.org/2019/695.pdf and the maliciously secure variant of this protocol that's soon to be published.
That paper references many other prior works that you can take a look at.
We understand that many people are using Quicksort (a secure variant of it) that seems to work well in practice.
In the last PATCG meeting, a discussion was raised about the use of MPC or TEE for aggregating the reports. I would like to take part in this group by comparing performances of both MPC and TEE in the attribution reporting case. It seems to be a consensus that MPC is better for privacy, but I would like to measure the execution time on a large dataset.
I have been through the IPA research prototype. MP-SPDZ seems powerful. Do you think MP-SPDZ is suitable for performance test?
I would like to try different sorting algorithms. Do you know any other one than the one you are implementing?
The text was updated successfully, but these errors were encountered: