4 stories, newest first · one card per story
New lower bounds show random oracle cannot reduce online communication in information-theoretic MPC and that quantum-accessible oracles with classical communication yield no savings.
Entanglement-assisted three-party equality uses about 1.633n qubits, versus at least 3n without it.
Paper proves superlinear PSM lower bounds for symmetric Boolean functions and near-linear support-private upper bounds.
Theorists build a classical oracle where one-way puzzles fail yet EFI pairs survive, separating two candidate minimal assumptions of quantum cryptography.
Today 1.5K readers · 2.4K views · 757 reads · all time 189K views