Secret Sharing with Snitching
Stefan Dziembowski, Sebastian Faust, Tomasz Lizurej, Marcin Mielniczuk
2024年份
9被引次数
4顶会引用
摘要
We address the problem of detecting and punishing shareholder collusion in secret-sharing schemes. We do it in the recently proposed cryptographic model called individual cryptography (Dziembowski, Faust, and Lizurej, Crypto 2023), which assumes that there exist tasks that can be efficiently computed by a single machine but distributing this computation across multiple (mutually distrustful devices) is infeasible.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper4
- Disincentivize Collusion in Verifiable Secret SharingTiantian Gong, Aniket Kate, Hemanta K. Maji, Hai H. NguyenEUROCRYPT 2025 · 被引用 3 次
- CCA-Secure Traceable Threshold (ID-based) Encryption and ApplicationRishiraj Bhattacharyya, Jan Bormet, Sebastian Faust, Pratyay Mukherjee 等CCS 2025 · 被引用 2 次
- Breaking Omertà: On Threshold Cryptography, Smart Collusion, and WhistleblowingMahimna Kelkar, Aadityan Ganesh, Aditi Partap, Joseph Bonneau 等CCS 2025 · 被引用 1 次
- On the Pitfalls of Modeling Individual KnowledgeWojciech Ciszewski, Stefan Dziembowski, Tomasz Lizurej, Marcin MielniczukCCS 2026
相关 Paper
- Individual CryptographyStefan Dziembowski, Sebastian Faust, Tomasz LizurejCRYPTO 2023 · 被引用 6 次
- Strong Secret Sharing with SnitchingJan Bormet, Stefan Dziembowski, Sebastian Faust, Tomasz Lizurej 等CRYPTO 2025 · 被引用 5 次
- Traceable Secret Sharing and ApplicationsVipul Goyal, Yifan Song, Akshayaram SrinivasanCRYPTO 2021 · 被引用 29 次
- Stochastic Secret Sharing with 1-Bit Shares and Applications to MPCBenny Applebaum, Eliran KachlonCRYPTO 2024 · 被引用 1 次
- Multi-Server Verifiable Computation of Low-Degree PolynomialsLiang Feng Zhang, Huaxiong WangS&P 2022 · 被引用 23 次
