Eur. Phys. J. D 60, 429-433 (2010)
https://doi.org/10.1140/epjd/e2010-00210-9

Incentive compatible quantum secure division

¹ National High Performance Computing Center at Hefei, School of Computer Science and Technology, University of Science and Technology of China, Hefei, 230026, P.R. China
² Suzhou Institute for Advanced Study, University of Science and Technology of China, Suzhou, 215123, P.R. China
³ Computer Science and Engineering Department, Pennsylvania State University, 338K IST Building, University Park, PA, 16802, USA
⁴ Department of Computer Science, University of Illinois at Urbana-Champaign, Ci1308 West Main St, Urbana, IL, 61801-2307, USA

Corresponding author: ^a qubit@ustc.edu.cn

Received: 9 February 2010
Revised: 27 June 2010
Published online: 6 August 2010

Abstract

Secure division serves as an important primitive for secure multi-party computation and has wide applications in many fields, such as data mining, statistical analysis, collaborative benchmarking, etc. How to collaboratively compute the correct division result without leaking any participants's private data becomes the primary goal of secure division schemes. In this paper, we present a quantum secure division scheme via quantum discrete Fourier transform and quantum measurement. The scheme is proven to be secure against semi-honest parties and colluding parties. Furthermore, under the rational assumption that the first priority for every party is to learn the correct result, our scheme is shown to be incentive compatible.