Oblivious transfer and quantum non-locality

@article{Wolf2005ObliviousTA,
  title={Oblivious transfer and quantum non-locality},
  author={Stefan Wolf and J{\"u}rg Wullschleger},
  journal={Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.},
  year={2005},
  pages={1745-1748}
}
  • S. Wolf, Jürg Wullschleger
  • Published 4 February 2005
  • Computer Science, Mathematics
  • Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.
Oblivious transfer, a central functionality in modern cryptography, allows a party to send two one-bit messages to another who can choose one of them to read, remaining ignorant about the other, whereas the sender does not learn the receiver's choice. Oblivious transfer the security of which is information-theoretic for both parties is known impossible to achieve from scratch. The joint behavior of certain bi-partite quantum states is non-local, i.e., cannot be explained by shared classical… 

Figures from this paper

Oblivious Transfer from Non-Local Correlations Master Thesis
TLDR
This work presents protocols to realize oblivious transfer using forms of nonlocal correlations, bit commitment, statistic tests, error correction codes and privacy amplification as basic building blocks.
Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
We describe how any two-party quantum computation, specified by a unitary which simultaneously acts on the registers of both parties, can be privately implemented against a quantum version of
Efficient Reductions for Non-signaling Cryptographic Primitives
TLDR
This paper shows that OTMs can securely be implemented from NL-Boxes, and is the first protocol to cancel the non-signaling property of anNL-Box for exactly one party.
Oblivious transfer, the CHSH game, and quantum encodings
TLDR
A "learning lemma" is proved, which provides a new upper bound on the average probability of decoding each bit that depends on the probability of learning the XOR of the two bits, which helps improve the lower bounds on the cheating probabilities of any quantum oblivious transfer protocol.
Quantum preprocessing for information-theoretic security in two-party computation
  • Li Yu
  • Computer Science, Mathematics
  • 2019
TLDR
It is shown how to use the generated one-time tables to achieve nontrivial information-theoretic security in generic two-party classical or quantum computation tasks, including (interactive) quantum homomorphic encryption.
On the Power of Two-Party Quantum Cryptography
TLDR
It is argued that leakage is a good measure for the privacy provided to the players by a given protocol because it extends known impossibility results to all non-trivial primitives.
Bit commitment from weak non-locality
  • S. Wolf, Jürg Wullschleger
  • Computer Science
    IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005.
  • 2005
TLDR
It is shown that any possible non-local correlation which produces random bits on both sides can be used to implement bit commitment, and that this holds even when the parties are allowed to delay their inputs to the box.
One-out-of-two Quantum Oblivious Transfer based on Nonorthogonal States
TLDR
This research proposes the first one-out-of-two quantum oblivious transfer (QOT) scheme that does not have a two-level structure and is not subject to Lo’s no-go theorem, and an efficiency analysis shows that the proposed protocol is more efficient than other, two- level-structured protocols.
Quantum Oblivious Transfer and Fair Digital Transactions
TLDR
It is shown how quantum entanglement can be used to build cryptographic primitives such as oblivious transfer, and the proposal provides unconditional security for e-business applications.
Quantifying the Leakage of Quantum Protocols for Classical Two-Party Cryptography
TLDR
It is shown that every strictly correct quantum protocol implementing a non-trivial classical primitive necessarily leaks information to a dishonest player, and a framework is provided for quantifying this leakage and arguing that leakage is a good measure for the privacy provided to the players by a given protocol.
...
...

References

SHOWING 1-10 OF 21 REFERENCES
Practical Quantum Oblivious Transfer
We describe a protocol for quantum oblivious transfer, utilizing faint pulses of polarized light, by which one of two mutually distrustful parties ("Alice") transmits two one-bit messages in such a
Efficient Unconditional Oblivious Transfer from Almost Any Noisy Channel
TLDR
If noise—which is inherently present in any physical communication channel—is taken into account, then OT can be realized in an unconditionally secure way for both parties, i.e., even against dishonest players with unlimited computing power.
Precomputing Oblivious Transfer
Alice and Bob are too untrusting of computer scientists to let their privacy depend on unproven assumptions such as the existence of one-way functions. Firm believers in Schrodinger and Heisenberg,
On the Reversibility of Oblivious Transfer
TLDR
The (2 1)-OT2k (one-out-of-two String O.T.) in which the two secrets q0, q1 are elements of GFk(2) instead of bits is shown, and it is shown that 2kTO-(2 1) can be obtained at about the same cost as ( 2 1)- OT2k, in terms of number of calls to (2 2-OT2).
Efficient Cryptographic Protocols Based on Noisy Channels
TLDR
These protocols provide efficient protocols to achieve the cryptographic primitives of Bit Commitment and Oblivious Transfer based on the existence of a Binary Symmetric Channel that allow two people to extract secret information from partially compromised data.
Founding crytpography on oblivious transfer
  • J. Kilian
  • Computer Science, Mathematics
    STOC '88
  • 1988
TLDR
It is shown that this protocol, more commonly known as oblivious transfer, can be used to simulate a more sophisticated protocol,known as oblivious circuit evaluation([Y], and that with such a communication channel, one can have completely noninteractive zero-knowledge proofs of statements in NP.
Quantum entanglement can be simulated without communication
It has recently been shown that all causal correlations between two parties which output each one bit, a and b, when receiving each one bit, x and y, can be expressed as convex combinations of local
How To Exchange Secrets with Oblivious Transfer
  • M. Rabin
  • Mathematics, Computer Science
    IACR Cryptol. ePrint Arch.
  • 2005
As this paper puts forward the notion of “Oblivious Transfers” and is a well-known and frequently cited paper, I felt I should typeset the manuscript, and here is the result. While typesetting, I
Unconditionally secure quantum bit commitment is impossible
TLDR
It is shown that the claim that quantum cryptography can provide protocols that are unconditionally secure, that is, for which the security does not depend on any restriction on the time, space, or technology available to the cheaters, does not hold for any quantum bit commitment protocol.
Simulating maximal quantum entanglement without communication.
TLDR
It is shown that a single instance of the latter elementary nonlocal correlation suffices to simulate exactly all possible projective measurements that can be performed on a maximally entangled state of two qubits, with no communication needed at all.
...
...