Implications of superstrong non-locality for cryptography

S Buhrman; M Christandl; F Unger; S Wehner; S Wehner; S Wehner; AJ Winter

Implications of superstrong non-locality for cryptography

S Buhrman
, M Christandl
, F Unger
, S Wehner
, S Wehner
, S Wehner
, AJ Winter

School of Mathematics

Research output: Contribution to journal › Article (Academic Journal) › peer-review

37 Citations (Scopus)

Abstract

Non-local boxes are hypothetical 'machines' that give rise to superstrong non-local correlations, leading to a stronger violation of Bell/Clauser, Horne, Shimony & Holt inequalities than is possible within the framework of quantum mechanics. We show how non-local boxes can be used to perform any two-party secure computation. We first construct a protocol for bit commitment and then show how to achieve oblivious transfer using non-local boxes. Both have been shown to be impossible using quantum mechanics alone.

Translated title of the contribution	Implications of superstrong non-locality for cryptography
Original language	English
Pages (from-to)	1919 - 1932
Journal	Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
Volume	462 (2071)
Publication status	Published - 8 Jul 2006

Bibliographical note

Publisher: Royal Society
Other identifier: IDS number 054EA

Handle.net

Persistent link

Cite this

@article{963a92d6c42c4d73a1d58958bea89fef,

title = "Implications of superstrong non-locality for cryptography",

abstract = "Non-local boxes are hypothetical 'machines' that give rise to superstrong non-local correlations, leading to a stronger violation of Bell/Clauser, Horne, Shimony \& Holt inequalities than is possible within the framework of quantum mechanics. We show how non-local boxes can be used to perform any two-party secure computation. We first construct a protocol for bit commitment and then show how to achieve oblivious transfer using non-local boxes. Both have been shown to be impossible using quantum mechanics alone.",

author = "S Buhrman and M Christandl and F Unger and S Wehner and S Wehner and S Wehner and AJ Winter",

note = "Publisher: Royal Society Other identifier: IDS number 054EA",

year = "2006",

month = jul,

day = "8",

language = "English",

volume = "462 (2071)",

pages = "1919 -- 1932",

journal = "Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences",

issn = "1364-5021",

publisher = "Royal Society Publishing",

}

TY - JOUR

T1 - Implications of superstrong non-locality for cryptography

AU - Buhrman, S

AU - Christandl, M

AU - Unger, F

AU - Wehner, S

AU - Winter, AJ

N1 - Publisher: Royal Society Other identifier: IDS number 054EA

PY - 2006/7/8

Y1 - 2006/7/8

N2 - Non-local boxes are hypothetical 'machines' that give rise to superstrong non-local correlations, leading to a stronger violation of Bell/Clauser, Horne, Shimony & Holt inequalities than is possible within the framework of quantum mechanics. We show how non-local boxes can be used to perform any two-party secure computation. We first construct a protocol for bit commitment and then show how to achieve oblivious transfer using non-local boxes. Both have been shown to be impossible using quantum mechanics alone.

AB - Non-local boxes are hypothetical 'machines' that give rise to superstrong non-local correlations, leading to a stronger violation of Bell/Clauser, Horne, Shimony & Holt inequalities than is possible within the framework of quantum mechanics. We show how non-local boxes can be used to perform any two-party secure computation. We first construct a protocol for bit commitment and then show how to achieve oblivious transfer using non-local boxes. Both have been shown to be impossible using quantum mechanics alone.

M3 - Article (Academic Journal)

SN - 1364-5021

VL - 462 (2071)

SP - 1919

EP - 1932

JO - Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

JF - Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

ER -

Implications of superstrong non-locality for cryptography

Abstract

Bibliographical note

Handle.net

Fingerprint

Cite this