18 Nov 2026, Wed

"HELLO, GOODBYE": New Cryptographic Compiler Achieves Concurrent General Composition With Minimal Round Overhead

Cryptographers have long wrestled with a fundamental tension in secure multi-party computation: how to ensure that protocols remain secure when many of them execute concurrently in the wild. A seminal 2006 result by Benny Lindell, Yehuda Lindell, and Tal Rabin established that any standalone-secure synchronous multi-party computation protocol could be adapted to withstand concurrent general composition. However, that traditional transformation came with a heavy cost, requiring the insertion of a synchronization step after every single round of the protocol—a process that at least doubled the overall round complexity.

Now, a new research paper authored by Anirudh Chandramouli of Bar-Ilan University, titled "HELLO, GOODBYE: Concurrent General Composition From Super-Rushing Security" (Cryptology ePrint Archive, Paper 2026/2651), demonstrates a dramatic efficiency breakthrough. Chandramouli shows that for a specific class of protocols, the massive round overhead can be slashed down to a mere two synchronization steps, regardless of how many rounds the underlying protocol originally required.

The Power of Super-Rushing Security

The key to this dramatic efficiency gain lies in a recently introduced cryptographic primitive known as "super-rushing security." Originally formulated by Asharov, Chandramouli, Cohen, and Ishai at EuroCrypt 2025, super-rushing adversaries possess an enhanced capability to manipulate message delivery in synchronous networks. While traditional rushing adversaries can see honest parties’ messages in a given round before deciding their own, super-rushing models push the boundaries of adversarial power even further, necessitating stronger structural guarantees from the underlying protocols.

Chandramouli’s latest work proves that if an $R$-round synchronous protocol is already secure against super-rushing adversaries—and utilizes a black-box, straight-line simulator—it can be successfully compiled into a protocol secure under concurrent general composition with an overhead of only two additional rounds.

The mechanism behind the compiler is conceptually straightforward, drawing on the friendly greetings implied by the paper’s title. By adding a single round of start synchronization—effectively a network-wide "HELLO"—and a concluding round of end synchronization—a network-wide "GOODBYE"—the protocol achieves concurrent general composition with selective abort in a total of $R+2$ rounds. Furthermore, the security properties can be further upgraded; if the final "GOODBYE" end-synchronization round is conducted over a reliable broadcast channel, the security guarantee rises from selective abort to unanimous abort.

Crucially, these compilers do not dilute the security guarantees of the original framework. Both compilers incur zero loss in the security reduction and faithfully preserve the exact flavor of security—whether perfect, statistical, or computational—inherent in the underlying synchronous protocol.

The practical implications of this finding are amplified when combined with existing cryptographic literature. By pairing Chandramouli’s compilers with the sufficient conditions for perfect security established by Asharov et al., as well as the round-preserving super-rushing compilers recently introduced by Ciampi, Ravi, and Zou in Cryptology ePrint Archive 2026/1745 for statistical and computational security, researchers now have a direct pathway to transform rushing-secure protocols into concurrently secure ones with an additive overhead capped at just two rounds.

Extending to Trusted Setup Models and Adaptive Inputs

While the basic compilers function effectively in standard settings, modern multi-party computation—particularly in dishonest majority scenarios—frequently relies on a trusted setup, such as a Common Reference String (CRS) or a Public-Key Infrastructure (PKI). Extending concurrent composition results to these setup-hybrid models has historically presented complex challenges.

Chandramouli successfully extends the "HELLO, GOODBYE" compilers to protocols operating within a trusted setup, provided two strict structural conditions are met. First, every individual execution of the protocol must utilize its own isolated, stateless copy of the setup. The responses generated by this setup toward the adversary must remain entirely independent of the interactions and behaviors of the honest parties. This specific requirement explicitly rules out shared setups, such as a single global common reference string or a unified public-key infrastructure accessed across every concurrent execution in the system.

Second, the underlying protocol must achieve security against super-rushing adversaries under a more demanding condition: adaptive inputs. This means the protocol must remain secure even when the participants choose their private inputs after they have already interacted with the trusted setup. Under these precise conditions, Chandramouli demonstrates that the same "HELLO, GOODBYE" compilers successfully yield security under concurrent general composition.

At the same time, the research highlights the absolute necessity of these stringent requirements, proving that they cannot be easily weakened. Chandramouli shows that adaptive inputs cannot be relaxed to the conventional, weaker notions of security typically employed in the setup-hybrid model. To illustrate this limitation, the paper presents a concrete counterexample: a protocol that achieves statistical security against super-rushing adversaries with guaranteed output delivery under the standard hybrid model, yet completely breaks down under concurrent general composition once the "HELLO" and "GOODBYE" synchronization rounds are added—even when restricted to selective abort.

The paper concludes by providing the formal cryptographic definitions, proofs, and foundational theorems necessary to anchor these new compilation techniques within the broader landscape of secure computation theory, offering a streamlined path toward efficient, concurrently secure multi-party protocols.

By Nana

Leave a Reply

Your email address will not be published. Required fields are marked *