Oblivious Stash Shuffle
Petros Maniatis, Ilya Mironov, Kunal Talwar
TL;DR
This paper revisits the Stash Shuffle, providing a restatement and formal security proof to enhance understanding and confidence in its privacy guarantees.
Contribution
It offers a formal restatement and security proof of the Stash Shuffle, clarifying its security properties and theoretical foundations.
Findings
Security of the Stash Shuffle is formally proven.
Restatement clarifies the shuffle's privacy guarantees.
Provides a solid theoretical foundation for the Stash Shuffle.
Abstract
This is a companion report to Bittau et al. We restate and prove security of the Stash Shuffle.
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
TopicsPrivacy-Preserving Technologies in Data · Cryptography and Data Security · Digital and Cyber Forensics