Search Constraints

Start Over
Filtering by: Creator Nielsen, Jesper Raakjær Remove constraint Creator: Nielsen, Jesper Raakjær Degree Field Computer Science Remove constraint Degree Field: Computer Science

Search Results

  • Optimizing Cryptographic Obfuscation

    Creator:
    Carmer, Brent
    Abstract:
    Cryptographic obfuscation is a powerful tool that makes programs “unintelligible” yet still runnable. It essentially gives programs the ability to keep secrets. The practical applications of obfuscation range from keeping secrets in banking applications to preventing software theft to providing secure messaging applications. The cryptographic applications of obfuscation are also...
    Resource Type:
    Dissertation

  • Random access machine in secure multi-party computation

    Creator:
    Hu, Zhangxiang
    Abstract:
    Secure multi-party computation (MPC) is a conceptual framework in cryptography. It allows distrusting parties engage in a protocol to perform a computational task while still maintain some secure properties. Most existing approaches are required to interpret functions as a boolean circuit. With the recent state-of-art circuit garbling scheme, the performance...
    Resource Type:
    Masters Thesis

  • 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

  • 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

  • Keeping your Friends Secret: Improving the Security, Effciency and Usability of Private Set Intersection

    Creator:
    Rindal, Peter B.
    Abstract:
    Private set intersection (PSI) allows two parties, who each hold a set of items, to compute the intersection of those sets without revealing anything about other items. Recent advances in PSI have significantly improved its performance for the case of semi-honest security, making semi-honest PSI a practical alternative to insecure...
    Resource Type:
    Dissertation

  • 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

  • Interpretable Machine Learning: Applications in Biology and Genomics

    Creator:
    Danaee, Padideh
    Abstract:
    Machine learning (ML) and deep learning (DL) models impact our daily lives with applications in natural language modeling, image analysis, healthcare, genomics, and bioinformatics. The exponential growth of biological sequence data necessitates accompanying advances in computational methods. Although deep learning is highly effective for detecting and classifying biological sequences, challenges...
    Resource Type:
    Dissertation