{"id":"palomar/PALOMAR-2026-10-18-000004","url":"https://github.com/GregoryMorse/SelfModTamper/tree/ae5d3f621e8e8e9d6d696c49d09c97337b93bf03/lean","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-10-18-000004-v2.json","repo":"https://github.com/GregoryMorse/SelfModTamper","tags":["cs.CR","cs.LO","msc:68M07","msc:94A60","msc:68Q60","tamper-proofing","formal-methods","security-models"],"score":0,"title":"Tamper-proofing with self-modifying code: threat model, security and necessity of the assumptions","trust":"high","domain":"cs.CR","source":"palomar","authors":["Gregory Morse"],"reviews":0,"subject":"cs.CR","summary":"Formalizes Gregory Morse and Tamas Kozsik's paper \"Tamper-Proofing with Self-Modifying Code\" (arXiv:2604.12407v1). The selected statement (PalomarSMT.mathematical_result, four results T1-T4) is an abstract threat model for checksum units whose opcode state lives in the memory they checksum: a system of units with regions and code, a timeline of write, execute, check, split-view and DMA events, adversary levels L0-L4, a cost contract with lower bounds on emulation, forgery and mediation, and eight structural assumptions A1-A8 (none of the form \"the attacker is detected\"). An effective alarm…","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"verified":true,"discussed":0,"published":"2026-10-19","reactions":{},"formalized":true,"formalizes":[{"title":"Tamper-Proofing with Self-Modifying Code","identifier":"arxiv:2604.12407","relationship":"adapts"}]}