QQ客服 官方微博 反馈留言

	Parallel multi-party computation from linear multi-secret sharing schemes
	Zhang, ZF; Liu, ML; Xiao, LL
刊名	ADVANCES IN CRYPTOLOGY ASIACRYPT 2005
	2005
卷号	3788页码:156-173
ISSN号	0302-9743
英文摘要	As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against an adversary with multistructures. Precisely, there are m functions f(1), ..., f(m) and m adversary structures A(1), ..., A(m), where f(i) is required to be securely computed against an A(i)-adversary. We give a general construction to build a parallel multi-party computation protocol from any linear multi-secret sharing scheme (LMSSS), provided that the access structures of the LMSSS allow MPC at all. When computing complicated functions, our protocol has more advantage in communication complexity than the "direct sum" method which actually executes a MPC protocol for each function. The paper also provides an efficient and generic construction to obtain from any LMSSS a multiplicative LMSSS for the same multi-access structure.
WOS研究方向	Computer Science
语种	英语
出版者	SPRINGER-VERLAG BERLIN
WOS记录号	WOS:000234879200009
内容类型	期刊论文
源URL	[http://ir.amss.ac.cn/handle/2S8OKBNM/1506]
专题	系统科学研究所
通讯作者	Zhang, ZF
作者单位	1.Chinese Acad Sci, Key Lab Math Mechanizat, Acad Math & Syst Sci, Beijing 100080, Peoples R China 2.Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Zhang, ZF,Liu, ML,Xiao, LL. Parallel multi-party computation from linear multi-secret sharing schemes[J]. ADVANCES IN CRYPTOLOGY ASIACRYPT 2005,2005,3788:156-173.
APA	Zhang, ZF,Liu, ML,&Xiao, LL.(2005).Parallel multi-party computation from linear multi-secret sharing schemes.ADVANCES IN CRYPTOLOGY ASIACRYPT 2005,3788,156-173.
MLA	Zhang, ZF,et al."Parallel multi-party computation from linear multi-secret sharing schemes".ADVANCES IN CRYPTOLOGY ASIACRYPT 2005 3788(2005):156-173.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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