19 citations · 47 across the 13 of their papers we have counts for
3 papers · 1 filter
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…