中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Subject: Computer Science
Title:
secure multi-party computation protocol for sequencing problem
Author: Tang ChunMing ; Shi GuiHua ; Yao ZhengAn
Keyword: secure multi-party computation ; sequencing problem ; secret sharing
Source: SCIENCE CHINA-INFORMATION SCIENCES
Issued Date: 2011
Volume: 54, Issue:8, Pages:1654-1662
Indexed Type: SCI
Department: 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.
Sponsorship: National Natural Science Foundation of China10871222
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 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.
English 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 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.
Language: 英语
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/16079
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Tang ChunMing,Shi GuiHua,Yao ZhengAn. secure multi-party computation protocol for sequencing problem[J]. SCIENCE CHINA-INFORMATION SCIENCES,2011-01-01,54(8):1654-1662.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Tang ChunMing]'s Articles
[Shi GuiHua]'s Articles
[Yao ZhengAn]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Tang ChunMing]‘s Articles
[Shi GuiHua]‘s Articles
[Yao ZhengAn]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

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

 

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace