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

Communications in computer and information science

Secure Multi-Party Computation Using Pre-distributed Information from an Initializer

Amirreza Hamidi, Hossein Ghodosi

Published Jan 1, 2021• 0 citations
Publisher
DOI
10.1007/978-3-030-90553-8_8

Related papers

Unconditionally Fast Secure Multi-party Computation with Multi-depths Gates Using Pre-computed Information

Amirreza Hamidi, Hossein Ghodosi

Lecture notes in networks and systems•Jul 26, 2022•0 citations

Universally Composable Committed Oblivious Transfer With A Trusted Initializer

Adriana C. B. Pinto, Bernardo David, Jeroen van de Graaf +1 more

Committed Oblivious Transfer (COT) is a two-party primitive that combines one-out-of-two oblivious transfer with bit commitment. In the beginning of COT, a sender is committed to bits b0, b1 and a receiver to a choice bit c. In the end, the receiver is committed to bc without learning anything about b1-c, while the sender learns nothing about c. This primitive implies secure multi-party computation assuming that a broadcast channel is available. In this paper, we introduce the first universally composable unconditionally secure committed oblivious transfer protocol based on a Trusted Initializer (TI), which pre-distributes data to the parties. Our protocol builds on simple bit commitment and oblivious transfer protocols, using XOR commitments to prove simple relations in zero-knowledge. Besides providing very high security guarantees, our protocols are significantly simpler and more efficient than previous results, since they rely on pre-computed operations distributed by the TI.

Simpósio Brasileiro de Cibersegurança (SBSeg)•Nov 19, 2012•0 citations

Secure multi-party computation over networks

Yasuaki Nishitani, Yoshihide Igarashi

IEICE Transactions on Information and Systems•Mar 25, 2000•0 citations

Secure multi-party computation

Yan Huang

Elsevier eBooks•Jan 1, 2020•40 citations

Quantum Networks Based Multi-Party Secure Computation Protocol

Jincheng Zhang

This paper presents a novel protocol for secure multi-party computation (SMC) leveraging quantum networks and quantum key distribution (QKD). The core idea is to utilize the inherent security properties of QKD and quantum states to construct a secure computational environment, safeguarding the privacy of participants during distributed calculations. The protocol, termed Quantum Network-Based SMC (QN-SMC), employs a layered approach combining a classical pre-processing phase with a quantum computation phase secured by QKD. We detail the protocol's architecture, mathematical formulations, and security guarantees. The key contributions of this work lie in the integration of QKD into the SMC framework, enabling computation on distributed quantum states while maintaining confidentiality and integrity. We explore the feasibility and potential impact of this approach for applications requiring secure distributed processing within a quantum network. The protocol's performance is analyzed in terms of key distribution rates, computational overhead, and security levels.

•Aug 29, 2026•0 citations

Efficient Secure Multi-party Computation

Martin Hirt, Ueli M. Maurer, Bartosz Przydatek

Lecture notes in computer science•Jan 1, 2000•128 citations
Committed Oblivious Transfer (COT) is a two-party primitive that combines one-out-of-two oblivious transfer with bit commitment. In the beginning of COT, a sender is committed to bits b0, b1 and a receiver to a choice bit c. In the end, the receiver is committed to bc without learning anything about b1-c, while the sender learns nothing about c. This primitive implies secure multi-party computation assuming that a broadcast channel is available. In this paper, we introduce the first universally composable unconditionally secure committed oblivious transfer protocol based on a Trusted Initializer (TI), which pre-distributes data to the parties. Our protocol builds on simple bit commitment and oblivious transfer protocols, using XOR commitments to prove simple relations in zero-knowledge. Besides providing very high security guarantees, our protocols are significantly simpler and more efficient than previous results, since they rely on pre-computed operations distributed by the TI.
This paper presents a novel protocol for secure multi-party computation (SMC) leveraging quantum networks and quantum key distribution (QKD). The core idea is to utilize the inherent security properties of QKD and quantum states to construct a secure computational environment, safeguarding the privacy of participants during distributed calculations. The protocol, termed Quantum Network-Based SMC (QN-SMC), employs a layered approach combining a classical pre-processing phase with a quantum computation phase secured by QKD. We detail the protocol's architecture, mathematical formulations, and security guarantees. The key contributions of this work lie in the integration of QKD into the SMC framework, enabling computation on distributed quantum states while maintaining confidentiality and integrity. We explore the feasibility and potential impact of this approach for applications requiring secure distributed processing within a quantum network. The protocol's performance is analyzed in terms of key distribution rates, computational overhead, and security levels.