TY - GEN
T1 - The Complexity of Memory Checking with Covert Security
AU - Boyle, Elette
AU - Komargodski, Ilan
AU - Vafa, Neekon
N1 - Publisher Copyright: © International Association for Cryptologic Research 2025.
PY - 2025
Y1 - 2025
N2 - A memory checker is an algorithmic tool used to certify the integrity of a database maintained on a remote, unreliable, computation-ally bounded server. Concretely, it allows a user to issue instructions to the server and after every instruction, obtain either the correct value or a failure (but not an incorrect answer) with high probability. A recent result due to Boyle, Komargodski, and Vafa (BKV, STOC’24) showed a tradeoff between the size of the local storage and the number of queries the memory checker makes to the server upon every logical instruction. Specifically, they show that every non-trivial memory checker construc-tion with inverse-polynomial soundness and local storage at most n1− must make Ω(log n/ log log n) queries, and this is tight up to constant factors given known constructions. However, an intriguing question is whether natural relaxations of the security guarantee could allow for more efficient constructions.
AB - A memory checker is an algorithmic tool used to certify the integrity of a database maintained on a remote, unreliable, computation-ally bounded server. Concretely, it allows a user to issue instructions to the server and after every instruction, obtain either the correct value or a failure (but not an incorrect answer) with high probability. A recent result due to Boyle, Komargodski, and Vafa (BKV, STOC’24) showed a tradeoff between the size of the local storage and the number of queries the memory checker makes to the server upon every logical instruction. Specifically, they show that every non-trivial memory checker construc-tion with inverse-polynomial soundness and local storage at most n1− must make Ω(log n/ log log n) queries, and this is tight up to constant factors given known constructions. However, an intriguing question is whether natural relaxations of the security guarantee could allow for more efficient constructions.
UR - http://www.scopus.com/inward/record.url?scp=105004638358&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-91092-0_11
DO - 10.1007/978-3-031-91092-0_11
M3 - منشور من مؤتمر
SN - 9783031910913
T3 - Lecture Notes in Computer Science
SP - 301
EP - 330
BT - Advances in Cryptology – EUROCRYPT 2025 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2025, Proceedings
A2 - Fehr, Serge
A2 - Fouque, Pierre-Alain
PB - Springer Science and Business Media Deutschland GmbH
T2 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2025
Y2 - 4 May 2025 through 8 May 2025
ER -