Skip to main content

Table 4 Second solution (w/o polynomials, no thread limit)

From: Privacy-preserving record linkage in large databases using secure multiparty computation

Housekeeping (avg per client)

0.28 s

Encrypting the hashes (avg per client)

6.3 s

Shuffling the encrypted hashes (avg per client)

0.50 s

Detecting duplicates (min of 1000 clients)

20 s

Detecting duplicates (max of 1000 clients)

40 s

Total (1000 clients)

11 h 20 m