TY - JOUR
T1 - Error-tolerant oblivious transfer in the noisy-storage model
AU - Lupo, Cosmo
AU - Peat, James T.
AU - Andersson, Erika
AU - Kok, Pieter
N1 - Funding Information:
This work has received funding via the EPSRC Quantum Communication Hub (EP/T001011/1)'s partnership resource scheme and from the European Union's Horizon Europe research and innovation program under the project “Quantum Secure Networks Partnership” (QSNP, Grant Agreement No. 101114043). C.L. acknowledges financial support from PNRR MUR Project No. PE0000023-NQSTI.
Publisher Copyright:
© 2023 authors. Published by the American Physical Society. Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.
PY - 2023/9/7
Y1 - 2023/9/7
N2 - The noisy-storage model of quantum cryptography allows for information-theoretically secure two-party computation based on the assumption that a cheating user has at most access to an imperfect, noisy quantum memory, whereas the honest users do not need a quantum memory at all. In general, the more noisy the quantum memory of the cheating user, the more secure the implementation of oblivious transfer, which is a primitive that allows universal secure two-party and multiparty computation. For experimental implementations of oblivious transfer, one has to consider that also the devices held by the honest users are lossy and noisy, and error correction needs to be applied to correct these trusted errors. The latter are expected to reduce the security of the protocol, since a cheating user may hide themselves in the trusted noise. Here we leverage entropic uncertainty relations to derive tight bounds on the security of oblivious transfer with a trusted and untrusted noise. In particular, we discuss noisy storage and bounded storage, with independent and correlated noise.
AB - The noisy-storage model of quantum cryptography allows for information-theoretically secure two-party computation based on the assumption that a cheating user has at most access to an imperfect, noisy quantum memory, whereas the honest users do not need a quantum memory at all. In general, the more noisy the quantum memory of the cheating user, the more secure the implementation of oblivious transfer, which is a primitive that allows universal secure two-party and multiparty computation. For experimental implementations of oblivious transfer, one has to consider that also the devices held by the honest users are lossy and noisy, and error correction needs to be applied to correct these trusted errors. The latter are expected to reduce the security of the protocol, since a cheating user may hide themselves in the trusted noise. Here we leverage entropic uncertainty relations to derive tight bounds on the security of oblivious transfer with a trusted and untrusted noise. In particular, we discuss noisy storage and bounded storage, with independent and correlated noise.
UR - http://www.scopus.com/inward/record.url?scp=85172884716&partnerID=8YFLogxK
U2 - 10.1103/PhysRevResearch.5.033163
DO - 10.1103/PhysRevResearch.5.033163
M3 - Article
AN - SCOPUS:85172884716
SN - 2643-1564
VL - 5
JO - Physical Review Research
JF - Physical Review Research
IS - 3
M1 - 033163
ER -