Bitwise Garbling Schemes - A Model with -Bit Lower Bound of Ciphertexts
Fei Xu, Honggang Hu, Changhong Xu
2025Year
2Citations
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 1aa1ee57-886d-4fd3-b9cd-e5828cca47d4Related papers
- Memory-Sample Lower Bounds for LWEMingqi Lu, Junzhao YangCRYPTO 2024 · 1 citation
- Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled CircuitsMike Rosulek, Lawrence RoyCRYPTO 2021 · 78 citations
- Breaking the Barrier on Garbled Circuit Size in the Random Oracle ModelJunru Li, Yifan SongCRYPTO 2026
- Lower Bounds for Garbled Circuits from Shannon-Type Information InequalitiesJake Januzelli, Mike Rosulek, Lawrence RoyCRYPTO 2025 · 3 citations
- How to Garble Mixed Circuits that Combine Boolean and Arithmetic ComputationsHanjun Li, Tianren LiuEUROCRYPT 2024 · 6 citations
