Search Constraints

Start Over
Filtering by: Creator Slawin, Alexandra M. Remove constraint Creator: Slawin, Alexandra M. Committee Member Bobba, Rakesh Remove constraint Committee Member: Bobba, Rakesh

Search Results

  • New constructions and applications for homomorphic secret sharing and function secret sharing

    Creator:
    Singh, Jaspal
    Abstract:
    A secret sharing scheme allows a dealer to distribute a secret with a set of parties, such that only a certain subset of parties can collaborate and learn the shared secret. Traditional secret sharing schemes have been used as building blocks in various subdomains of cryptography. Recently, two new extensions...
    Resource Type:
    Dissertation
    Full Text:
    [CM20], where 1 − p is the false positive probability of a single-hash-function bloom filter of size m

  • 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
    Full Text:
    AN ABSTRACT OF THE DISSERTATION OF Ian M

  • 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
    Full Text:
    Outline of the Asymmetric Merge asym-SM(k, m) protocol. . . . . . . . . 146 LIST OF FIGURES (Continued

  • 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:
    parties, t dishonestly colluding, each with set size m; X is the domain of the element; and λ and κ are