Zombie: Middleboxes that Don’t Snoop
Talkat 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI '24) · 2024-04-16..04-18·
summary
Claims the first practical system implementing zero-knowledge middleboxes, built as Zombie and evaluated on DNS filtering, that cuts client and middlebox overhead by ≈3.5× and lowers critical-path latency to under 300 ms or to 0 ms in an asynchronous mode. It pushes heavy proof work into preprocessing, batches client messages to boost middlebox verification throughput by about 5×, and supplies a portfolio of regex-encoding techniques for richer policies; overall results show near-practical performance on commodity hardware.
AI-written summary · about
chapters (9)
- 0:00Privacy vs policy enforcement
- 1:21Zero-knowledge middleboxes
- 2:26Latency in proof production
- 3:51Optimizing Zombie cryptographically
- 6:00Pre-computation for lower latency
- 7:28Batching proofs for throughput
- 9:14Zombie's optimizations practicality
- 11:43Future directions
- 12:26Q&A
related talks
35mEfficient Zero Knowledge Protocols: The Modular Approach
44mZero Knowledge Architecture
22mTowards a Secure Zero-rating Framework with Three Parties
51mPanel: Zero Knowledge in the Enterprise
44mZero-Knowledge Proofs: Simultaneously ensuring integrity and privacy
30mPractical Zero Knowledge Proofs
34mSNARKs and their Practical Applications
21mZero-Knowledge Proofs and Self Sovereign Identity