Two Quantum Protocols for Oblivious Set-member Decision Problem

In this paper, we defined a new secure multi-party computation problem, called Oblivious Set-member Decision problem, which allows one party to decide whether a secret of another party belongs to his private set in an oblivious manner. There are lots of important applications of Oblivious Set-member Decision problem in fields of the multi-party collaborative computation of protecting the privacy of the users, such as private set intersection and union, anonymous authentication, electronic voting and electronic auction. Furthermore, we presented two quantum protocols to solve the Oblivious Set-member Decision problem. Protocol I takes advantage of powerful quantum oracle operations so that it needs lower costs in both communication and computation complexity; while Protocol II takes photons as quantum resources and only performs simple single-particle projective measurements, thus it is more feasible with the present technology.

[1]  Tian-Yin Wang,et al.  Security of quantum digital signatures for classical messages , 2015, Scientific Reports.

[2]  Seth Lloyd,et al.  Quantum Private Queries: Security Analysis , 2008, IEEE Transactions on Information Theory.

[3]  A. R. Dixon,et al.  High speed and adaptable error correction for megabit/s rate quantum key distribution , 2014, Scientific Reports.

[4]  Hua Lu,et al.  Unconditional security proof of a deterministic quantum key distribution with a two-way quantum channel , 2011, 1111.0109.

[5]  Hui Chen,et al.  Flexible quantum private queries based on quantum key distribution. , 2011, Optics express.

[6]  P. Oscar Boykin,et al.  A Proof of the Security of Quantum Key Distribution , 1999, STOC '00.

[7]  Hung-Min Sun,et al.  A communication-efficient private matching scheme in Client-Server model , 2014, Inf. Sci..

[8]  Lukasz Olejnik,et al.  Secure quantum private information retrieval using phase-encoded queries , 2011 .

[9]  Lan Zhou,et al.  Deterministic entanglement distillation for secure double-server blind quantum computation , 2013, Scientific Reports.

[10]  Anthony Leverrier,et al.  Unconditional security proof of long-distance continuous-variable quantum key distribution with discrete modulation. , 2008, Physical review letters.

[11]  Gilles Brassard,et al.  Quantum Cryptography , 2005, Encyclopedia of Cryptography and Security.

[12]  Muhammad Nadeem.  Unconditionally secure commitment in position-based quantum cryptography , 2014, Scientific reports.

[13]  Ämin Baumeler,et al.  Quantum Private Information Retrieval has Linear Communication Complexity , 2013, Journal of Cryptology.

[14]  Peng Xu,et al.  Flexible protocol for quantum private query based on B92 protocol , 2014, Quantum Inf. Process..

[15]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[16]  Christoph Simon,et al.  Practical private database queries based on a quantum-key-distribution protocol , 2010, 1002.4360.

[17]  Gilles Brassard,et al.  Quantum cryptography: Public key distribution and coin tossing , 2014, Theor. Comput. Sci..

[18]  Seth Lloyd,et al.  Quantum private queries. , 2007, Physical review letters.

[19]  Xiong Zhang,et al.  Non-local classical optical correlation and implementing analogy of quantum teleportation , 2015, Scientific Reports.

[20]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[21]  Nicolas Gisin,et al.  Quantum cryptography protocols robust against photon number splitting attacks for weak laser pulse implementations. , 2004, Physical review letters.