Quantum m-out-of-n Oblivious Transfer
| dc.creator | Chen, Zhide | |
| dc.creator | Zhu, Hong | |
| dc.date | 2003-11-26 | |
| dc.date | 2004-04-16 | |
| dc.date.accessioned | 2026-07-07T03:20:37Z | |
| dc.date.available | 2026-07-07T03:20:37Z | |
| dc.description | In the m-out-of-n oblivious transfer (OT) model, one party Alice sends n bits to another party Bob, Bob can get only m bits from the n bits. However, Alice cannot know which m bits Bob received. Y.Mu[MJV02]} and Naor[Naor01] presented classical m-out-of-n oblivious transfer based on discrete logarithm. As the work of Shor [Shor94], the discrete logarithm can be solved in polynomial time by quantum computers, so such OTs are unsafe to the quantum computer. In this paper, we construct a quantum m-out-of-n OT (QOT) scheme based on the transmission of polarized light and show that the scheme is robust to general attacks, i.e. the QOT scheme satisfies statistical correctness and statistical privacy. | |
| dc.description | To Appear in The Ninth IEEE Symposium On Computers And Communications (ISCC'2004) | |
| dc.identifier | https://arxiv.org/abs/cs/0311039 | |
| dc.identifier | http://arxiv.org/abs/cs/0311039 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31891 | |
| dc.subject | Cryptography and Security | |
| dc.subject | Quantum Physics | |
| dc.subject | C.2.2 | |
| dc.title | Quantum m-out-of-n Oblivious Transfer | |
| dc.type | text |