Is There an Oblivious RAM Lower Bound?
From MaRDI portal
Publication:2800584
DOI10.1145/2840728.2840761zbMath1334.94064MaRDI QIDQ2800584
Publication date: 15 April 2016
Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2840728.2840761
68P10: Searching and sorting
94A60: Cryptography
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)