跳到主要导航 跳到搜索 跳到主要内容

Secure two-party computation protocols for mapping-equivalence problem

  • Min Yao Ma*
  • , Shou Shan Luo
  • , Li Cheng Wang
  • *此作品的通讯作者
  • Beijing University of Posts and Telecommunications

科研成果: 期刊稿件 › 文章 › 同行评审

摘要

Secure multi-party computation protocol allows a set of n-parties to evaluate a joint function of their inputs such that the function is calculated correctly and furthermore no information about their inputs is revealed by the output of the function. Based on the determinate-commutative cryptosystem and under the semi-honest model hypothesis, secure two-party computation protocols for determine whether an element is belong to a certain finite set, whether two finite sets are equal, and whether two equivalence relations are equal are considered. A mathematic method, relates to kernel, image and kernel-classes of mapping, to determine whether two mappings are equal is introduced. Furthermore, two-party computation protocol for determine whether two mappings are equal is given. Correctness, security, and efficiency of our protocols are analyzed.

源语言英语
页(从-至)5-8
页数4
期刊Beijing Youdian Xueyuan Xuebao/Journal of Beijing University of Posts And Telecommunications
卷31
期6
出版状态已出版 - 12月 2008
已对外发布是

学术指纹

探究 'Secure two-party computation protocols for mapping-equivalence problem' 的科研主题。它们共同构成独一无二的学术指纹。

引用此