Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Indonesian Journal of Electrical Engineering and Computer Science

Study on Commitment Schemes of Secure Multi-party Computation

Xiaoqiang Guo, Yan Yan, Lihong Li, Hong Wang

Published Oct 1, 2014• 0 citations
Publisher

Abstract

The problem of secure multi-party computation(SMPC) is one of the most fundamental problems in information security. First, we introduce the basic concept of SMPC and four SMPC basic agreement: key distribution,oblivious transfer, bit commitment and zero knowledge proof. Secondly, we separately illustrate commitment schemes  commitment transfer protocol, commitment sharing protocol and commitment multiplication protocol. Finally, we present unconditionally secure multi-party computation with a passive adversary, an active adversary, general adversary structures.

DOI
10.11591/ijeecs.v12.i10.pp7523-7532

Related papers

Information theory and secure multi-party computation

Ueli M. Maurer

Two types of generalizations in secure multi-party computation are described. First, we report on a new general adversary model: while previous protocols were designed to tolerate misbehavior of one of two types (active or passive adversaries) the new protocols tolerate mixed types of adversaries, i.e. an adversary that can corrupt players actively, passively, or can let them crash (i.e. stop execution). We derive the necessary and sufficient conditions under which such a general adversary can be tolerated. Second, we present a generic protocol framework that unifies previous approaches achieving unconditional (or information-theoretic) security and cryptographic security (i.e. security based on a cryptographic intractability assumption). This is achieved by introducing secret sharing schemes with an additional property called the multiplication property and a new type of homomorphic commitment scheme, and by generalizing the concept of commitments.

IEEE Information Theory Workshop (ITW)•Nov 27, 2002•0 citations

An efficient PMPC protocol

Jianhua Ge

The private multi-party computation protocol proposed by Claude Crepeau etc.is not only complicated but very inefficient.This paper describes a new protocol with an efficient global commitment transfer sub-protocol.With a first two round string oblivious transfer,the protocol can avoid performing a large mount of bit oblivious transfers.And with bit commitment with XOR,zero knowledge proofs are very easy.This PMPC protocol is conceptually simple and more efficient.The security and complexity of the protocol are also discussed in this paper.

Journal of Circuits and Systems•Jan 1, 2008•0 citations

Analysis on the key techniques of secure multiparty computation

Hong Zhong

Secure Multiparty Computation technique plays an important role in the security research of distributed systems.This paper firstly summarizes the advances in theoretical and practical studies on SMC,and then analysis the basic protocols and its related cryptographic algorithms.Secondly,the key tools,secret share,homomorphic public key cryptography,mix network,zero knowledge proof,oblivious transfer and private comparison protocol in implementation SMC are studied deeply.Finally,some research directions in this area are also proposed.

Anhui Nongye Daxue xuebao•Jan 1, 2007•1 citation

An efficient resource-fair commit-prove-fair-open protocol

Ou Ruan, Zhou Jing, Mingwu Zhang

With the development of modern internet and mobile networks, there is an increasing need for privacy-preserving cooperative computation and cloud computing. Secure multi-party computation (SMPC) gives a general solution to these applications and has become a hot topic in privacy-carrying protocols. The commit-prove-fair-open protocol is one of multi-party fair exchange protocols against the malicious adversary in breaking the fair play of the participants, and it provides an important tool of SMPC to make it possible to achieve the fairness with corrupted majority according to the standard real/ideal world simulation paradigm framework. In this paper, we at first prove two lemmas about the simplified Camenisch-Shoup commitment and the time-lines, and then propose a very efficient resource-fair commit-prove-fair-open protocol. Compared with the other commit-prove-fair-open protocols, our new protocol enjoys two important advantages: 1) communications cost and computations price are less than 20%; 2) it allows commitment to obtain value 0, which is not implemented in the other constructions.

International Journal of Electronic Security and Digital Forensics•Dec 29, 2015•0 citations

Secure multiparty quantum computation based on bit commitment

Min Liang

This paper studies secure multiparty quantum computation (SMQC) without nonlocal measurements. Firstly, this task is reduced to secure two-party quantum computation of nonlocal controlled-NOT (NL-CNOT) gate. Then, in the passive adversaries model, the secure computation of NL-CNOT is reduced to bit commitment. Thus, a SMQC scheme can be constructed based on bit commitment. This scheme does not depend on trusted third party, and is secure in the passive adversaries model. It is also pointed out that a vulnerability exists in any secure two-party quantum computation protocol of NL-CNOT gate.

arXiv:1306.0447•Jun 3, 2013•1 citation

Anonymous System for Fully Distributed and Robust Secure Multi-Party Computation

Andreas Klinger, Felix Battermann, Ulrike Meyer

In secure multi-party computation (SMPC), it is considered that multiple parties that are known to each other evaluate a function over their private inputs in a secure fashion. The participating parties do not learn anything about each other's private inputs beyond what can be deduced from their own input and output. The assumption that the parties know each other, however, does not seem suitable for all potential applications of SMPC. In some applications participants may not only want to hide their private inputs and outputs, but may also want to hide the fact that they are participating in a given function evaluation in the first place. We therefore propose an anonymous system for SMPC that allows parties to anonymously evaluate a function of their private inputs in a fully distributed and secure fashion. The proposed system allows authorized parties to execute an SMPC protocol robust with penalty against a dishonest majority in the presence of a malicious adversary. During the protocol execution, the system guarantees that all participating parties stay anonymous w. r. t. each other as well as any third parties. In addition, it guarantees that in each function evaluation all participating parties are unique, i. e., no party can participate as more than one entity.

ACM Conference on Data and Application Security and Privacy (CODASPY)•Apr 20, 2023•1 citation
The problem of secure multi-party computation(SMPC) is one of the most fundamental problems in information security. First, we introduce the basic concept of SMPC and four SMPC basic agreement: key distribution,oblivious transfer, bit commitment and zero knowledge proof. Secondly, we separately illustrate commitment schemes  commitment transfer protocol, commitment sharing protocol and commitment multiplication protocol. Finally, we present unconditionally secure multi-party computation with a passive adversary, an active adversary, general adversary structures.
Two types of generalizations in secure multi-party computation are described. First, we report on a new general adversary model: while previous protocols were designed to tolerate misbehavior of one of two types (active or passive adversaries) the new protocols tolerate mixed types of adversaries, i.e. an adversary that can corrupt players actively, passively, or can let them crash (i.e. stop execution). We derive the necessary and sufficient conditions under which such a general adversary can be tolerated. Second, we present a generic protocol framework that unifies previous approaches achieving unconditional (or information-theoretic) security and cryptographic security (i.e. security based on a cryptographic intractability assumption). This is achieved by introducing secret sharing schemes with an additional property called the multiplication property and a new type of homomorphic commitment scheme, and by generalizing the concept of commitments.
The private multi-party computation protocol proposed by Claude Crepeau etc.is not only complicated but very inefficient.This paper describes a new protocol with an efficient global commitment transfer sub-protocol.With a first two round string oblivious transfer,the protocol can avoid performing a large mount of bit oblivious transfers.And with bit commitment with XOR,zero knowledge proofs are very easy.This PMPC protocol is conceptually simple and more efficient.The security and complexity of the protocol are also discussed in this paper.
Secure Multiparty Computation technique plays an important role in the security research of distributed systems.This paper firstly summarizes the advances in theoretical and practical studies on SMC,and then analysis the basic protocols and its related cryptographic algorithms.Secondly,the key tools,secret share,homomorphic public key cryptography,mix network,zero knowledge proof,oblivious transfer and private comparison protocol in implementation SMC are studied deeply.Finally,some research directions in this area are also proposed.
With the development of modern internet and mobile networks, there is an increasing need for privacy-preserving cooperative computation and cloud computing. Secure multi-party computation (SMPC) gives a general solution to these applications and has become a hot topic in privacy-carrying protocols. The commit-prove-fair-open protocol is one of multi-party fair exchange protocols against the malicious adversary in breaking the fair play of the participants, and it provides an important tool of SMPC to make it possible to achieve the fairness with corrupted majority according to the standard real/ideal world simulation paradigm framework. In this paper, we at first prove two lemmas about the simplified Camenisch-Shoup commitment and the time-lines, and then propose a very efficient resource-fair commit-prove-fair-open protocol. Compared with the other commit-prove-fair-open protocols, our new protocol enjoys two important advantages: 1) communications cost and computations price are less than 20%; 2) it allows commitment to obtain value 0, which is not implemented in the other constructions.
This paper studies secure multiparty quantum computation (SMQC) without nonlocal measurements. Firstly, this task is reduced to secure two-party quantum computation of nonlocal controlled-NOT (NL-CNOT) gate. Then, in the passive adversaries model, the secure computation of NL-CNOT is reduced to bit commitment. Thus, a SMQC scheme can be constructed based on bit commitment. This scheme does not depend on trusted third party, and is secure in the passive adversaries model. It is also pointed out that a vulnerability exists in any secure two-party quantum computation protocol of NL-CNOT gate.
In secure multi-party computation (SMPC), it is considered that multiple parties that are known to each other evaluate a function over their private inputs in a secure fashion. The participating parties do not learn anything about each other's private inputs beyond what can be deduced from their own input and output. The assumption that the parties know each other, however, does not seem suitable for all potential applications of SMPC. In some applications participants may not only want to hide their private inputs and outputs, but may also want to hide the fact that they are participating in a given function evaluation in the first place. We therefore propose an anonymous system for SMPC that allows parties to anonymously evaluate a function of their private inputs in a fully distributed and secure fashion. The proposed system allows authorized parties to execute an SMPC protocol robust with penalty against a dishonest majority in the presence of a malicious adversary. During the protocol execution, the system guarantees that all participating parties stay anonymous w. r. t. each other as well as any third parties. In addition, it guarantees that in each function evaluation all participating parties are unique, i. e., no party can participate as more than one entity.