NillionNetwork/nada-by-example

Secure Set Intersection

Open

#6 opened on Aug 13, 2024

View on GitHubContributor guide
 (0 comments) (0 reactions) (0 assignees)Python (10 forks)auto 404
enhancementgood first issuehacktoberfesthelp wanted

Repository metrics

Stars
 (11 stars)
PR merge metrics
 (PR metrics pending)

Description

Request a New Nada Example

Description

Compute the intersection of lists of SecretInteger Inputs held by different parties without revealing the lists themselves.

Use Case

Useful in collaborative filtering, private matching, or secure data sharing scenarios.

Specific Requirements

  • Inputs are SecretInteger lists from at least 2 parties
  • Outputs are the common integer values

Contributor guide

Research direction
Study existing Nada examples in the repository to understand the pattern. Then implement a secure set intersection using SecretInteger lists and the Nada library's comparison operations.
Tech stack
python
Domain
security
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-2 days
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Fresh
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
Git
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
60