检索结果-内蒙古大学图书馆

A taxonomy of self-modifying code for obfuscation

COMPUTERS & SECURITY 2011年第8期30卷 679-691页

作者： Mavrogiannopoulos, Nikos Kisserli, Nessim Preneel, Bart Katholieke Univ Leuven ESAT SCD COSIC IBBT B-3001 Louvain Belgium

self-modifying code is frequently used as an additional layer of complexity when obfuscating code. Although it does not provide a provable level of obfuscation, it is generally assumed to make attacks more expensive. This paper attempts to quantify the cost of attacking self-modified code by defining a taxonomy for it and systematically categorising an adversary's capabilities. A number of published methods and techniques for self-modifying code are then classified according to both the taxonomy and the model. (C)) 2011 Elsevier Ltd. All rights reserved.

关键词： self-modifying code code obfuscation

来源：评论

学校读者我要写书评

暂无评论

A Survey of Software Protection Methods based on self-modifying code 7

A Survey of Software Protection Methods based on Self-modify...

引用

7th International Conference on Computational Intelligence and Communication Networks (CICN)

作者： Mi Xianya Zhang Yi Wang Baosheng Tang Yong Natl Univ Def & Technol Coll Comp Changsha Hunan Peoples R China

ISBN: (纸本)9781509000760

As the software industry develops rapidly, protecting software intellectual property from reverse attacker has become more and more important. The technical way is to make software hard to understand and will cost attackers more time and energy to crack the software than they can take. self-modifying code is a code changing mechanism based on stored program architecture and has been widely used in software protection methods these years. This article introduces four different kinds of software protection methods using self-modifying code, and classifies the features of the implementation. The protection intensity and overheads are evaluated respectively. This article also compares the advantages and drawbacks of each method, and makes conclusions about the developing trends of software protection technologies.

关键词： component software protection self-modifying code

来源：评论

学校读者我要写书评

暂无评论

Certified self-modifying code 07

Certified self-modifying code

引用

Conference on Programming Language Design and Implementation

作者： Cai, Hongxu Shao, Zhong Vaynberg, Alexander Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China Yale Univ Dept Comp Sci New Haven CT 06520 USA

ISBN: (纸本)9781595936332

self-modifying code (SMC), in this paper, broadly refers to any program that loads, generates, or mutates code at runtime. It is widely used in many of the world's critical software systems to support runtime code generation and optimization, dynamic loading and linking, OS boot loader, just-in-time compilation, binary translation, or dynamic code encryption and obfuscation. Unfortunately, SMC is also extremely difficult to reason about: existing formal veri. cation techniques-including Hoare logic and type system consistently assume that program code stored in memory is fixed and immutable;this severely limits their applicability and power. This paper presents a simple but novel Hoare-logic-like framework that supports modular veri. cation of general von-Neumann machine code with runtime code manipulation. By dropping the assumption that code memory is fixed and immutable, we are forced to apply local reasoning and separation logic at the very beginning, and treat program code uniformly as regular data structure. We address the interaction between separation and code memory and show how to establish the frame rules for local reasoning even in the presence of SMC. Our framework is realistic, but designed to be highly generic, so that it can support assembly code under all modern CPUs (including both x86 and MIPS). Our system is expressive and fully mechanized. We prove its soundness in the Coq proof assistant and demonstrate its power by certifying a series of realistic examples and applications-all of which can directly run on the SPIM simulator or any stock x86 hardware.

关键词： languages verification self-modifying code runtime code manipulation assembly code verification modular verification Hoare logic

来源：评论

学校读者我要写书评

暂无评论

Certified self-modifying code

引用

ACM SIGPLAN NOTICES 2007年第6期42卷 66-77页

作者： Cai, Hongxu Shao, Zhong Vaynberg, Alexander Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China Yale Univ Dept Comp Sci New Haven CT 06520 USA

关键词： languages verification self-modifying code runtime code manipulation assembly code verification modular verification Hoare logic

来源：评论

学校读者我要写书评

暂无评论

Pure Infinitely self-modifying code is Realizable and Turing-complete

引用

INTERNATIONAL JOURNAL OF ELECTRONICS AND TELECOMMUNICATIONS 2018年第2期64卷 123-129页

作者： Morse, Gregory Eotvos Lorand Univ Budapest Hungary

Although self-modifying code has been shyed away from due to its complexity and discouragement due to safety issues, it nevertheless provides for a very unique obfuscation method and a different perspective on the relationship between data and code. The generality of the von Neumann architecture is hardly realized by today's processor models. A code-only model is shown where every instruction merely modifies other instructions yet achieves the ability to compute and Turing machine operation is easily possible.

关键词： x86 x86-64 Assembly language self-modifying code Turing-completeness code obfuscation

来源：评论

学校读者我要写书评

暂无评论

The Executioner Paradox: understanding self-referential dilemma in computational systems

引用

AI & SOCIETY 2025年第3期40卷 1939-1946页

作者： Mahajan, Sachit Swiss Fed Inst Technol Computat Social Sci Clausiusstr 50 CH-8092 Zurich Switzerland

As computational systems burgeon with advancing artificial intelligence (AI), the deterministic frameworks underlying them face novel challenges, especially when interfacing with self-modifying code. The Executioner Paradox, introduced herein, exemplifies such a challenge where a deterministic Executioner Machine (EM) grapples with self-aware and self-modifying code. This unveils a self-referential dilemma, highlighting a gap in current deterministic computational frameworks when faced with self-evolving code. In this article, the Executioner Paradox is proposed, highlighting the nuanced interactions between deterministic decision-making and self-aware code, and the ensuing challenges. This article advocates for a re-evaluation of existing deterministic frameworks, emphasizing the need for adaptive decision-making mechanisms in computational systems. By dissecting the Executioner Paradox, the aim is to foster a robust discussion on evolving deterministic frameworks to accommodate the dynamic nature of self-modifying code, thereby contributing a forward-looking lens to the discourse on computational systems amidst advancing AI.

关键词： Artificial intelligence self-modifying code Ethics Computational systems Executioner Paradox

来源：评论

学校读者我要写书评

暂无评论

Lazy Cache Invalidation for self-modifying codes

Lazy Cache Invalidation for Self-Modifying Codes

引用

ACM International Conference on Compilers, Architectures and Synthesis for Embedded Systems (CASES)

作者： Gutierrez, Anthony Pusdesris, Joseph Dreslinski, Ronald G. Mudge, Trevor Univ Michigan Adv Comp Architecture Lab Ann Arbor MI 48109 USA

ISBN: (纸本)9781450314244

Just-in-time compilation with dynamic code optimization is often used to help improve the performance of applications that utilize high-level languages and virtual run-time environments, such as those found in smartphones. Just-in-time compilation introduces additional overhead into the instruction fetch stage of a processor that is particularly problematic for user applications-instruction cache invalidation due to the use of self-modifying code. This software-assisted cache coherence serializes cache line invalidations, or causes a costly invalidation of the entire instruction cache, and prevents useful instructions from being fetched for the period during which the stale instructions are being invalidated. This overhead is not acceptable for user applications, which are expected to respond quickly. In this work we introduce a new technique that can, using a single instruction, invalidate cache lines in page-sized chunks as opposed to invalidating only a single line at a time. Lazy cache invalidation reduces the amount of time spent stalling due to instruction cache invalidation by removing stale instructions on demand as they are accessed, as opposed to all at once. The key observation behind lazy cache invalidation is that stale instructions do not necessarily need to be removed from the instruction cache;as long as it is guaranteed that attempts to fetch stale instructions will not hit in the instruction cache, the program will behave as the developer had intended.

关键词： Architecture self-modifying code Software-Assisted Coherence Instruction Caching

来源：评论

学校读者我要写书评

暂无评论

SGXELIDE: Enabling Enclave code Secrecy via self-Modification 2018

SGXELIDE: Enabling Enclave Code Secrecy via Self-Modificatio...

引用

16th International Symposium on code Generation and Optimization (CGO)

作者： Bauman, Erick Wang, Huibo Zhang, Mingwei Lin, Zhiqiang Univ Texas Dallas Richardson TX 75083 USA Intel Labs Hillsboro OR USA

ISBN: (纸本)9781450356176

Intel SGX provides a secure enclave in which code and data are hidden from the outside world, including privileged code such as the OS or hypervisor. However, by default, enclave code prior to initialization can be disassembled and therefore no secrets can be embedded in the binary. This is a problem for developers wishing to protect code secrets. This paper introduces SGXELIDE, a nearly-transparent framework that enables enclave code confidentiality. The key idea is to treat program code as data and dynamically restore secrets after an enclave is initialized. SGXELIDE can be integrated into any enclave, providing a mechanism to securely decrypt or deliver the secret code with the assistance of a developer-controlled trusted remote party. We have implemented SGXELIDE atop a recently released version of the Linux SGX SDK, and our evaluation with a number of programs shows that SGXELIDE can be used to protect the code secrecy of practical applications with no overhead after enclave initialization.

关键词： SGX self-modifying code code obfuscation

来源：评论

学校读者我要写书评

暂无评论

Local and global models of physics and computation

引用

INTERNATIONAL JOURNAL OF GENERAL SYSTEMS 2014年第7期43卷 673-681页

作者： Stepney, Susan Univ York Dept Comp Sci York YO10 5DD N Yorkshire England

Classical computation is essentially local in time, yet some formulations of physics are global in time. Here, I examine these differences and suggest that certain forms of unconventional computation are needed to model physical processes and complex systems. These include certain forms of analogue computing, massively parallel field computing and self-modifying computations.

关键词： unconventional computation Newtonian schema principle of least action field computing complex systems self-modifying code

来源：评论

学校读者我要写书评

暂无评论

Automated Synthesis and Analysis of Switching Gene Regulatory Networks

引用

BIOSYSTEMS 2016年第0期146卷 26-34页

作者： Shavit, Yoli Yordanov, Boyan Dunn, Sara-Jane Wintersteiger, Christoph M. Otani, Tomoki Hamadi, Youssef Livesey, Frederick J. Kugler, Hillel Univ Cambridge Cambridge CB2 1TN England Microsoft Res Cambridge England Bar Ilan Univ IL-52100 Ramat Gan Israel

Studying the gene regulatory networks (GRNs) that govern how cells change into specific cell types with unique roles throughout development is an active area of experimental research. The fate specification process can be viewed as a biological program prescribing the system dynamics, governed by a network of genetic interactions. To investigate the possibility that GRNs are not fixed but rather change their topology, for example as cells progress through commitment, we introduce the concept of Switching Gene Regulatory Networks (SGRNs) to enable the modelling and analysis of network reconfiguration. We define the synthesis problem of constructing SGRNs that are guaranteed to satisfy a set of constraints representing experimental observations of cell behaviour. We propose a solution to this problem that employs methods based upon Satisfiability Modulo Theories (SMT) solvers, and evaluate the feasibility and scalability of our approach by considering a set of synthetic benchmarks exhibiting possible biological behaviour of cell development. We outline how our approach is applied to a more realistic biological system, by considering a simplified network involved in the processes of neuron maturation and fate specification in the mammalian cortex. (C) 2016 The Authors. Published by Elsevier Ireland Ltd.

关键词： Gene regulatory networks (GRNs) Boolean networks (BNs) Biological modelling Satisfiability Modulo Theories (SMT) Synthesis self-modifying code Cell fate Mammalian cortex

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：