Search Constraints

Start Over
Filtering by: Creator Lizon, K. Michele Remove constraint Creator: Lizon, K. Michele Committee Member Bobba, Rakesh Remove constraint Committee Member: Bobba, Rakesh

Search Results

  • Leveraging Hardware-Impaired Out-of-Band Information Through Deep Neural Networks for Robust Wireless Device Classification

    Creator:
    Elmaghbub, Abdurrahman A.
    Abstract:
    Wireless device classification techniques play a key role in promoting emerging wireless applications such as allowing spectrum regulatory agencies to enforce their access policies and enabling network administrators to control access and prevent impersonation attacks to their wireless networks. Leveraging spectrum distortions of transmitted RF signals, caused by transceiver hardware...
    Resource Type:
    Masters Thesis
    Full Text:
    written as y HQ SI (t) = ∑∞ k=−∞ c HQ k e j2πkfΩt, with the Fourier coefficients cHQk being cHQk = 1

  • 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:
    maximum stash size for Cuckoo hashing; k is the width of the pseudorandom code (in bits); v is the length

  • 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