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

Lecture notes in computer science

On the Message Complexity of Secure Multiparty Computation

Yuval Ishai, Manika Mittal, Rafail Ostrovsky

Published Jan 1, 2018• 7 citations
Publisher
DOI
10.1007/978-3-319-76578-5_24

Related papers

The Broadcast Message Complexity of Secure Multiparty Computation

Sanjam Garg, Aarushi Goel, Abhishek Jain

Lecture notes in computer science•Jan 1, 2019•1 citation

Simultaneous-Message and Succinct Secure Computation: Reusable and Multiparty Protocols

Siddharth Agarwal, Abhishek Jain, Akshayaram Srinivasan +1 more

Lecture notes in computer science•Jan 1, 2026•0 citations

Tight Bounds on the Randomness Complexity of Secure Multiparty Computation

Vipul Goyal, Yuval Ishai, Yifan Song

Lecture notes in computer science•Jan 1, 2022•2 citations

Perfectly-Secure Multiparty Computation with Linear Communication Complexity over Any Modulus

Daniel E. Escudero, Yifan Song, Wenhao Wang

Lecture notes in computer science•Dec 11, 2024•5 citations

Counterfactual All‐Or‐Nothing Oblivious Transfer for Quantum Messages

Xiao‐Qiu Cai, Yu‐Guang Yang, Tian‐Yin Wang +2 more

Abstract Oblivious transfer (OT) protocol is an essential building block for secure multiparty computation. The transmission of quantum messages is conductive in executing complex secure multiparty quantum computation tasks and even distributed quantum computation tasks. However, as an important form of OT protocol, existing all‐or‐nothing OT protocols only work for the transmission of classical messages thus limiting application scenarios. To tackle this issue, a counterfactual all‐or‐nothing OT protocol is proposed for quantum messages. Compared with existing all‐or‐nothing OT protocols for classical messages, the proposed protocol has three advantages: i) it is achieved without any physical particles traveling between the sender and the receiver thus reducing the communication complexity; ii) no prior entanglement between the sender and the receiver is required thus facilitating protocol implementation, and iii) it works for known even unknown quantum messages thereby offering broader application scenarios.

Advanced Quantum Technologies•Jan 6, 2025•10 citations

On the Communication Complexity of Secure Computation

Deepesh Data, Manoj M. Prabhakaran, Vinod M. Prabhakaran

arXiv:1311.7584•Lecture notes in computer science•Jan 1, 2014•53 citations
Abstract Oblivious transfer (OT) protocol is an essential building block for secure multiparty computation. The transmission of quantum messages is conductive in executing complex secure multiparty quantum computation tasks and even distributed quantum computation tasks. However, as an important form of OT protocol, existing all‐or‐nothing OT protocols only work for the transmission of classical messages thus limiting application scenarios. To tackle this issue, a counterfactual all‐or‐nothing OT protocol is proposed for quantum messages. Compared with existing all‐or‐nothing OT protocols for classical messages, the proposed protocol has three advantages: i) it is achieved without any physical particles traveling between the sender and the receiver thus reducing the communication complexity; ii) no prior entanglement between the sender and the receiver is required thus facilitating protocol implementation, and iii) it works for known even unknown quantum messages thereby offering broader application scenarios.