scientific article; zbMATH DE number 7650132

DOI10.4230/LIPIcs.APPROX-RANDOM.2019.65MaRDI QIDQ5875525

Mohammad Zaheri, Amos Beimel, Kobbi Nissim

Publication date: 3 February 2023

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

differential privacyoblivious RAMgraph property testingdifferential obliviousness

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

A theory of composition for differential obliviousness

Cites Work

• Optimal aggregation algorithms for middleware.
• Yes, there is an oblivious RAM lower bound!
• Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
• Data-Oblivious Graph Algorithms in Outsourced External Memory
• Property testing and its connection to learning and approximation
• Software protection and simulation on oblivious RAMs
• Can We Overcome the n log n Barrier for Oblivious Sorting?
• Foundations of Differentially Oblivious Algorithms
• Zig-zag sort
• Introduction to Property Testing
• Theory of Cryptography
• Efficient testing of large graphs
• Property testing in bounded degree graphs

This page was built for publication: