Data structures meet cryptography: 3SUM with preprocessing

DOI10.1145/3357713.3384342OpenAlexW3034230220MaRDI QIDQ5144917

Sunoo Park, Vinod Vaikuntanathan, Siyao Guo, Alexander Golovnev, Thibaut Horel

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.08355

zbMATH Keywords

data structuresfine-grained complexitycryptography with preprocessing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (4)

The function-inversion problem: barriers and opportunities ⋮ Time and space efficient collinearity indexing ⋮ Revisiting time-space tradeoffs for function inversion ⋮ Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions

This page was built for publication: Data structures meet cryptography: 3SUM with preprocessing