19 citations · 47 across the 13 of their papers we have counts for
13 papers
The Price of Tailoring the Index to Your Data: Poisoning Attacks on Learned Index Structures
Evgenios M. Kornaropoulos, Silei Ren, Roberto Tamassia
The concept of learned index structures relies on the idea that the input-output functionality of a database index can be viewed as a prediction task and, thus, be implemented usin…
Verifiable Member and Order Queries on a List in Zero-Knowledge
Esha Ghosh, Olga Ohrimenko, Roberto Tamassia
We introduce a formal model for order queries on lists in zero knowledge in the traditional authenticated data structure model. We call this model Privacy-Preserving Authenticated…
Verifiable Privacy-Preserving Member and Order Queries on a List
Esha Ghosh, Olga Ohrimenko, Roberto Tamassia
We introduce a formal model for membership and order queries on privacy-preserving authenticated lists. In this model, the queries are performed on the list stored in the cloud whe…
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud
Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia +1
We present a simple, efficient, and secure data-oblivious randomized shuffle algorithm. This is the first secure data-oblivious shuffle that is not based on sorting. Our method can…
Haze: Privacy-Preserving Real-Time Traffic Statistics
Joshua Brown, Olga Ohrimenko, Roberto Tamassia
We consider traffic-update mobile applications that let users learn traffic conditions based on reports from other users. These applications are becoming increasingly popular (e.g.…
Data-Oblivious Graph Drawing Model and Algorithms
Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia
We study graph drawing in a cloud-computing context where data is stored externally and processed using a small local working storage. We show that a number of classic graph drawin…