NillionNetwork/nada-by-example

Oblivious Shuffling

Open

#27 opened on Aug 26, 2024

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

Repository metrics

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

Description

Request a New Nada Example

Obliviously shuffle an array/list.

Description

Given an array/list as input, create a function that outputs a shuffled version of the array. One approach could be to use the Benes network.

Specific Requirements

For example in a list of SecretIntegers [1, 2, 3, 4, 5], a possible output could be [2, 5, 1, 3, 4].

Additional Context

Optional: Additionally, provide a secret permutation array and shuffle based on the permutation array.

Useful links:

Contributor guide

Research direction
Implement an oblivious shuffle using a Benes network or a random permutation generated by SecretInteger.random(). Study the existing random number example and linear scan example for encrypted comparisons.
Tech stack
python
Domain
cryptography
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.
Half day
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
NadaSecure multiparty computation basics
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
70