Search Constraints

Start Over
Filtering by: Creator Nielsen, Jesper Raakjær Remove constraint Creator: Nielsen, Jesper Raakjær Advisor Rosulek, Mike Remove constraint Advisor: Rosulek, Mike

Search Results

  • Efficient Private Matching for Private Databases

    Creator:
    Trieu, Thi Ni Ni
    Abstract:
    Private matching (PM) is a key cryptographic primitive in secure computation that allows several parties to jointly compute some functions depending on their private inputs. Indeed, this primitive has many practical applications. For instance, in online advertising, two companies may wish to find their common customers for a joint marketing...
    Resource Type:
    Dissertation
    Full Text:
    strengthened and sped up by using OT extension. For example, Nielsen et al. [NNOB12] propose an approach to

  • Communication-Efficient Secure Two-Party Computation From Minicrypt and OT

    Creator:
    Roy, Lawrence
    Abstract:
    Secure two-party computation (2PC) is the task of performing arbitrary calculations on secret inputs provided by two parties, while maintaining secrecy if at least one party is honest. 2PC has been applied to privacy-preserving record linkage and machine learning, in areas such as medicine where maintaining privacy is crucial. One...
    Resource Type:
    Dissertation

  • Communication efficient private set and database operations

    Creator:
    Garimella, Gayathri Annapurna
    Abstract:
    Secure Computation is a powerful tool that enables a set of parties to jointly compute any function over their private inputs, without a trusted third party. Private Set Intersection is a specific case of two-party Secure Computation, where Alice (with private set X) and Bob (with private set Y) specifically...
    Resource Type:
    Dissertation