Efficient Secure Multiparty Computation Protocol for Sequencing Problem over Insecure ChannelReport as inadecuate




Efficient Secure Multiparty Computation Protocol for Sequencing Problem over Insecure Channel - Download this document for free, or read online. Document in PDF available to download.

Mathematical Problems in EngineeringVolume 2013 2013, Article ID 172718, 5 pages

Research Article

State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China

School of Computer Science and Technology, Nanjing Normal University, Nanjing, Jiangsu 210023, China

Received 2 March 2013; Accepted 2 August 2013

Academic Editor: Vishal Bhatnagar

Copyright © 2013 Yi Sun et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

As a powerful tool in solving privacy preserving cooperative problems, secure multiparty computation is more and more popular in electronic bidding, anonymous voting, and online auction. Privacy preserving sequencing problem which is an essential link is regarded as the core issue in these applications. However, due to the difficulties of solving multiparty privacy preserving sequencing problem, related secure protocol is extremely rare. In order to break this deadlock, this paper first presents an efficient secure multiparty computation protocol for the general privacy-preserving sequencing problem based on symmetric homomorphic encryption. The result is of value not only in theory, but also in practice.





Author: Yi Sun, Qiaoyan Wen, Yudong Zhang, Hua Zhang, and Zhengping Jin

Source: https://www.hindawi.com/



DOWNLOAD PDF




Related documents