|
|||||
|
|
Secure multi-party computation protocol for sequencing problem |
|
| Authors: | TANG ChunMing SHI GuiHua & YAO ZhengAn School of Mathematics Information Science Guangzhou University Guangzhou China State Key Laboratory of Information Security |
| Affiliation: | TANG ChunMing 1,2,SHI GuiHua 1 & YAO ZhengAn 3 1 School of Mathematics and Information Science,Guangzhou University,Guangzhou 510006,China,2State Key Laboratory of Information Security,Institute of Software Science,Chinese Academy of Sciences,Beijing 100080,3 School of Mathematics and Computational Science,Sun Yat-Sen University,Guangzhou 510275 |
| Abstract: | In the field of multi-party computation,an important problem is how to construct an efficient and secure multi-party computation protocol for certain specific problems.In the present study,we make use of a secret sharing scheme to construct an efficient and secure multi-party computation protocol for sequencing problems.Our protocols are perfectly secure against both a passive adversary that can corrupt at most t (n-1)/2 participants, and an active adversary that can corrupt at most t < n/3 participants.The... |
| Keywords: | secure multi-party computation sequencing problem secret sharing |
| 本文献已被 CNKI 维普 等数据库收录！ | |