Private Signaling
Varun Madathil, Alessandra Scafuro, István András Seres, Omer Shlomovits, Denis Varlakov
摘要
We introduce the problem of private signaling. In this problem, a sender posts a message on a certain location of a public bulletin board, and then posts a signal that allows only the intended recipient (and no one else) to learn that it is the recipient of the message posted at that location. Besides privacy, two efficiency requirements must be met. First, the sender and recipient do not participate in any out-of-band communication. Second, the overhead of the recipient must be (much) better than scanning the entire board. Existing techniques, such as server-aided fuzzy message detection (Beck et al., CCS'21), could be employed to solve the private signaling problem. However, this solution leads to a trade-off between privacy and efficiency, where the complexity of the recipient grows with the required privacy. Specifically, this would require a scan of the entire board to obtain full privacy for the recipient. In this work, we present a server-aided solution to the private signaling problem that guarantees full privacy for all recipients while requiring only constant amount of work for both the recipient and the sender. Specifically, we provide three contributions: First, we provide a formal definition of private signaling in the Universal Composability (UC) framework and show that it captures several realworld settings where recipient anonymity is desired. Second, we present two server-aided protocols that UC-realize our definitions: one using a single server equipped with a trusted execution environment, and one based on two servers that employ garbled circuits. Third, we provide an open-source implementation of both of our protocols, evaluate their performance, and identify for which sets of parameters they can be practical.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper5
- Oblivious Message RetrievalZeyu Liu, Eran TromerCRYPTO 2022 · 被引用 28 次
- InstantOMR: Oblivious Message Retrieval with Low Latency and Optimal ParallelizabilityHaofei Liang, Zeyu Liu, Eran Tromer, Xiang Xie 等USENIX Security 2026
- Oblivious SignalingMirza Kamrul Bashar Shuhan, Foteini Baldimtsi, Giuseppe AtenieseUSENIX Security 2026
- SophOMR: Improved Oblivious Message Retrieval from SIMD-Aware Homomorphic CompressionKeewoo Lee, Yongdong YeoUSENIX Security 2026
- Comprehensive Deniability Analysis of Signal Handshake Protocols: X3DH, PQXDH to Fully Post-Quantum with Deniable Ring SignaturesShuichi Katsumata, Guilhem Niot, Ida Tucker, Thom WiggersUSENIX Security 2025
它引用的顶会 Paper3
- An Empirical Analysis of Anonymity in ZcashGeorge Kappos, Haaroon Yousaf, Mary Maller, Sarah MeiklejohnUSENIX Security 2018 · 被引用 171 次
- BITE: Bitcoin Lightweight Client Privacy using Trusted ExecutionSinisa Matetic, Karl Wüst, Moritz Schneider, Kari Kostiainen 等USENIX Security 2019 · 被引用 109 次
- Garbling Gadgets for Boolean and Arithmetic CircuitsMarshall Ball, Tal Malkin, Mike RosulekCCS 2016 · 被引用 81 次
相关 Paper
- Private Signaling Secure Against Actively Corrupted ServersHaotian Chu, Xiao Wang, Yanxue JiaCCS 2026 · 被引用 3 次
- Fuzzy Message DetectionGabrielle Beck, Julia Len, Ian Miers, Matthew GreenCCS 2021
- How to Hide MetaData in MLS-Like Secure Group Messaging: Simple, Modular, and Post-QuantumKeitaro Hashimoto, Shuichi Katsumata, Thomas PrestCCS 2022 · 被引用 12 次
- On Active Attack Detection in Messaging with Immediate DecryptionKhashayar Barooti, Daniel Collins, Simone Colombo, Loïs Huguenin-Dumittan 等CRYPTO 2023 · 被引用 8 次
- Global-Scale Secure Multiparty ComputationXiao Wang, Samuel Ranellucci, Jonathan KatzCCS 2017 · 被引用 220 次
