Secure two-party computation protocols for mapping-equivalence problem

Min Yao Ma; Shou Shan Luo; Li Cheng Wang

Secure two-party computation protocols for mapping-equivalence problem

Min Yao Ma^*
, Shou Shan Luo
, Li Cheng Wang

^*Corresponding author for this work

Beijing University of Posts and Telecommunications

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	5-8
Number of pages	4
Journal	Beijing Youdian Xueyuan Xuebao/Journal of Beijing University of Posts And Telecommunications
Volume	31
Issue number	6
Publication status	Published - Dec 2008
Externally published	Yes

Keywords

Cryptography
Equivalent relation
Finite full transformation semigroup
Mapping
Secure two-party computation

Cite this

@article{3d0604c2a9f84ef0b189409385a873dd,

title = "Secure two-party computation protocols for mapping-equivalence problem",

abstract = "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.",

keywords = "Cryptography, Equivalent relation, Finite full transformation semigroup, Mapping, Secure two-party computation",

author = "Ma, \{Min Yao\} and Luo, \{Shou Shan\} and Wang, \{Li Cheng\}",

year = "2008",

month = dec,

language = "English",

volume = "31",

pages = "5--8",

journal = "Beijing Youdian Xueyuan Xuebao/Journal of Beijing University of Posts And Telecommunications",

issn = "1000-5145",

publisher = "Beijing University of Posts and Telecommunications",

number = "6",

}

TY - JOUR

T1 - Secure two-party computation protocols for mapping-equivalence problem

AU - Ma, Min Yao

AU - Luo, Shou Shan

AU - Wang, Li Cheng

PY - 2008/12

Y1 - 2008/12

N2 - 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.

AB - 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.

KW - Cryptography

KW - Equivalent relation

KW - Finite full transformation semigroup

KW - Mapping

KW - Secure two-party computation

UR - https://www.scopus.com/pages/publications/58949096811

M3 - Article

AN - SCOPUS:58949096811

SN - 1000-5145

VL - 31

SP - 5

EP - 8

JO - Beijing Youdian Xueyuan Xuebao/Journal of Beijing University of Posts And Telecommunications

JF - Beijing Youdian Xueyuan Xuebao/Journal of Beijing University of Posts And Telecommunications

IS - 6

ER -

Secure two-party computation protocols for mapping-equivalence problem

Abstract

Keywords

Other files and links

Fingerprint

Cite this