Quantum m-out-of-n Oblivious Transfer

Details Quantum m-out-of-n Oblivious Transfer Quantum m-out-of-n Oblivious Transfer

2003-11-26

arxiv.org/abs/cs/0311039v2

Computer Science

Cryptography and Security

To Appear in The Ninth IEEE Symposium On Computers And Communications (ISCC'2004)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Quantum m-out-of-n Oblivious Transfer does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum m-out-of-n Oblivious Transfer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum m-out-of-n Oblivious Transfer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-122246