Unconditionally secure one-out-of-m SCOT protocols and one-out-of-m DQACM protocols are presented for arbitrary m ≥ 2, extending prior m=2 work.
Thus, Alice cannot guess Bob’s input b with probability greater than 1 m
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
One-out-of-$m$ spacetime-constrained oblivious transfer
Unconditionally secure one-out-of-m SCOT protocols and one-out-of-m DQACM protocols are presented for arbitrary m ≥ 2, extending prior m=2 work.