ISCAS OpenIR
secure multi-party computation protocol for sequencing problem
Tang ChunMing; Shi GuiHua; Yao ZhengAn
2011
SourceSCIENCE CHINA-INFORMATION SCIENCES
ISSN1674-733X
Volume54Issue:8Pages:1654-1662
English AbstractIn 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 a (c) 1/2 (n - 1)/2 participants, and an active adversary that can corrupt at most t < n/3 participants. The simplest sequencing problem is the Millionaires' problem.; 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 a (c) 1/2 (n - 1)/2 participants, and an active adversary that can corrupt at most t < n/3 participants. The simplest sequencing problem is the Millionaires' problem.
Indexed TypeSCI
KeywordSecure Multi-party Computation Sequencing Problem Secret Sharing
DepartmentTang ChunMing; Shi GuiHua Guangzhou Univ Sch Math & Informat Sci Guangzhou 510006 Guangdong Peoples R China. Tang ChunMing Chinese Acad Sci State Key Lab Informat Secur Inst Software Sci Beijing 100080 Peoples R China. Yao ZhengAn Sun Yat Sen Univ Sch Math & Computat Sci Guangzhou 510275 Guangdong Peoples R China.
SubjectComputer Science
SponsorshipNational Natural Science Foundation of China10871222
Language英语
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/16079
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
Tang ChunMing,Shi GuiHua,Yao ZhengAn. secure multi-party computation protocol for sequencing problem[J]. SCIENCE CHINA-INFORMATION SCIENCES,2011,54(8):1654-1662.
APA Tang ChunMing,Shi GuiHua,&Yao ZhengAn.(2011).secure multi-party computation protocol for sequencing problem.SCIENCE CHINA-INFORMATION SCIENCES,54(8),1654-1662.
MLA Tang ChunMing,et al."secure multi-party computation protocol for sequencing problem".SCIENCE CHINA-INFORMATION SCIENCES 54.8(2011):1654-1662.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Tang ChunMing]'s Articles
[Shi GuiHua]'s Articles
[Yao ZhengAn]'s Articles
Baidu academic
Similar articles in Baidu academic
[Tang ChunMing]'s Articles
[Shi GuiHua]'s Articles
[Yao ZhengAn]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Tang ChunMing]'s Articles
[Shi GuiHua]'s Articles
[Yao ZhengAn]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.