Data structures meet cryptography: 3SUM with preprocessing

Alexander Golovnev
Alexander Golovnev
Siyao Guo
Siyao Guo

STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing Chicago IL USA June, 2020, pp. 294-307, 2020.

Cited by: 0|Bibtex|Views36|DOI:https://doi.org/10.1145/3357713.3384342
EI
Other Links: dl.acm.org|dblp.uni-trier.de|academic.microsoft.com

Abstract:

This paper shows several connections between data structure problems and cryptography against preprocessing attacks. Our results span data structure upper bounds, cryptographic applications, and data structure lower bounds, as summarized next. First, we apply Fiat-Naor inversion, a technique with cryptographic origins, to obtain a data ...More

Code:

Data:

Your rating :
0

 

Tags
Comments