Foundations of differentially oblivious algorithms

DOI10.1137/1.9781611975482.150MaRDI QIDQ5236339zbMATH OpenOpenAlexFDO

Authors T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi

Publication date 15 October 2019

Published in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975482.150

Mathematics Subject Classification ID

Data structures (68P05) Privacy of data (68P27)

Recommendations

• Locality-preserving oblivious RAM
• Locality-preserving oblivious RAM
• Data-oblivious data structures
• Lower bounds for differentially private RAMs
• Oblivious RAM Revisited

Cited in

(15)

• Spreading the privacy blanket: differentially oblivious shuffling for differential privacy
• Lower bounds for differentially private RAMs
• Data-oblivious data structures
• Cache-oblivious and data-oblivious sorting and applications
• scientific article; zbMATH DE number 7650132 (Why is no real title available?)
• Foundations of Differentially Oblivious Algorithms
• Locality-preserving oblivious RAM
• A theory of composition for differential obliviousness
• Lower bound framework for differentially private and oblivious data structures
• Analysis and prevention of averaging attacks against obfuscation protocols
• Advanced composition theorems for differential obliviousness
• Fast ORAM with server-aided preprocessing and pragmatic privacy-efficiency trade-off
• Differentially oblivious Turing machines
• Optimal oblivious algorithms for multi-way joins
• On the privacy of sublinear-communication Jaccard index estimation via min-hash

This page was built for publication: Foundations of differentially oblivious algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236339)