Asymptotically secure All-or-nothing Quantum Oblivious Transfer
- URL: http://arxiv.org/abs/2111.08484v1
- Date: Tue, 16 Nov 2021 14:01:25 GMT
- Title: Asymptotically secure All-or-nothing Quantum Oblivious Transfer
- Authors: Ramij Rahaman
- Abstract summary: We present a device independently secure quantum scheme for p-threshold all-or-nothing oblivious transfer.
Scheme is shown to be unconditionally secure against any strategy allowed by quantum mechanics.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We present a device independently secure quantum scheme for p-threshold
all-or-nothing oblivious transfer. Novelty of the scheme is that, its security
does not depend -- unlike the usual case -- on any quantum bit commitment
protocol, rather it depends on Hardy's argument for two-qubit system. This
scheme is shown to be unconditionally secure against any strategy allowed by
quantum mechanics. By providing a secure scheme for all-or-nothing quantum
oblivious transfer, we have answered a long standing open problem, other than
the quantum key distribution, whether there is any two-party quantum
cryptographic protocol, which is unconditionally secure.
Related papers
- Probabilistic versions of Quantum Private Queries [0.7252027234425332]
We define two non-deterministic versions of Quantum Private Queries, a protocol addressing the Symmetric-Private Information Retrieval problem.
We show that the strongest variant of such scheme is formally equivalent to Quantum Bit Commitment, Quantum Oblivious Transfer and One-Sided Two Party Computation protocols.
arXiv Detail & Related papers (2024-01-11T09:04:13Z) - Breaking barriers in two-party quantum cryptography via stochastic
semidefinite programming [0.0]
We find a way to switch between bit commitment, weak coin flipping, and oblivious transfer protocols to improve their security.
We also use selection to turn trash into treasure yielding the first quantum protocol for Rabin oblivious transfer.
arXiv Detail & Related papers (2023-04-26T00:00:48Z) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z) - Oblivious Quantum Computation and Delegated Multiparty Quantum
Computation [61.12008553173672]
We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required.
Exploiting quantum teleportation, we propose a two-server protocol for this task.
Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
arXiv Detail & Related papers (2022-11-02T09:01:33Z) - A constant lower bound for any quantum protocol for secure function
evaluation [0.0]
We show that perfect (or near perfect) security is impossible, even for quantum protocols.
Constant lower bounds are of practical interest since they imply the impossibility to arbitrarily amplify the security of quantum protocols.
arXiv Detail & Related papers (2022-03-15T21:40:48Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - Delegating Multi-Party Quantum Computations vs. Dishonest Majority in
Two Quantum Rounds [0.0]
Multi-Party Quantum Computation (MPQC) has attracted a lot of attention as a potential killer-app for quantum networks.
We present a composable protocol achieving blindness and verifiability even in the case of a single honest client.
arXiv Detail & Related papers (2021-02-25T15:58:09Z) - Single-Shot Secure Quantum Network Coding for General Multiple Unicast
Network with Free One-Way Public Communication [56.678354403278206]
We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network.
Our code correctly transmits quantum states when there is no attack.
It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
arXiv Detail & Related papers (2020-03-30T09:25:13Z) - Backflash Light as a Security Vulnerability in Quantum Key Distribution
Systems [77.34726150561087]
We review the security vulnerabilities of quantum key distribution (QKD) systems.
We mainly focus on a particular effect known as backflash light, which can be a source of eavesdropping attacks.
arXiv Detail & Related papers (2020-03-23T18:23:12Z) - Asymptotic security analysis of teleportation based quantum cryptography [0.0]
We prove that the teleportation based quantum cryptography protocol presented in [Opt. Commun 283, 184] is secure against all types of individual and collective attacks.
We then investigate modifications to that protocol leading to greater secret-key rates and to security against coherent attacks.
arXiv Detail & Related papers (2020-02-10T17:54:15Z) - Semantic Security for Quantum Wiretap Channels [68.24747267214373]
We consider the problem of semantic security via classical-quantum and quantum wiretap channels.
We use explicit constructions to transform a non-secure code into a semantically secure code, achieving capacity by means of biregular irreducible functions.
arXiv Detail & Related papers (2020-01-16T09:55:49Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.