- From: Phillipp Schoppmann via GitHub <sysbot+gh@w3.org>
- Date: Fri, 02 Jun 2023 20:26:55 +0000
- To: public-patcg@w3.org
schoppmp has just created a new issue for https://github.com/patcg/meetings: == Agenda Request - Malicious Partitioning Without Sorting == ## Agenda+: What do you want to discuss? I would like to present a protocol that aims to solve partitioning / sharding for IPA. This is related to several issues in the IPA repository (see links below). A draft can be found [here](https://docs.google.com/document/d/1-CUBMH3YCXnn0c6EDeBQ31Fw9T1ESYVgbYlyK4MelBY/edit?resourcekey=0-zwgbY2pJ06Sp4D_viQp02g). The high-level idea is to have the three servers repeatedly add "dummy" ciphertexts together with local shuffling and ciphertext rerandomization. There a two variants of our protocol: One maps the inputs to a small pseudorandom domain of size equal to the number of shards. The advantage here is that only very few dummy contributions are needed. The second one allows for a large pseudorandom domain. We think this one is of particular interest to IPA, since it would allow aligning events with the same match key *in the clear*, thus reducing the amount of sorting that needs to be done in MPC in each partition. ## Time 20 minutes presentation, 25 minutes discussion ### Links Protocols to be discussed: https://docs.google.com/document/d/1-CUBMH3YCXnn0c6EDeBQ31Fw9T1ESYVgbYlyK4MelBY/edit?resourcekey=0-zwgbY2pJ06Sp4D_viQp02g Related issues: https://github.com/patcg-individual-drafts/ipa/issues/35, https://github.com/patcg-individual-drafts/ipa/issues/49, and https://github.com/patcg-individual-drafts/ipa/issues/75 Please view or discuss this issue at https://github.com/patcg/meetings/issues/125 using your GitHub account -- Sent via github-notify-ml as configured in https://github.com/w3c/github-notify-ml-config
Received on Friday, 2 June 2023 20:26:57 UTC