On the (Quantum) Communication Complexity of Secure MPC from a Random Oracle

Reported by arXiv cs.CR (Alexander Hoover, Giuseppe Persiano, Kevin Yeo)

Summary by Cyber Security News4 Nov 2026, 06:00 CET

About this summary. This is a short excerpt from the description that arXiv cs.CR published with its article. Cyber Security News did not report or verify the underlying story. Read the original: https://arxiv.org/abs/2611.04052

arXiv:2611.04052v1 Announce Type: new Abstract: Information-theoretic MPC among $n$ parties with $t$ corruptions can securely evaluate a circuit $C$ with $O(|C| \cdot t/(n-t))$ online communication in the preprocessing model and $O(|C| \cdot t/(n-2t))$ communication in the honest majority setting. Damg{\aa}rd, Larsen and Nielsen (CRYPTO 2019) showed that both communication bounds are tight for inner products.

Read the full article at arXiv cs.CR →

Source attribution: headline and facts are from arXiv cs.CR (arxiv.org). Summary method: excerpt of the source description. See our source attribution policy.

Related coverage

Evaluating Structural and SAT Attack Resilience in Cryptographic Dynamic Logic Locking via Keystream Capping

On-Chain Archaeology of Bitcoin Oracles: Evidence of Use under Limited Observability

Simple Extremely Lossy Functions from Small-Exponent Hashing

SoK: Stablecoins in the Quantum Era

Revisiting Elliptic++ for Bitcoin Forensics: Feature Reconstruction and Leakage-Resistant Evaluation

The Native Menace: Host-to-Browser Cross-Boundary Attacks via Native Messaging