Browsing Theses by Subject "secure computation"
Now showing items 1-4 of 4
-
All-or-Nothing Private Record Linkage over Streaming Data
(University of Waterloo, 2022-05-24)The prevalence and increasing need for insights obtained from the collection of sensitive data gives rise to the problem of protecting the privacy of this data. The collection and storage of data can be distributed across ... -
Compilation Techniques for Actively Secure Mixed Mode Two Party Computation
(University of Waterloo, 2019-09-03)Secure multiparty computation allows two or more parties to compute a function without leaking unnecessary information about their inputs to other parties. In traditional secure multiparty computation protocols, the function ... -
Private Two-Party Random Minimum Spanning Forest Computation
(University of Waterloo, 2022-08-30)Finding the Minimum Spanning Tree, or more generally the Minimum Spanning Forest (MSF), of a weighted graph is a well-known algorithmic problem. While this problem itself can be directly applied to any kind of networks, ... -
SFour: A Protocol for Cryptographically Secure Record Linkage at Scale
(University of Waterloo, 2019-09-23)The prevalence of various (and increasingly large) datasets presents the challenging problem of discovering common entities dispersed across disparate datasets. Solutions to the private record linkage problem (PRL) aim to ...