187 citations
- Carnegie Mellon UniversityUS2 papers
- Microsoft (United States)US2 papers
- Baidu (China)CN1 paper
- Bar-Ilan UniversityIL1 paper
- Ben-Gurion University of the NegevIL1 paper
- Concern Worldwide UKGB1 paper
- Concern Worldwide USUS1 paper
- Cornell UniversityUS1 paper
- ETH ZurichCH1 paper
- FORTH Institute of Computer ScienceGR1 paper
- Georgia Institute of TechnologyUS1 paper
- Hewlett Packard Enterprise (United States)US1 paper
4 papers · 1 filter
AnchorHash: A Scalable Consistent Hash
Gal Mendelson, Shay Vargaftik, Katherine Barabash +3
Consistent hashing (CH) is a central building block in many networking applications, from datacenter load-balancing to distributed storage. Unfortunately, state-of-the-art CH solut…
sAVSS: Scalable Asynchronous Verifiable Secret Sharing in BFT Protocols
Soumya Basu, Alin Tomescu, Ittai Abraham +3
This paper introduces a new way to incorporate verifiable secret sharing (VSS) schemes into Byzantine Fault Tolerance (BFT) protocols. This technique extends the threshold guarante…
Efficient Anomaly Detection via Matrix Sketching
Vatsal Sharan, Parikshit Gopalan, Udi Wieder
We consider the problem of finding anomalies in high-dimensional data using popular PCA based anomaly scores. The naive algorithms for computing these scores explicitly compute the…
Stable and Consistent Membership at Scale with Rapid
Lalith Suresh, Dahlia Malkhi, Parikshit Gopalan +2
We present the design and evaluation of Rapid, a distributed membership service. At Rapid's core is a scheme for multi-process cut detection (CD) that revolves around two key insig…