In order to support the higher end of query sizes outlined in patcg/private-measurement: issue #21, it's almost certain that we will need a solution that horizontally scales. This presents some challenges in the IPA setting, as we would want to avoid a helper party learning which events land on which shard. Preventing this information leakage includes limiting information about the sizes of the shards, as well.
Issue #35 explores this in detail.
Time
This will take at least 30 min, potentially all 60.
Issue Link
If there is an open issue on the or a relevant repo associated with this agenda item, please link it here. If there is not yet an open issue, consider opening one as this issue will not persist after the meeting occurs.
Agenda+: IPA Sharding with Sensitivity Bounds
In order to support the higher end of query sizes outlined in patcg/private-measurement: issue #21, it's almost certain that we will need a solution that horizontally scales. This presents some challenges in the IPA setting, as we would want to avoid a helper party learning which events land on which shard. Preventing this information leakage includes limiting information about the sizes of the shards, as well.
Issue #35 explores this in detail.
Time
This will take at least 30 min, potentially all 60.
Issue Link
If there is an open issue on the or a relevant repo associated with this agenda item, please link it here. If there is not yet an open issue, consider opening one as this issue will not persist after the meeting occurs.
Other Links
35