sf LogStack: Stacked Garbling with O(b log b) Computation
David Heath, Vladimir Kolesnikov
2021Year
10Citations
1Top-tier citations
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get fd0863d4-dce0-4b6d-a571-c8adb7e631e5Cited by top-tier papers1
Ask how each one uses itRelated papers
- Stacked Garbling - Garbled Circuit Proportional to Longest Execution PathDavid Heath, Vladimir KolesnikovCRYPTO 2020 · 26 citations
- Secure Multiparty Computation with Sublinear PreprocessingElette Boyle, Niv Gilboa, Yuval Ishai, Ariel NofEUROCRYPT 2022 · 12 citations
- Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCRPierre Meyer, Claudio Orlandi, Lawrence Roy, Peter SchollCRYPTO 2025 · 13 citations
- BTX and SimpleBTE: Efficient Batched Threshold EncryptionAmit Agarwal, Sourav Das, Babak Poorebrahim Gilkalaye, Guru-Vamsi Policharla et al.CCS 2026
- Suffix-Invariant Programmable PRFs and Applications to Stacked GarblingVipul Goyal, David Heath, Abhishek Jain, Yibin YangCRYPTO 2026
