google / google/private-join-and-compute
Questions about implementation
- Dominant language
- C++
- Stars
- 856
- Forks
- 163
- PR merge metrics
- No merged PRs in 30d
Description
After reading the paper [On Deploying Secure Computing: Private Intersection-Sum-with-Cardinality](https://ieeexplore.ieee.org/document/9230369) and I found there are three protocols.
**1. DDH-based Private Intersection-Sum Protocol
2. Randomized-OT based Private Intersection-Sum protocol
3. Encrypted-Bloom-Filter-based Intersection-Sum Protocol**
Since this repository only implements the DDH-based protocol, will there be other two implementations in the future?
Contributor guide
Research direction
Start with the linked paper and compare its three protocols with the repository's current DDH-based implementation. No files, tests, entry points, or acceptance criteria are identified, so the intended scope and definition of done require clarification before implementation.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- cryptography, security
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 15/100