Efficient and Secure Evaluation of Multivariate Polynomials and Applications

摘要：

In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants inputs with se curity against a malicious adversary who may corrupt all but one of the parties. Our protocols are round and communication efficient, and use the underlying cryptographic primitives in a blackbox way. Our con struction achieves optimal conlmunication complexity for degree 2 and 3 polynomials. Our constructions can be used to securely and efficiently realize a wide range of functionalities. For instance, we demonstrate how our tech niques lead to efficient protocols for secure linear algebra with security against malicious adversaries. Other applications include secure evalu ation of DNF/CNF formulas, and conditional secret reconstruction (or conditional oblivious transfer) for a large family of condition functions.

作者: Matthew Franklin Payman Mohassel

作者单位: Department of Computer Science, UC Davis Department of Computer Science, Univcrsity of Calgary

会议类型: 国际会议

会议名称: 8th International Conference,ACNS 2010(第八届国际应用密码与网络安全大会)

会议地点: 北京

会议语种:英文

页码: 236-254

在线出版日期: 2010-06-22（万方平台首次上网日期，不代表论文的发表时间）