Universally Composable Subversion-Resilient Cryptography
Suvradip Chakraborty, Bernardo Magri, Jesper Buus Nielsen, Daniele Venturi
摘要
Subversion attacks undermine security of cryptographic protocols by replacing a legitimate honest party's implementation with one that leaks information in an undetectable manner. An important limitation of all currently known techniques for designing cryptographic protocols with security against subversion attacks is that they do not automatically guarantee security in the realistic setting where a protocol session may run concurrently with other protocols.
We remedy this situation by providing a foundation of reverse firewalls (Mironov and Stephens-Davidowitz, EUROCRYPT'15) in the universal composability (UC) framework (Canetti, FOCS'01 and J. ACM'20). More in details, our contributions are threefold:
- We generalize the UC framework to the setting where each party consists of a core (which has secret inputs and is in charge of generating protocol messages) and a firewall (which has no secrets and sanitizes the outgoing/incoming communication from/to the core). Both the core and the firewall can be subject to different flavors of corruption, modeling different kinds of subversion attacks.
For instance, we capture the setting where a subverted core looks like the honest core to any efficient test, yet it may leak secret information via covert channels (which we call specious subversion).
-
We show how to sanitize UC commitments and UC coin tossing against specious subversion, under the DDH assumption.
-
We show how to sanitize the classical GMW compiler (Goldreich, Micali and Wigderson, STOC 1987) for turning MPC with security in the presence of semi-honest adversaries into MPC with security in the presence of malicious adversaries. This yields a completeness theorem for maliciously secure MPC in the presence of specious subversion.
Additionally, all our sanitized protocols are transparent, in the sense that communicating with a sanitized core looks indistinguishable from communicating with an honest core. Thanks to the composition theorem, our methodology allows, for the first time, to design subversion-resilient protocols by sanitizing different sub-components in a modular way.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
相关 Paper
- Reverse Firewalls for Actively Secure MPCsSuvradip Chakraborty, Stefan Dziembowski, Jesper Buus NielsenCRYPTO 2020 · 被引用 28 次
- Guarding the Signal: Secure Messaging with Reverse FirewallsYevgeniy Dodis, Bernardo Magri, Noah Stephens-Davidowitz, Yiannis TselekounisCRYPTO 2025 · 被引用 1 次
- Reverse Firewalls for Oblivious Transfer Extension and Applications to Zero-KnowledgeSuvradip Chakraborty, Chaya Ganesh, Pratik SarkarEUROCRYPT 2023 · 被引用 11 次
- Maliciously Secure Massively Parallel Computation for All-but-One CorruptionsRex Fernando, Yuval Gelles, Ilan Komargodski, Elaine ShiCRYPTO 2022 · 被引用 2 次
- Round-Optimal Black-Box Protocol CompilersYuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram SrinivasanEUROCRYPT 2022 · 被引用 9 次
