Posts

Showing posts with the label privacy

Oblivious Paxos: Privacy-Preserving Consensus Over Secret-Shares

Image
This paper appeared in SOCC'23. The paper presents a primary-backup secret-shared state machine (PBSSM) architecture and the associated consensus protocol, Oblivious Paxos (OPaxos). OPaxos enables privacy-preserving consensus by allowing acceptors to safely and consistently agree on a secret-shared value without untrusted acceptors knowing the value. OPaxos protocol overview OPaxos uses (t, n) threshold secret-sharing. This means generating n secret-shares from a single secret value such that it is possible to reconstruct the secret with just t shares. In order to make (t, n) threshold secret-sharing play well with Paxos, the protocol requires that the cardinality of the intersection of any phase1 quorum and phase2 quorum is larger than t.  This can be achieved by choosing the quorum size as (n+t)/2. More accurately,  one quorum (say phase1) would have cardinality as the ceiling of (n+t)/2, and the other quorum (phase2) would have cardinality as floor of this (n+t)/2. The ...

Popular posts from this blog

Hints for Distributed Systems Design

The F word

TLA+ modeling tips

Foundational distributed systems papers

Optimize for momentum

The Agentic Self: Parallels Between AI and Self-Improvement

Learning about distributed systems: where to start?

Advice to the young

Cloudspecs: Cloud Hardware Evolution Through the Looking Glass

My Time at MIT