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 20 of 41 for “"oblivious transfer"”.
-
QUANTUM OBLIVIOUS TRANSFER: BOUNDS AND APPLICATIONS
… and impossibility bounds for quantum oblivious transfer. For the upper bound, optimal quantum oblivious transfer to date requires multiple calls to quantum weak coin flipping. However, the composable security of quantum weak coin flipping has been poorly understood. We prove that …
-
Exploratory designs of unconditionally secure distributed oblivious transfer protocols
… and designing some protocols called distributed oblivious transfer (DOT) protocols. A DOT protocol allows a party A to obtain one of the secret pieces of information (a secret for short) held by a party B so that the following two fundamental conditions are satisfied: • A chooses the secrets she …
-
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
-
An Efficient Asynchronous Peer to Peer Auction using Yao Oblivious Transfer
… a modified version of this protocol where the oblivious transfer method [14] is used to solve the Yao millionaires' problem [22] that arises between two auctioneer groups when they have to compare bids. Additionally, a 2nd price mechanism in which only the second highest bid is known to all the …
-
Efficient private information retrieval
… we study Private Information Retrieval and Oblivious Transfer, two strong cryptographic tools that are widely used in various security-related applications, such as private data-mining schemes and secure function evaluation protocols. The first non-interactive, secure dot-product protocol, …
-
Efficient Multiparty Computation from Lossy Threshold Encryption
… scheme. The second contribution is a new oblivious transfer protocol secure against erasure-free one-sided active adaptive adversaries. The third contribution is a new two-party computation protocol for the evaluation of boolean circuits that is secure against erasure-free one-sided active …
-
Analyzing Quantum Cryptographic Protocols Using Optimization Techniques
… is divided into the study of coin-flipping and oblivious transfer. We first examine a family of coin-flipping protocols. Almost all of the handful of explicitly described coin-flipping protocols are based on bit-commitment. To explore the possibility of finding explicit optimal or near-optimal …
-
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 …
-
Kryptografické protokoly pro CrypTool
… Jako další vhodné protokoly byly přidány Oblivious Transfer a Yao´s Millionaire Problem. V práci je podrobně popsán koncept vybraných protokolů a postup při jejich implementaci.
-
On the Theory and Design of Post-Quantum Authenticated Key-Exchange, Encryption and Signatures
… for secure public-key encryption schemes and oblivious transfer protocols based on isogenies of supersingular elliptic curves are presented. In Chapter 6, a new one-way function family is defined and an IND-CCA-secure encryption scheme is constructed. In Chapter 7, a new framework of …
-
Enhancing security of cryptographic protocols through better modularization
… 2PC protocol using a relaxed version of the oblivious transfer (which is not round-optimal) primitive and a non-interactive commitment scheme. 2. We build a round-optimal MPC protocol that withstands adaptive corruptions using an oblivious transfer which only provides sender and receiver …
-
Approaches to Practical Quantum Cryptography
… the setting of device-independence, with oblivious transfer in the bounded-quantum-storage-model as the primitive of interest. The typical approach to enabling device-independence is the use of a Bell-inequality violation, which requires a strict non-communication assumption that is …
-
Computationally secure quantum cryptography without one-way functions
… primitives, including commitment schemes, oblivious transfer, and zero knowledge.• We establish the “minimality” of EFI pairs by showing that their existence is implied by many natural cryptographic primitives. EFI pairs thus appear easier to construct than other primitives. • We show that …
-
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 …
-
Comparison of Protocols for Private Set Intersection and 2-Party Secure Computation
… protocol employs algebraic constructions such as Oblivious Linear Function Evaluation (OLE), its enhanced version OLE+, and Oblivious Polynomial Addition (OPA), whereas the PSZ protocol leverages modern Oblivious Transfer (OT) extensions and Pseudo-Random Functions (PRFs). The thesis evaluates …
-
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 …
-
Many-to-one private set intersection
… problem. The scheme extends the state-of-the-art oblivious transfer-based one-to-one PSI schemes, but also embeds the innovative ideas of (1) leveraging the collaborations between clients to achieve high computational and communication efficiency, and (2) relying on server-aided secret encryption …
-
Algebraic Construction for Multi-Party Protocols with Focus on Threshold Signatures
… threshold signature and finally a post quantum oblivious transfer. Lastly, we designed a coercion resistant e-voting protocol, that allows voters to freely votes without being afraid of external adversaries trying to pressure them to vote in a particular way.
-
MINIMAL ASSUMPTIONS IN QUANTUM CRYPTOGRAPHY
… We construct a device-independent protocol for oblivious transfer using Magic Square quantum devices in the bounded quantum storage model, when the devices are untrusted and could be adversarial. It achieves security even when the devices are not independent and identically distributed (IID), …
Page 1 of 3