Cryptographic protocols are the backbone of our information society. In this work, we implement such a protocol which allows two parties Alice and Bob to compute a function together so that even if Alice tries to cheat by deviating from the protocol, she cannot learn Bob’s inputs and vice versa. A famous example of such a scenario is Yao’s millionaires’ problem where the two millionaires Alice and Bob would like to determine whose fortune is bigger, but without telling the other how much money they own.
The novel aspect of our work is that it makes use of quantum communication in a form that is easily accessible experimentally, while previous approaches relied on more demanding experimental techniques. The security relies on the fact that it is difficult to store large amounts of quantum information (encoded in light particles) over longer periods of time.
Titel: Continuous-variable protocol for oblivious transfer in the noisy-storage model
Written by: Fabian Furrer, Tobias Gehring, Christian Schaffner, Christoph Pacher, Roman Schnabel & Stephanie Wehner.
Read full article here.
