TY - GEN
T1 - Rabbit-Mix
T2 - 33rd USENIX Security Symposium, USENIX Security 2024
AU - Cho, Chongwon
AU - Dittmer, Samuel
AU - Ishai, Yuval
AU - Lu, Steve
AU - Ostrovsky, Rafail
N1 - Publisher Copyright: © USENIX Security Symposium 2024.All rights reserved.
PY - 2024
Y1 - 2024
N2 - We present Rabbit-Mix, a robust algebraic mixing-based anonymous broadcast protocol in the client-server model. Rabbit-Mix is the first practical sender-anonymous broadcast protocol satisfying both robustness and 100% message delivery assuming a (strong) honest majority of servers. It presents roughly 3× improvement in comparison to Blinder (CCS 2020), a previous anonymous broadcast protocol in the same model, in terms of the number of algebraic operations and communication, while at the same time eliminating the non-negligible failure probability of Blinder. To obtain these improvements, we combine the use of Newton's identities for mixing with a novel way of exploiting an algebraic structure in the powers of field elements, based on an additive 2-basis, to compactly encode and decode client messages. We also introduce a simple and efficient distributed protocol to verify the well-formedness of client input encodings, which should consist of shares of multiple arithmetic progressions tied together.
AB - We present Rabbit-Mix, a robust algebraic mixing-based anonymous broadcast protocol in the client-server model. Rabbit-Mix is the first practical sender-anonymous broadcast protocol satisfying both robustness and 100% message delivery assuming a (strong) honest majority of servers. It presents roughly 3× improvement in comparison to Blinder (CCS 2020), a previous anonymous broadcast protocol in the same model, in terms of the number of algebraic operations and communication, while at the same time eliminating the non-negligible failure probability of Blinder. To obtain these improvements, we combine the use of Newton's identities for mixing with a novel way of exploiting an algebraic structure in the powers of field elements, based on an additive 2-basis, to compactly encode and decode client messages. We also introduce a simple and efficient distributed protocol to verify the well-formedness of client input encodings, which should consist of shares of multiple arithmetic progressions tied together.
UR - http://www.scopus.com/inward/record.url?scp=85205028113&partnerID=8YFLogxK
M3 - منشور من مؤتمر
T3 - Proceedings of the 33rd USENIX Security Symposium
SP - 3151
EP - 3168
BT - Proceedings of the 33rd USENIX Security Symposium
Y2 - 14 August 2024 through 16 August 2024
ER -