google / google/private-join-and-compute
[Question] Identifier set intersection
- Dominant language
- C++
- Stars
- 856
- Forks
- 163
- PR merge metrics
- No merged PRs in 30d
Description
I am new to the concept of private computation and join but super excited about what that looks in the future and what it can mean for small businesses down the road.
Would it be possible to have a Set of values when doing the intersection?
Something like this, for example:
Dataset 1
Name | Phone
-- | --
Ruby | 111-111-2222
Ada | 333-333-3333
Alexander | 444-444-4444
Mika |
Dataset 2
Name | Phone | Associated Values
-- | -- | --
Ruby | 111-111-2222 | 10
Mike | 555-555-5555 | 30
Alex | 444-444-4444 | 30
Ideally, I would like this to return 2 matches: Ruby (matches on both Name and Phone) and Alex (matches on Phone).
Thank you for any help!
Contributor guide
Research direction
No file, test, or entry point is named. Start by reading the repository's existing private-join and intersection interfaces, then determine whether set-valued identifiers and matching on either Name or Phone are supported; done should be a maintainer-confirmed interface and behavior for the example matches.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- cryptography
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100