Quantum Advantage for Two-Party Differential Privacy
A quantum protocol estimates two-party Hamming distance with constant information-theoretic differential-privacy error, beating classical square-root limits.
2 stories, newest first · one card per story
A quantum protocol estimates two-party Hamming distance with constant information-theoretic differential-privacy error, beating classical square-root limits.
A batched GPU Paillier client computes Hamming distance on encrypted 512-bit embeddings at high throughput.
Today 1.6K readers · 2.5K views · 779 reads · all time 189K views