Browser-based proactive secret sharing demo — Herzberg-Jarecki-Krawczyk-Yung 1995. A threshold scheme stops an attacker who takes t shares at once, not one who takes them slowly. Reshare and every old share becomes garbage while the secret stays byte-identical. Real Shamir over GF(p) with Feldman commitments. No backends. No simulated math.
cryptography secret-sharing key-management shamir-secret-sharing threshold-cryptography verifiable-secret-sharing crypto-lab feldman-vss proactive-secret-sharing mobile-adversary
-
Updated
Oct 11, 2026 - TypeScript