TY - JOUR
T1 - Private Randomness Agreement and its Application in Quantum Key Distribution Networks
AU - Christensen, René Bødker
AU - Popovski, Petar
PY - 2023/2
Y1 - 2023/2
N2 - We define a variation on the well-known problem of private message transmission. This new problem called private randomness agreement (PRA) gives two participants access to a public, authenticated channel alongside the main channels, and the ‘message’ is not fixed a priori. Instead, the participants’ aim to agree on a random string completely unknown to a computationally unbounded adversary. We define privacy and reliability, and show that PRA cannot be solved in a single round. We then show that it can be solved in three rounds, albeit with exponential cost, and give an efficient four-round protocol based on polynomial evaluation.
AB - We define a variation on the well-known problem of private message transmission. This new problem called private randomness agreement (PRA) gives two participants access to a public, authenticated channel alongside the main channels, and the ‘message’ is not fixed a priori. Instead, the participants’ aim to agree on a random string completely unknown to a computationally unbounded adversary. We define privacy and reliability, and show that PRA cannot be solved in a single round. We then show that it can be solved in three rounds, albeit with exponential cost, and give an efficient four-round protocol based on polynomial evaluation.
KW - privacy
KW - private message transmission
KW - quantum key distribution
KW - secret sharing
UR - http://www.scopus.com/inward/record.url?scp=85144011419&partnerID=8YFLogxK
U2 - 10.1109/LCOMM.2022.3225262
DO - 10.1109/LCOMM.2022.3225262
M3 - Letter
SN - 1089-7798
VL - 27
SP - 477
EP - 481
JO - I E E E Communications Letters
JF - I E E E Communications Letters
IS - 2
ER -