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 13 of 13 for “"Oblivious transfer"”.

  1. Network oblivious transfer

    … for MPC. We propose an infrastructure based on oblivious transfer (OT), which would consist of OT channels between some pairs of parties in the network. We devise information-theoretically secure protocols that allow additional pairs of parties to establish secure OT correlations using the help …

    mit Repository record for Network oblivious transfer (opens in a new tab)

  2. Frameworks for efficient quantum oblivious transfer in the QROM

    Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2024-05-01

    uiuc Repository record for Frameworks for efficient quantum oblivious transfer in the QROM (opens in a new tab)

  3. Constant Lower Bounds on the Cryptographic Security of Quantum Two-Party Computations

    … In particular, we provide lower bounds for oblivious transfer, XOR oblivious transfer, the equality function, the inner product function, Yao's millionaires' problem, and the secret phrase problem. Note that many of these lower bounds are the first of their kind, which is a testament to the …

    vt Repository record for Constant Lower Bounds on the Cryptographic Security of Quantum Two-Party Computations (opens in a new tab)

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

    … coin flipping, bit commitment, and variants of oblivious transfer. We begin by developing the mathematical framework of stochastic selection, which is potentially useful for devising new protocols with improved security for a combination of various tasks. We then use this idea to develop the …

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

  5. Efficient Non-Interactive Secure Two-Party Computation for Equality and Comparison

    … Peikert-Vaikuntanathan-Waters maliciously secure oblivious transfer and a collision resistant hash function. We formally prove that the PET protocol and the PGT protocol provide computational security. In this research, we developed our protocol for PET and run experiments to test it. The results …

    calgary Repository record for Efficient Non-Interactive Secure Two-Party Computation for Equality and Comparison (opens in a new tab)

  6. The application of DRAM PUF as a physical token

    … cryptography, particularly in the context of the oblivious transfer protocol which is based on the fuzzy transfer protocol. The results contributes to a deeper understanding of its application as a physical token as well as the security implications associated with deploying PUFs in cryptographic …

    vt Repository record for The application of DRAM PUF as a physical token (opens in a new tab)

  7. Mobile agent security through multi-agent cryptographic protocols.

    … as encrypted circuits, threshold decryption, and oblivious transfer. Our study of these tools yields new contributions to the general field of cryptography. Particularly, we correct a well-known construction of the encrypted circuit and give one of the first provably secure implementations of the …

    unt Repository record for Mobile agent security through multi-agent cryptographic protocols. (opens in a new tab)

  8. On Black-Box Complexity and Adaptive, Universal Composability of Cryptographic Tasks

    … can be achieved via a black-box reduction to oblivious transfer. We show that it cannot be achieved via a black-box reduction to one-way function, unless the number of rounds is at least Omega(n/log n), where n is the input/output length of the one-way function. In the second part of this …

    columbia-diss Repository record for On Black-Box Complexity and Adaptive, Universal Composability of Cryptographic Tasks (opens in a new tab)

  9. Structure vs. hardness through the obfuscation lens

    … (in the case of SZK), public-key encryption, oblivious transfer, deniable encryption, functional encryption, and even indistinguishability obfuscation; -- Complexity-theoretic Implications: As a corollary of our result, we show a separation between SZK and NP[set-theoretic intersection …

    mit Repository record for Structure vs. hardness through the obfuscation lens (opens in a new tab)

  10. Cryptographic Simulation Techniques with Applications to Quantum Zero-Knowledge and Copy-Protection

    … cryptographic tool, statistical receiver-private oblivious transfer. This is the first construction of QPoK with the desired composability features. We also introduce a new non-black-box knowledge extraction technique using quantum fully homomorphic encryption (QFHE) and lockable obfuscation. One …

    mit Repository record for Cryptographic Simulation Techniques with Applications to Quantum Zero-Knowledge and Copy-Protection (opens in a new tab)

  11. On computational intractability assumptions in cryptography

    … assumption: ""semi-honest secure protocol for oblivious transfer exists"" (sh-OT assumption). Additionally, the information theoretically impossible reductions considered in this thesis imply the assumption: ""one-way functions exist"" (OWF assumption). We conjecture that OWF assumption is …

    uiuc Repository record for On computational intractability assumptions in cryptography (opens in a new tab)

  12. A cryptographic approach to location privacy

    The rapid expansion of location-based services (LBS) has driven an escalating demand for personalised and context-aware applications, enriching user experiences across health, weather, and navigation sectors. These services offer valuable insights into various applications using large-scale …

    cork Repository record for A cryptographic approach to location privacy (opens in a new tab)