The complexity of memory checking with covert security

DOI10.1007/978-3-031-91092-0_11MaRDI QIDQ6891251zbMATH OpenFDO

Authors Elette Boyle, Ilan Komargodski, Neekon Vafa

Publication date 2 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-91092-0_11

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Theory of data (68Pxx)

Cites work

• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
• \textsf{Jolt}: SNARKs for virtual machines via lookups
• Checking the correctness of memories
• Compact proofs of retrievability
• Dynamic proofs of retrievability via oblivious RAM
• Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
• Efficient Two Party and Multi Party Computation Against Covert Adversaries
• Gemini: elastic SNARKs for diverse environments
• How Efficient Can Memory Checking Be?
• Libra: succinct zero-knowledge proofs with optimal prover computation
• Memory checking for parallel RAMs
• Parallelizable Authentication Trees
• Proofs for inner pairing products and applications
• Rounds in Communication Complexity Revisited
• Security against covert adversaries: Efficient protocols for realistic adversaries
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• The complexity of online memory checking
• Time space tradeoffs for attacks against one-way functions and PRGs
• Unlocking the lookup singularity with \textsf{Lasso}

This page was built for publication: The complexity of memory checking with covert security

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891251)