Skip to main content
Fig. 2 | Algorithms for Molecular Biology

Fig. 2

From: Efficient privacy-preserving variable-length substring match for genome sequence

Fig. 2

Schematic view of our goal and model. (0) Server (DB holder) distributes Beaver triples. (A reliable third party can serve as the trusted initializer instead.) (1) Server distributes shares of the database. (2) User (query holder) distributes shares of the query. (3) The computing nodes jointly calculate shares of the result. (4) The results are sent to User. The offline phase is (0), DB preparation phase is (1), and Search phase consists of (2)–(4)

Back to article page