sf LogStack: Stacked Garbling with O(b log b) Computation
David Heath, Vladimir Kolesnikov
2021年份
10被引次数
1顶会引用
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper，每个回答都会注明依据哪几篇。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- Stacked Garbling - Garbled Circuit Proportional to Longest Execution PathDavid Heath, Vladimir KolesnikovCRYPTO 2020 · 被引用 26 次
- Secure Multiparty Computation with Sublinear PreprocessingElette Boyle, Niv Gilboa, Yuval Ishai, Ariel NofEUROCRYPT 2022 · 被引用 12 次
- Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCRPierre Meyer, Claudio Orlandi, Lawrence Roy, Peter SchollCRYPTO 2025 · 被引用 13 次
- BTX and SimpleBTE: Efficient Batched Threshold EncryptionAmit Agarwal, Sourav Das, Babak Poorebrahim Gilkalaye, Guru-Vamsi Policharla 等CCS 2026
- Suffix-Invariant Programmable PRFs and Applications to Stacked GarblingVipul Goyal, David Heath, Abhishek Jain, Yibin YangCRYPTO 2026
