Skip to content
#

unlinkability

Here are 12 public repositories matching this topic...

Maximal Linkability metric to evaluate the linkability of (protected) biometric templates. Paper: "Measuring Linkability of Protected Biometric Templates using Maximal Leakage", IEEE-TIFS, 2023.

  • Updated Jan 31, 2024
  • Python

Auditably privacy-preserving age verification with RFC 9474 RSA blind signatures. A relying party learns only the age predicate (over-13/18/…); the issuer never sees the nonce, token, or site; unlinkability is verifiable, not promised. Python uv workspace. Research prototype — unaudited.

  • Updated Oct 25, 2026
  • Python

Measures what verifiable unlinkability costs at agent action rates — and what breaks when the pre-computation pool runs out. Real BBS+ over BLS12-381, an Ed25519 baseline, and clearly-marked stubs. Supporting tool for P05.

  • Updated Aug 10, 2026
  • Rust

Browser-based Sphinx mix packet demo — Danezis and Goldberg, IEEE S&P 2009, over ristretto255 with LIONESS wide-block payload protection. Fixed-length headers, per-hop blinding, replay tags and tagging attacks across three mixes — then one sender on a quiet network is traced end to end with every check green.

  • Updated Oct 24, 2026
  • TypeScript

Browser-based BBS+ selective disclosure demo — BLS12-381 pairings. A signed credential is all-or-nothing: to prove one field you hand over the whole document. BBS+ proves knowledge of the issuer's signature while revealing only what you choose — and randomizes every presentation, so two showings are unlinkable. Revocation is the honest tension.

  • Updated Oct 22, 2026
  • TypeScript

Add this topic to your repo

To associate your repository with the unlinkability topic, visit your repo's landing page and select "manage topics."

Learn more