Efficient Security Sequencing Problem over Insecure Channel Based on Homomorphic Encryption

• 作 者: Mingxu Yi Lifeng Wang Yunpeng Ma
• 机 构: School of Aeronautic Science and Engineering,Beihang University,
• 出 处: 中国通信
• 发表日期: 2016年09期
• 关键词: homomorphic encryption privacy sequencing problem secure multipart computation i

In the field of sequencing of secret number,an important problem is how to establish an efficient and secure protocol for sorting the secret number.As a powerful tool in solving privacy sequencing problems,secure multipart computation is more and more popular in anonymous voting and online auction.In the present study,related secure computation protocol for sequencing problem is not many by far.In order to improve the efficiency and safety,we propose a security sequencing protocol based on homomorphic encryption.We also give analysis of correctness and security to highlight its feasibility.

In the field of sequencing of secret number, an important problem is how to establish an efficient and secure protocol for sorting the secret number. As a powerful tool inolving privacy sequencing problems, secure multipart computation is more and more popular in anonymous voting and online auction.In the present study, related secure computation protocol for sequencing problem is not many by far. In order to improve the efficiency and safety, we propose a security sequencing protocol based on homomorphic encryption. We also give analysis of correctness and security to highlight its feasibility.