A C implementation of elliptic-curve-based Direct Anonymous Attestation (DAA) signatures. Created to support the Xaptum Edge Network Fabric, an IoT Network Solution.
elliptic-curve cryptography
Library providing mathematical basics for (pairing-based) cryptography.
PyFE4AI is a research-oriented Python library for functional encryption in trustworthy AI systems.
Fast Ciphertext-Policy Attribute-Based Encryption (CP-ABE) for Java
An implementations of different aggregate signature schemes using the MCL pairings library
Browser-based ciphertext-policy ABE demo — FAME (Agrawal and Chase, CCS 2017) over Type-3 BLS12-381, access trees converted to LSSS/MSP, ABE as a KEM into HKDF-SHA-256 and AES-256-GCM. Two users whose attributes jointly satisfy the policy pool their keys and still fail to decrypt.
Repository for my MSc Thesis (Aarhus University)
Functional encryption in Rust: function-hiding inner-product and quadratic FE schemes.
Browser-based randomness-beacon demo — recompute real NIST Beacon 2.0 pulses byte by byte, walk their SHA-512 hash chain and skiplist, verify drand rounds with a BLS12-381 pairing, and see what no check proves: whether the operator knew the value first.
C++ library for prototyping pairing-based cryptography on RELIC.
Header-only C++ pairing-based functional encryption: function-hiding inner-product and quadratic FE schemes built on LibRBP.
Browser-based proxy re-encryption demo — BBS98 (Blaze-Bleumer-Strauss 1998) ElGamal bidirectional, then AFGH (Ateniese-Fu-Green-Hohenberger, NDSS 2005) pairing-based on BLS12-381. Proxy and Bob collude under BBS98 and divide out Alice's private key; AFGH resists it, and neither can un-delegate.
Pairing-based functional encryption in CUDA: function-hiding inner-product and quadratic FE schemes, batched on NVIDIA GPUs.
Timelock encryption in Go — messages that cannot be decrypted until a chosen time, enforced by drand beacons and BLS12-381 IBE, not by a server.
Browser-based SM9 identity-based cryptography — signature, key exchange and encryption side by side, with keys extracted from a name by exponent inversion, two master key pairs in mirrored pairing groups, nonce-reuse recovery of a key point rather than a scalar, and the KGC reading everyone's mail
Browser-based beacon timelock encryption — time-lock puzzles, VDFs, and drand-style IBE release side by side, with Boneh–Franklin FullIdent on BLS12-381, a live decryption of a real drand tlock ciphertext, nine attacks against the decryptor, and an adversary slider showing that a million times more hardware still opens at the same second
Browser-based Boneh-Franklin Identity-Based Encryption demo implementing the 2001 BasicIdent scheme with BLS12-381 pairings via @noble/curves. Setup → Extract → Encrypt → Decrypt with the key-escrow tradeoff shown honestly.
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.
Functional encryption in Go: function-hiding inner-product and quadratic FE schemes.
To associate your repository with the pairing-based-cryptography topic, visit your repo's landing page and select "manage topics."