Distributional Secure Merge

ePrint Report: Distributional Secure Merge

Gayathri Garimella, Srinivasan Raghuramam, Peter Rindal

Secure merge refers to the problem of merging two sorted lists. The problem appears in different settings where each list is held by one of two parties, or the lists are themselves shared among two or more parties. The output of a secure merge protocol is secret shared. Each variant of the problem offers many useful applications.


The difficulty in designing secure merge protocols vis-a-vis insecure merge protocols (which …

eprint report list lists merge parties peter problem protocol report settings shared