A new approach to privacy-preserving query in semi-honest model

作者：Geng Tao^*; Pang Lei; Luo Shoushan; Xin Yang; Yang Yixian

来源：International Journal of Advancements in Computing Technology, 2011, 3(9): 294-301.

DOI：10.4156/ijact.vol3.issue9.36

• Distributed systems
• Mix networks
• Privacy preserving
• Rapid growth
• Secure multi-party computation
• Shortest path

With rapid growth of the internet, plenty of collaboration opportunities exist when organizations and individuals share information or cooperate to compute in a distributed system. The cooperation may occur between mutually untrusted parties or competitors. This problem is referred to Secure Multi-party Computation (SMC) problem. Privacy-preserving query is a field of SMC. With the aid of distributed El Gamal encryption and mix network, a privacy-preserving query protocol is presented to solve the privacy-preserving query problem. And the correctness and security are also given out. Then an improved privacy-preserving query protocol is proposed to solve the situation where the server may complete too much computation in a distributed system. An example of shortest path query in graph using the privacy-preserving query protocol is presented. Orientation of future research is presented in the end.

• 出版日期2011
• 单位北京邮电大学