Memory checking requires logarithmic overhead

HIGHLIGHTS

• What: The authors fully resolve the complexity of checkers by showing that any construction with local space 𝑝 and query complexity 𝑞 must satisfy 𝑝≥ CCS CONCEPTS • Theory of computation → Cryptographic protocols; Cryptographic primitives; • Security and privacy → Mathematical foundations of cryptography. For instance, the authors show the tight bound that if 𝑞𝑟=𝑂 and 𝑝 ≤ 𝑛 1-𝜀 for 𝜀 > 0, then 𝑞 𝑤 ≥ 𝑛 Ω . Lastly, the authors mention that the authors provide some (weak) evidence that a "reverse" bound of Theorem 3 for general (not necessarily deterministic and non-adaptive) schemes would require relatively new ideas; see the full version for details. The authors provide a technical overview . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.