So Cramer’s rule is just Lagrange interpolation in disguise, and this note spells out the MPC/secret-sharing angle?

Can MPC handle weighted votes and changing committees? This preprint says yes, with malicious security and state handover.

Formalizes dead-man-switch crypto in UC, with constructions for post-mortem release or provable destruction of a lone secret.

Can secret replication turn PRFs into PCFs for VOLE-style triples? This paper says yes, with symmetric crypto only.

Fixes FLPSI's soundness bug by making the homomorphic matching composable, so false accepts don't pile up with database size.

How do you poison MCP when each tool looks harmless? Split the payload with Shamir and let the model reassemble it.

Need a Rust MPC toolkit where the same protocol runs in simulation or over mTLS? This repo does that, for research.

Tutorial on MPC with secret shares and Beaver triples, including the usual masked multiply and a toy restaurant example.

ArXiv paper on quantum encrypted cloning from secret-sharing access structures, because one clone per qualified set apparently wasn't eno...

New link between PIR share conversion and sparse decoding polynomials, with lower bounds that make the old matching-vector trick look qua...