Search Constraints

Start Over
Filtering by: Creator Petsche, Clayton Remove constraint Creator: Petsche, Clayton Degree Field Computer Science Remove constraint Degree Field: Computer Science

Search Results

  • 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
    Full Text:
    , and Clayton Petsche, for making the time to help me through this process. Huck and Clayton taught me

  • Efficient, secure and covert channel capacity bounded protocols for multilevel security cross-domain environments - an experimental system

    Creator:
    Nandakumar Thampi, Archana
    Abstract:
    The communication in MLS cross-domain environments faces many challenges. The three most important challenges are efficient key management, privacy preserving and covert channel. We propose an Efficient, Secure and Covert Channel Capacity Bounded Protocol which has three algorithms that addresses these challenges: The Efficient Attribute-based Fine-Grained Authentication (EAFA) algorithm, Anonymous...
    Resource Type:
    Masters Thesis
    Full Text:
    Dr. Bella Bose, Dr. Mike Rosulek and Dr. Clayton Petsche for reviewing my work and serving on my

  • Computing Bounded Chains and Surfaces in a Simplicial Complex with Bounded-treewidth 1-skeleton

    Creator:
    Black, Mitchell
    Abstract:
    We consider three problems on simplicial complexes: the Optimal Bounded Chain Problem, the Optimal Homologous Chain Problem, and 2-Dim-Bounded-Surface. The Optimal Bounded Chain Problem asks to find the minimum weight d-chain in a simplicial complex K bounded by a given (d−1)-chain, if such a d-chain exists. The Optimal Homologous Chain...
    Resource Type:
    Masters Thesis
    Full Text:
    —Cora Borradaile, Christine Escher, Mike Bailey, and Clayton Petsche—for volunteering their time and

  • 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:
    guidance during my entire graduate program: Rakesh Bobba, Mariana Raykova, Jiayu Xu and Clayton Petsche

  • Structural Results and Approximation Algorithms in Minor-free Graphs

    Creator:
    Le, Hung V.
    Abstract:
    Planarity has been successfully exploited to design faster and more accurate approximation algorithms for many graph optimization problems. The celebrated theorem of Kuratowski completely characterizes planar graphs as those excluding K_5 and K_{3,3} as minors. Kuratowski's theorem allows one to generalize planar graphs to H-minor-free graphs: those that exclude a...
    Resource Type:
    Dissertation
    Full Text:
    thank Christian Wulff-Nilse, Amir Nayyeri , Mike Rosulek, Eugene Zhang and Clayton Petsche for serving

  • Generative Models Meet Explainable AI and Long-Tail Learning: from Attribution Maps to Image Synthesis

    Creator:
    Khorram, Saeed
    Abstract:
    The advancement of artificial intelligence (AI) has led to transformative developments across multiple sectors, fostering innovation and redefining our interactions with technology. As AI matures and becomes integrated into society, it offers numerous opportunities to address global challenges and revolutionize a wide array of human endeavors. These advances are driven...
    Resource Type:
    Dissertation
    Full Text:
    He, and Clayton Petsche. Their valuable feedback and suggestions have greatly assisted me in