Skip to main content

Verifiable Secret Sharing

A Huawei Hackathon team project combining Shamir sharing, Feldman verification, and hybrid encryption for efficient secret sharing.

GitHub
A secret is split into shares, verified, and reconstructed from a threshold of valid shares.

A three-person team project for the 2025 Huawei Hackathon software challenge, focused on verifiable secret sharing and its computational cost.

Sharing, verification, and reconstruction

Shamir secret sharing splits a secret into shares, with a threshold required for reconstruction. Feldman verification provides a way to check shares against commitments.

The project explores two optimization directions: using AES-GCM hybrid encryption for larger secrets, and reducing repeated work in batch share verification through aggregation and precomputation.

Experiments

The repository includes correctness tests, a demonstration application, and benchmark scripts. The figures below reproduce the recorded comparisons between the baseline and optimized implementations; the time axes use a logarithmic scale.

Recorded Shamir benchmark: split and recovery time, and total time, as secret size increases.

Recorded Feldman VSS benchmark: phase timings and total time across secret sizes.

The source repository documents the team, algorithms, benchmark setup, and full performance report.

Tools: Python, Shamir secret sharing, Feldman VSS, and AES-GCM.