Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"information-theoretic cryptography"”.

  1. Lower Bounds on Average-Case and Non-Local Quantum Computation

    This thesis studies computational and information-theoretic limitations in both classical and quantum models of computation. It is organized into two parts, each addressing a different aspect of computational hardness. Despite their differences, both parts share a common goal: understanding how …

    waterloo Repository record for Lower Bounds on Average-Case and Non-Local Quantum Computation (opens in a new tab)

  2. Adversarial Two-Party Quantum Interactions in Cryptography and Machine Learning

    … are of fundamental importance in the study of cryptography and machine learning, as they allow us to work in dynamic environments to model and adapt to various challenges, fostering reliability and robustness. In this thesis, we first consider such interactions in the domain of …

    vt Repository record for Adversarial Two-Party Quantum Interactions in Cryptography and Machine Learning (opens in a new tab)

  3. Unconditionally Secure Cryptography: Signature Schemes, User-Private Information Retrieval, and the Generalized Russian Cards Problem

    … while querying a database, called user-private information retrieval protocols. The third is concerned with the generalized Russian cards problem, in which two card players wish to communicate their hands to each other via public announcements without the third player learning the card deal. The …

    waterloo Repository record for Unconditionally Secure Cryptography: Signature Schemes, User-Private Information Retrieval, and the Generalized Russian Cards Problem (opens in a new tab)

  4. CONTINUOUS NON-MALLEABLE CODES AND NON-MALLEABLE SECRET SHARING

    … by the adversary. We present the first efficient information-theoretically secure continuous non-malleable codes in the constant split-state model, where there is a self-destruct mechanism which ensures that the adversary loses access to tampering after the first failed decoding. We also present a …

    nus Repository record for CONTINUOUS NON-MALLEABLE CODES AND NON-MALLEABLE SECRET SHARING (opens in a new tab) Download file for CONTINUOUS NON-MALLEABLE CODES AND NON-MALLEABLE SECRET SHARING (opens in a new tab)