AB-IPFE gets a two-level hierarchy, plus pairing-based adaptive-secure constructions for expressive access control.

Logarithmic signatures for multi-signer stats, because linear homomorphic signatures apparently weren't niche enough.

Generalizes Tate pairings via curve endomorphisms and cohomology, then proves perfectness for abelian varieties over any field.

A critique of a 2023 dedup scheme that mixes RSA exponentiation with pairings, so the tag-matching story collapses.

How does Groth16 turn R1CS into a pairing check without the usual algebra handwaving?