Ilan Komargodski

Memory Checking Requires Logarithmic Overhead

2024

We study the complexity of memory checkers with computational security and prove the first general tight lower bound.