Memory Checking Requires Logarithmic Overhead

Elette Boyle, Ilan Komargodski, Neekon Vafa

被引用 2 次

摘要

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