Search Constraints

Start Over
Filtering by: Creator Nielsen, Jesper Raakjær Remove constraint Creator: Nielsen, Jesper Raakjær Committee Member Borradaile, Glencora Remove constraint Committee Member: Borradaile, Glencora

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

  • Characterizing Server Compromise: Resilience Models, Instantiations, and Impossibilities

    Creator:
    McQuoid, Ian M.
    Abstract:
    One of the pervasive problems arising in our modern, digital world surrounds data breaches where an adversary, through zero-day exploitations, phishing, or old-fashioned social engineering attacks, gains access to a service’s data stores. Our society increasingly relies on these cloud-based services for everything from our taxes to personal communication. As...
    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