Skip to content

Back to the catalog

On Secure Sorting and Its Application to Privacy-Preserving Graph Pattern Matching
eprint.iacr.orgpaper

On Secure Sorting and Its Application to Privacy-Preserving Graph Pattern Matching

Marcel Keller's ePrint compares the two fully secure MPC sorting approaches, Quicksort (Araki et al., CCS'21) and radix sort (Asharov et al., CCS'22). The comparison covers a range of parameters, for both honest- and dishonest-majority settings. The paper then extends the sparse matrix multiplication of Damie et al. (CODASPY'26), which avoids oblivious RAM, so the output comes out in the same format as the inputs. That makes repeated multiplication of graph adjacency matrices possible, which the paper uses to find cycles and scatter-gather patterns associated with money laundering. The result is privacy-preserving anti-money-laundering detection.

TL;DR MPC paper comparing secure Quicksort and radix sort, then using sorting for sparse matrix multiplication to detect money-laundering graph patterns privately.
Open original ↗

Organisations named here

  • Marcel Keller
  • scatter-gather

Technologies named here

  • Quicksort-based secure sorting
  • Radix sort-based secure sorting

Techniques named here

  • Privacy-preserving anti-money laundering detection

Also named here

  • Araki et al.
  • Asharov et al.
  • Damie et al.

Related in other