Verifiable Privacy-Preserving Member and Order Queries on a List
Esha Ghosh, Olga Ohrimenko, Roberto Tamassia

TL;DR
This paper presents a formal model and an efficient cryptographic construction for privacy-preserving authenticated lists that support secure membership and order queries in cloud environments.
Contribution
It introduces a novel formal model and a bilinear accumulator-based construction for privacy-preserving authenticated lists with proven security guarantees.
Findings
Construction is efficient and practical.
Ensures data integrity and privacy in cloud list queries.
Security is proven under standard cryptographic assumptions.
Abstract
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 where data integrity and privacy have to be maintained. We then present an efficient construction of privacy-preserving authenticated lists based on bilinear accumulators and bilinear maps, analyze the performance, and prove the integrity and privacy of this construction under widely accepted assumptions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Privacy-Preserving Technologies in Data · Access Control and Trust
