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

Analyzing the Security of Three-State Protocols Using Information-Theoretic

Zhenye Du, Youlong Yang

Published Jan 1, 2022• 0 citations
Publisher
DOI
10.2139/ssrn.4117404

Related papers

Efficient Three-party Computation: An Information-theoretic Approach from Cut-and-Choose

Zhili Chen

As far as we know, the literature on secure computation from cut-and-choose has focused on achieving computational security against malicious adversaries. It is unclear whether the idea of cut-and-choose can be adapted to secure computation with information-theoretic security. In this work we explore the possibility of using cut-and-choose in information theoretic setting for secure three-party computation (3PC). Previous work on 3PC has mainly focus on the semi-honest case, and is motivated by the observation that real-word deployments of multi-party computation (MPC) seem to involve few parties. We propose a new protocol for information-theoretically secure 3PC tolerating one malicious party with cheating probability $2^{-s}$ using $s$ runs of circuit computation in the cut-and-choose paradigm. The computational cost of our protocol is essentially only a small constant worse than that of state-of-the-art 3PC protocols against a semi-honest corruption, while its communication round is greatly reduced compared to other maliciously secure 3PC protocols in information-theoretic setting.

arXiv:1908.03718•Aug 10, 2019•1 citation

An Information-Theoretic Approach for Secure Protocol Composition

Yi-Ting Chiang, Tsan‐sheng Hsu, Churn‐Jung Liau +4 more

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering•Jan 1, 2015•3 citations

Information Theoretic Security

Lecture notes in computer science•Jan 1, 2009•142 citations

Fast and Secure Three-party Computation: The Garbled Circuit Approach

Payman Mohassel, Mike Rosulek, Ye Zhang

Many deployments of secure multi-party computation (MPC) in practice have used information-theoretic three-party protocols that tolerate a single, semi-honest corrupt party, since these protocols enjoy very high efficiency. We propose a new approach for secure three-party computation (3PC) that improves security while maintaining practical efficiency that is competitive with traditional information-theoretic protocols. Our protocol is based on garbled circuits and provides security against a single, malicious corrupt party. Unlike information-theoretic 3PC protocols, ours uses a constant number of rounds. Our protocol only uses inexpensive symmetric-key cryptography: hash functions, block ciphers, pseudorandom generators (in particular, no oblivious transfers) and has performance that is comparable to that of Yao's (semi-honest) 2PC protocol.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Oct 6, 2015•114 citations

On the security of three-party cryptographic protocols

Shouhuai Xu, Gendu Zhang, Hong Zhu

ACM SIGOPS Operating Systems Review•Jul 1, 1998•1 citation

Quantum Public Key Encryption Protocol Based on Decoy States and Hash Function

Zedong Li, Jingtao Wang, X Chen

Quantum key distribution provides an effective means for achieving information-theoretically secure communication. Recently, Fu et al. proposed a quantum public key cryptography based on Bell states. However, this protocol cannot guarantee the integrity of information when facing tampering attacks. In this study, we first analyze the security vulnerabilities of the protocol, and then introduces the ideas of decoy states and hash functions to propose an improved quantum public key cryptography protocol. In addition, the use of unordered methods further ensures the security of information. After security analysis, it was found that this protocol can resist tampering attacks and has eavesdropping detection, which has higher security compared to existing protocols.

International Symposium on AI and Cybersecurity (ISAICS)•Oct 24, 2025•0 citations
As far as we know, the literature on secure computation from cut-and-choose has focused on achieving computational security against malicious adversaries. It is unclear whether the idea of cut-and-choose can be adapted to secure computation with information-theoretic security. In this work we explore the possibility of using cut-and-choose in information theoretic setting for secure three-party computation (3PC). Previous work on 3PC has mainly focus on the semi-honest case, and is motivated by the observation that real-word deployments of multi-party computation (MPC) seem to involve few parties. We propose a new protocol for information-theoretically secure 3PC tolerating one malicious party with cheating probability 2−s2^{-s}2−s using sss runs of circuit computation in the cut-and-choose paradigm. The computational cost of our protocol is essentially only a small constant worse than that of state-of-the-art 3PC protocols against a semi-honest corruption, while its communication round is greatly reduced compared to other maliciously secure 3PC protocols in information-theoretic setting.
Many deployments of secure multi-party computation (MPC) in practice have used information-theoretic three-party protocols that tolerate a single, semi-honest corrupt party, since these protocols enjoy very high efficiency. We propose a new approach for secure three-party computation (3PC) that improves security while maintaining practical efficiency that is competitive with traditional information-theoretic protocols. Our protocol is based on garbled circuits and provides security against a single, malicious corrupt party. Unlike information-theoretic 3PC protocols, ours uses a constant number of rounds. Our protocol only uses inexpensive symmetric-key cryptography: hash functions, block ciphers, pseudorandom generators (in particular, no oblivious transfers) and has performance that is comparable to that of Yao's (semi-honest) 2PC protocol.
Quantum key distribution provides an effective means for achieving information-theoretically secure communication. Recently, Fu et al. proposed a quantum public key cryptography based on Bell states. However, this protocol cannot guarantee the integrity of information when facing tampering attacks. In this study, we first analyze the security vulnerabilities of the protocol, and then introduces the ideas of decoy states and hash functions to propose an improved quantum public key cryptography protocol. In addition, the use of unordered methods further ensures the security of information. After security analysis, it was found that this protocol can resist tampering attacks and has eavesdropping detection, which has higher security compared to existing protocols.