Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions
Jesper Buus Nielsen, João Ribeiro, Maciej Obremski
摘要
We distill a simple information-theoretic model for randomness extraction motivated by the task of generating publicly verifiable randomness in blockchain settings and which is closely related to You-Only-Speak-Once (YOSO) protocols (CRYPTO 2021). With the goal of avoiding denial-of-service attacks, parties speak only once and in sequence by broadcasting a public value and forwarding secret values to future parties. Additionally, an unbounded adversary can corrupt any chosen subset of at most t parties. In contrast, existing YOSO protocols only handle random corruptions. As a notable example, considering worst-case corruptions allows us to reduce trust in the role assignment mechanism, which is assumed to be perfectly random in YOSO.
We study the maximum corruption threshold t which allows for unconditional randomness extraction in our model:
-With respect to feasibility, we give protocols for t corruptions and n = 6t + 1 or n = 5t parties depending on whether the adversary learns secret values forwarded to corrupted parties immediately once they are sent or only once the corrupted party is executed, respectively. Both settings are motivated by practical implementations of secret value forwarding. To design such protocols, we go beyond the committee-based approach that is sufficient for random corruptions in YOSO but turns out to be sub-optimal for chosen corruptions. -To complement our protocols, we show that low-error randomness extraction is impossible with corruption threshold t and n ≤ 4t parties in both settings above. This also provides a separation between chosen and random corruptions, since the latter allows for randomness extraction with close to n/2 random corruptions.
Publicly verifiable randomness is a fundamental resource for many tasks, including contract signing, electronic voting, and anonymous communication and M. Obremski-The author ordering is randomized. A certificate of the randomization procedure can be found here.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper4
- Spurt: Scalable Distributed Randomness Beacon with Transparent SetupSourav Das, Vinith Krishnan, Irene Miriam Isaac, Ling RenS&P 2022 · 被引用 80 次
- YOSO: You Only Speak Once - Secure MPC with Stateless Ephemeral RolesCraig Gentry, Shai Halevi, Hugo Krawczyk, Bernardo Magri 等CRYPTO 2021 · 被引用 70 次
- Fluid MPC: Secure Multiparty Computation with Dynamic ParticipantsArka Rai Choudhuri, Aarushi Goel, Matthew Green, Abhishek Jain 等CRYPTO 2021 · 被引用 50 次
- How to Extract Useful Randomness from Unreliable SourcesDivesh Aggarwal, Maciej Obremski, João Ribeiro, Luisa Siniscalchi 等EUROCRYPT 2020 · 被引用 11 次
相关 Paper
- Towards Practical Committee Sizes in YOSO MPCPawel Kedzior, Marcin Mielniczuk, Daniele VenturiCRYPTO 2026
- Threshold Cryptography as a Service (in the Multiserver and YOSO Models)Fabrice Benhamouda, Shai Halevi, Hugo Krawczyk, Alex Miao 等CCS 2022 · 被引用 13 次
- Perfect MPC over Layered GraphsBernardo David, Giovanni Deligios, Aarushi Goel, Yuval Ishai 等CRYPTO 2023 · 被引用 21 次
- SoK: Distributed Randomness BeaconsKevin Choi, Aathira Manoj, Joseph BonneauS&P 2023
- Secure Multiparty Computation from Threshold Encryption Based on Class GroupsLennart Braun, Ivan Damgård, Claudio OrlandiCRYPTO 2023 · 被引用 47 次
