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

Quantum Information Processing

Unconditionally secure multi-party quantum commitment scheme

Mingqiang Wang, Xue Wang, Tao Zhan

Published Dec 29, 2017• 5 citations
Publisher
DOI
10.1007/s11128-017-1804-7

Related papers

Unconditionally Secure Quantum Commitments with Preprocessing

Luowen Qian

arXiv:2311.18171•Lecture notes in computer science•Jan 1, 2024•13 citations

Unconditionally Secure Quantum Bit Commitment Protocol

최정운

•Jan 1, 2009•0 citations

Unconditionally secure multi-party quantum commitment scheme.

Mingqiang Wang, Xue Wang, Tao Zhan

A new unconditionally secure multi-party quantum commitment is proposed in this paper by encoding the committed message to the phase of a quantum state. Multi-party means that there are more than one recipient in our scheme. We show that our quantum commitment scheme is unconditional hiding and binding, and hiding is perfect. Our technique is based on the interference of phase-encoded coherent states of light. Its security proof relies on the no-cloning theorem of quantum theory and the properties of quantum information.

•Jan 1, 2017•0 citations

Study on Commitment Schemes of Secure Multi-party Computation

Xiaoqiang Guo, Yan Yan, Lihong Li +1 more

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.

Indonesian Journal of Electrical Engineering and Computer Science•Oct 1, 2014•0 citations

MULTI-PARTY SECURE COMPUTATION IN THE PROBLEM OF COLLISIONS PREVENTION

Oleg V. Kazarin

We show that some problems in information security can be solved without using one-way functions.The latter are usually regarded as a central concept of cryptography, but the very existence of one-way functions depends on difficult conjectures in complexity theory, most notably on the notorious "P = N P " conjecture.This is why cryptographic primitives that do not employ one-way functions are often called "unconditionally secure".In this paper, we suggest protocols for secure computation of the sum, product, and some other functions of two or more elements of an arbitrary constructible ring, without using any one-way functions.A new input that we offer here is that, in contrast with other proposals, we conceal "intermediate results" of a computation.For example, when we compute the sum of k numbers, only the final result is known to the parties; partial sums are not known to anybody.Other applications of our method include voting/rating over insecure channels and a rather elegant and efficient solution of the "two millionaires problem".Then, while it is fairly obvious that a secure (bit) commitment between two parties is impossible without a one-way function, we show that it is possible if the number of parties is at least 3.We also show how our unconditionally secure (bit) commitment scheme for 3 parties can be used to arrange an unconditionally secure (bit) commitment between just two parties if they use a "dummy" (e.g., a computer) as the third party.We explain how our concept of a "dummy" is different from a wellknown concept of a "trusted third party".Based on a similar idea, we also offer an unconditionally secure k-n oblivious transfer protocol between two parties who use a "dummy".We also suggest a protocol, without using a one-way function, for the so-called "mental poker", i.e., a fair card dealing (and playing) over distance.Finally, we propose a secret sharing scheme where an advantage over Shamir's and other known secret sharing schemes is that nobody, including the dealer, ends up knowing the shares (of the secret) owned by any particular player.It should be mentioned that computational cost of our protocols is negligible to the point that all of them can be executed without a computer.

Vestnik komp iuternykh i informatsionnykh tekhnologii•Jun 1, 2017•1 citation

Efficient semi-direct three-party quantum secure exchange of information

Nguyen Ba An

Physics Letters A•Sep 8, 2006•13 citations
A new unconditionally secure multi-party quantum commitment is proposed in this paper by encoding the committed message to the phase of a quantum state. Multi-party means that there are more than one recipient in our scheme. We show that our quantum commitment scheme is unconditional hiding and binding, and hiding is perfect. Our technique is based on the interference of phase-encoded coherent states of light. Its security proof relies on the no-cloning theorem of quantum theory and the properties of quantum information.
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.
We show that some problems in information security can be solved without using one-way functions.The latter are usually regarded as a central concept of cryptography, but the very existence of one-way functions depends on difficult conjectures in complexity theory, most notably on the notorious "P = N P " conjecture.This is why cryptographic primitives that do not employ one-way functions are often called "unconditionally secure".In this paper, we suggest protocols for secure computation of the sum, product, and some other functions of two or more elements of an arbitrary constructible ring, without using any one-way functions.A new input that we offer here is that, in contrast with other proposals, we conceal "intermediate results" of a computation.For example, when we compute the sum of k numbers, only the final result is known to the parties; partial sums are not known to anybody.Other applications of our method include voting/rating over insecure channels and a rather elegant and efficient solution of the "two millionaires problem".Then, while it is fairly obvious that a secure (bit) commitment between two parties is impossible without a one-way function, we show that it is possible if the number of parties is at least 3.We also show how our unconditionally secure (bit) commitment scheme for 3 parties can be used to arrange an unconditionally secure (bit) commitment between just two parties if they use a "dummy" (e.g., a computer) as the third party.We explain how our concept of a "dummy" is different from a wellknown concept of a "trusted third party".Based on a similar idea, we also offer an unconditionally secure k-n oblivious transfer protocol between two parties who use a "dummy".We also suggest a protocol, without using a one-way function, for the so-called "mental poker", i.e., a fair card dealing (and playing) over distance.Finally, we propose a secret sharing scheme where an advantage over Shamir's and other known secret sharing schemes is that nobody, including the dealer, ends up knowing the shares (of the secret) owned by any particular player.It should be mentioned that computational cost of our protocols is negligible to the point that all of them can be executed without a computer.