Can California's DROP avoid hash-based linkage leaks, or does it need PSI like the paper says?
trending4
01 02 PSOs as fast as PSI: Efficient Private Set Operations from Batch Homomorphic OKVS Decoding eprint.iacr.orgPSOs at PSI speed, by swapping curve tricks for RLWE OKVS decoding and batching the whole mess.03 Fixes FLPSI's soundness bug by making the homomorphic matching composable, so false accepts don't pile up with database size.04 Paper on homomorphic matching for fuzzy labeled PSI at scale, flags a soundness gap and patches it with CSTPSI. Naturally, math bites.