ISCAS OpenIR
secure multi-party computation protocol for sequencing problem
Tang ChunMing; Shi GuiHua; Yao ZhengAn
2011
发表期刊SCIENCE CHINA-INFORMATION SCIENCES
ISSN1674-733X
卷号54期号:8页码:1654-1662
摘要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.; 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.
收录类别SCI
关键词Secure Multi-party Computation Sequencing Problem Secret Sharing
部门归属Tang 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.
学科领域Computer Science
资助者National Natural Science Foundation of China10871222
语种英语
内容类型期刊论文
URI标识http://ir.iscas.ac.cn/handle/311060/16079
专题中国科学院软件研究所
推荐引用方式
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.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Tang ChunMing]的文章
[Shi GuiHua]的文章
[Yao ZhengAn]的文章
百度学术
百度学术中相似的文章
[Tang ChunMing]的文章
[Shi GuiHua]的文章
[Yao ZhengAn]的文章
必应学术
必应学术中相似的文章
[Tang ChunMing]的文章
[Shi GuiHua]的文章
[Yao ZhengAn]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。