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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

27 篇 会议
18 篇 期刊文献
2 篇 学位论文

馆藏范围

47 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

43 篇 工学
- 37 篇 计算机科学与技术...
- 17 篇 软件工程
- 11 篇 电气工程
- 6 篇 信息与通信工程
- 2 篇 控制科学与工程
- 1 篇 材料科学与工程（可...
1 篇 理学
- 1 篇 数学
1 篇 农学
- 1 篇 水产
1 篇 管理学
- 1 篇 公共管理

主题

47 篇 binary code anal...
6 篇 reverse engineer...
5 篇 malware
4 篇 vulnerability de...
3 篇 concolic testing
3 篇 static analysis
3 篇 software securit...
3 篇 symbolic executi...
3 篇 security
3 篇 malware detectio...
2 篇 deep learning
2 篇 belief propagati...
2 篇 software metric
2 篇 binary codes
2 篇 machine learning
2 篇 graph matching
2 篇 malware analysis
2 篇 network alignmen...
2 篇 firmware analysi...
2 篇 dynamic analysis

机构

3 篇 hochiminh city u...
2 篇 univ paris sacla...
2 篇 concordia univ 1...
2 篇 lomonosov moscow...
2 篇 russian acad sci...
2 篇 pennstate univer...
1 篇 natl res univ hi...
1 篇 samm ea 4543 uni...
1 篇 russian acad sci...
1 篇 russian armenian...
1 篇 hochiminh city u...
1 篇 south china univ...
1 篇 inst rech hydro ...
1 篇 univ paris 09 ps...
1 篇 univ texas san a...
1 篇 taiwan police co...
1 篇 max planck inst ...
1 篇 united arab emir...
1 篇 tokyo univ agr &...
1 篇 univ paris est l...

作者

4 篇 debbabi mourad
4 篇 nguyen minh hai
4 篇 quan thanh tho
4 篇 wang lingyu
4 篇 alrabaee saed
3 篇 shirani paria
3 篇 ogawa mizuhito
2 篇 qiu jing
2 篇 wang shuai
2 篇 stojanovic sasa
2 篇 lin zhiqiang
2 篇 radivojevic zaha...
2 篇 bardin sebastien
2 篇 marion jean-yves
2 篇 benoit tristan
2 篇 cvetanovic milos
1 篇 ye guixin
1 篇 wu dinghao
1 篇 song zirui
1 篇 elie mengin

语言

46 篇 英文
1 篇 其他

检索条件"主题词=binary code analysis"

共 47 条记录，以下是21-30 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

TraceFilter: An Exploitability Analyzer of Vulnerabilities in binary code 17

TraceFilter: An Exploitability Analyzer of Vulnerabilities i...

引用

IEEE 17th Int Conf on Dependable, Autonom and Secure Comp / IEEE 17th Int Conf on Pervas Intelligence and Comp / IEEE 5th Int Conf on Cloud and Big Data Comp / IEEE 4th Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)

作者： Mok, Seong-Kyun cho, Eun-Sun Chungnam Natl Univ Dept Comp Sci & Engn Daejeon South Korea

ISBN: (纸本)9781728130248

Although the exploitation of vulnerabilities is a common method of attack, it is not always possible for program developers to eliminate all vulnerabilities before deployment. Fortunately, critical security behaviors such as gaining control of programs are enabled only by the input-associated vulnerabilities, which are used by experts in analyzing the severity of vulnerabilities. However, traditional methods based on dynamic analyses inherently suffer from performance problems. This paper introduces a new method of reverse-taint analysis to check if a vulnerability is related to user inputs. By adopting a static analysis as well as the simplified dynamic analysis, our analysis performs better than conventional analysis methods in this area.

关键词： binary code analysis backward analysis vulnerabilities exploitabilities

来源：评论

学校读者我要写书评

暂无评论

Guiding Symbolic Execution with A-Star 21st

Guiding Symbolic Execution with A-Star

引用

21st International Workshop on Software Engineering and Formal Methods (SEFM)

作者： Pinto, Theo De Castro Rollet, Antoine Sutre, Gregoire Tobor, Ireneusz Univ Bordeaux LaBRI Bordeaux INP CNRSUMR 5800 F-33400 Talence France Serma Safety & Secur F-33600 Pessac France

ISBN: (纸本)9783031471148;9783031471155

Symbolic execution is widely used to detect vulnerabilities in software. The idea is to symbolically execute the program in order to find an executable path to a target instruction. For the analysis to be fully accurate, it must be performed on the binary code, which makes the well-known issue of state explosion even more critical. In this paper, we introduce a novel exploration strategy for symbolic execution aiming to limit the number of explored paths. Our strategy is inspired from the A* algorithm and steered towards least explored parts of the program. We compare our approach, using the Binsec tool, to three other classical strategies: depth-first (DFS), breadth-first (BFS) and non-uniform random (NURS). Our experiments on real-size programs show that our approach is promising.

关键词： Symbolic execution Program analysis binary code analysis A* algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-threaded On-the-Fly Model Generation of Malware with Hash Compaction 1

引用

18th International Conference on Formal Engineering Methods (ICFEM)

作者： Nguyen Minh Hai Quan Thanh Tho Le Duc Anh HoChiMinh City Univ Technol Ho Chi Minh City Vietnam Tokyo Univ Agr & Technol Tokyo Japan

ISBN: (数字)9783319478463

ISBN: (纸本)9783319478463;9783319478456

This paper introduces multi-threaded implementation of our binary code analyzer BE-PUM for malware. On-the-fly model generation by BE-PUM is combined with duplication detection and hash compaction method to minimize the resource consumption. The method operates in three phases including parallel expansion of states, duplication detection and update of the state space. A notable feature of our algorithm is that it requires very little synchronization or cooperation between threads, which is often a bottleneck of multi-threading, due to our strategy of local resource management. The experiments on 125 real-world malware show good performance improvement.

关键词： Concolic testing Pushdown system Malware detection binary code analysis Hash compaction Multi-threaded

来源：评论

学校读者我要写书评

暂无评论

An Empirical Study of SDK Credential Misuse in iOS Apps 25

An Empirical Study of SDK Credential Misuse in iOS Apps

引用

25th Asia-Pacific Software Engineering Conference (APSEC)

作者： Wen, Haohuang Li, Juanru Zhang, Yuanyuan Gu, Dawu South China Univ Technol Sch Software Engn Guangzhou Guangdong Peoples R China Shanghai Jiao Tong Univ Lab Cryptol & Comp Secur Shanghai Peoples R China

ISBN: (纸本)9781728119700

During the development of web-based mobile apps, third-party SDKs (Software Development Kit) are frequently used to facilitate the integration of certain functionality such as push notification and mobile payment. Unfortunately, security issues are often considered as a second-tier problem and app developers are prone to implement apps with SDK misuses. Among those typical SDK misuses, the misuse of credentials is the one that introduces serious security threats. A credential is a set of unique information (e.g., APP ID, App Token, etc) allocated to a specific developer to help app authenticate the identity. However, if not properly used, the credential can be easily obtained by attackers and leads to not only the leak of confidential information of mobile developers but also direct threats to the privacy of end users. To investigate the SDK credential misuse issue on iOS platform, in this paper we conduct an empirical study against 100 popular iOS apps using two popular mobile SDKs (each SDK are widely used by at least 40 million users). We implemented iCredFinder, an automated analysis tool to search credential misuses in those apps and our experiment demonstrates 68 apps contain at least one misuse case. Our study demonstrates the severity of credential misuse on iOS platform: even for those well-developed SDKs and apps, credentials are not well protected and can be easily discovered. We expect that our study could help developers fix those flaws and promote better implementations.

关键词： iOS apps Third-party SDKs binary code analysis Credential exposure

来源：评论

学校读者我要写书评

暂无评论

Context-Sensitive Flow Graph and Projective Single Assignment Form for Resolving Context-Dependency of binary code 13

Context-Sensitive Flow Graph and Projective Single Assignmen...

引用

13th ACM SIGSAC Workshop on Programming Languages and analysis for Security (PLAS)

作者： Izumida, Tomonori Mori, Akira Hashimoto, Masatomo IIJ Res Lab Tokyo Japan Natl Inst Adv Ind Sci & Technol Tokyo Japan Chiba Inst Technol Narashino Chiba Japan

ISBN: (纸本)9781450359931

Program analysis on binary code is considered as difficult because one has to resolve destinations of indirect jumps. However, there is another difficulty of context-dependency that matters when one processes binary programs that are not compiler generated. In this paper, we propose a novel approach for tackling these difficulties and describe a way to reconstruct a control flow from a binary program with no extra assumptions than the operational meaning of machine instructions.

关键词： binary code analysis static single assignment context-dependency

来源：评论

学校读者我要写书评

暂无评论

ACUA: API Change and Usage Auditor 14

ACUA: API Change and Usage Auditor

引用

14th IEEE International Working Conference on Source code analysis and Manipulation (SCAM)

作者： Wu, Wei Adams, Bram Gueheneuc, Yann-Gael Antoniol, Giuliano Ecole Polytech DGIGL Montreal PQ H3C 3A7 Canada

ISBN: (纸本)9780769553047

Modern software uses frameworks through their Application Programming Interfaces (APIs). Framework APIs may change while frameworks evolve. Client programs have to upgrade to new releases of frameworks if security vulnerabilities are discovered in the used releases. Patching security vulnerabilities can be delayed by non-security-related API changes when the frameworks used by client programs are not up to date. Keeping frameworks updated can reduce the reaction time to patch security leaks. Client program upgrades are not cost-free, developers need to understand the API usages in client programs and API changes between framework releases before conduct upgrading tasks. In this paper, we propose a tool ACUA to generate reports containing detailed API change and usage information by analyzing the binary code of both frameworks and clients programs written in Java. Developers can use the API change and usage reports generated by ACUA to estimate the work load and decide when to starting upgrading client programs based on the estimation.

关键词： Java application program interfaces safety-critical software source code (software) ACUA API Change-and-Usage Auditor application programming interfaces binary code analysis client program upgrade framework release nonsecurity-related API changes reaction time reduction security leakage patching security vulnerabilities software usage framework work load estimation Abstracts Analytical models Contracts Data models Detection algorithms Security Software API change and usage Software maintenance framework API evolution Application programming interfaces Java Java programming language Frameworks safety-critical software Detection algorithms Software maintenance data models API contract AXIAL POWER INDICATOR American Petroleum Institute Security hole analysis MODELS customers

来源：评论

学校读者我要写书评

暂无评论

Packer identification based on metadata signature 7

Packer identification based on metadata signature

引用

7th Software Security, Protection, and Reverse Engineering Workshop (SSPREW)

作者： Nguyen Minh Hai Ogawa, Mizuhito Quan Thanh Tho HoChiMinh City Univ Technol Ho Chi Minh City Vietnam Japan Adv Inst Sci & Technol Nomi Ishikawa Japan

ISBN: (纸本)9781450353878

Malware applies lots of obfuscation techniques, which are often automatically generated by the use of packers. This paper presents a packer identification of packed code based on metadata signature, which is a frequency vector of occurrences of classified obfuscation techniques. First, BE-PUM (binary Emulator for PUshdown Model generation) disassembles and generates the control flow graph of malware in an on-the-fly manner, using concolic testing. Second, obfuscation techniques in the generated control flow graph are detected based on the formal criteria of each obfuscation technique. Last, the used packer is identified with the chisquare test on the metadata signature of a packed code. The precision is evaluated with experiments on 12814 malware from VX heaven and Virusshare, in which 608 examples are detected inconsistent with commercial packer identification at PEiD, CFF Explore, and VirusTotal. We manually confirm that, except for 1 example, BE-PUM is correct. The only case that BE-PUM misunderstands is between MEW and FSG, which are quite similar packers and current BE-PUM extension does not support MEW.

关键词： concolic testing malware binary code analysis packer

来源：评论

学校读者我要写书评

暂无评论

Are We There Yet? Filling the Gap Between binary Similarity analysis and binary Software Composition analysis 9

Are We There Yet? Filling the Gap Between Binary Similarity ...

引用

9th IEEE European Symposium on Security and Privacy (EuroS and P)

作者： Wang, Huaijin Liu, Zhibo Wang, Shuai Wang, Ying Tang, Qiyi Nie, Sen Wu, Shi Hong Kong Univ Sci & Technol Hong Kong Peoples R China Northeastern Univ Shenyang Peoples R China Tencent Keen Secur Lab Shenzhen Peoples R China

ISBN: (纸本)9798350354263;9798350354256

Software composition analysis (SCA) has attracted the attention of the industry and academic community in recent years. Given a piece of program source code, SCA facilitates extracting certain components from the input program and matching the extracted components with open-source software (OSS) libraries. Despite the prosperous development of SCA, binary SCA (BSCA) is highly challenging and still underdeveloped. Few available BSCA solutions are either closed source (for commercial usage) or suffer from low performance. Nevertheless, a related line of research, binary similarity analysis (BSA), which decides the similarity between two pieces of binary code, has been progressively developed in academia for decades. De facto BSA techniques, often based on deep learning, efficiently analyze large-scale executables with high accuracy. This study explores bridging the gap between state-of-the-art (SOTA) BSA and BSCA. We spent considerable manual effort building the first large real-world benchmark dataset, containing over 55 million lines of C/C++ code. Then, we establish our BSCA pipeline by extending and calibrating the SOTA SCA pipeline. Particularly, we concretize the key procedure of BSCA, namely matching a binary component with OSS using six SOTA BSA techniques. Evaluation using our benchmark dataset reveals that simply employing BSA in BSCA exhibits less desirable accuracy, as BSCA faces unique challenges. After inspecting the failed cases, we propose three enhancements whose hybrid usage improves the F1 score of BSCA by over 30% and outperforms SOTA commercial BSCA software. Our experiment on 1-day vulnerability detection demonstrates our BSCA framework's effectiveness. We also discuss several open challenges and potential solutions to augment BSCA solutions.

关键词： binary code analysis binary similarity analysis Software composition analysis Software reuse Vulnerability detection

来源：评论

学校读者我要写书评

暂无评论

binary level toolchain provenance identification with graph neural networks 28

Binary level toolchain provenance identification with graph ...

引用

28th IEEE International Conference on Software analysis, Evolution and Reengineering (SANER)

作者： Benoit, Tristan Marion, Jean-Yves Bardin, Sebastien Univ Lorraine CNRS LORIA F-54000 Nancy France Univ Paris Saclay CEA LIST Saclay France

ISBN: (纸本)9781728196305

We consider the problem of recovering the compiling chain used to generate a given stripped binary code. We present a Graph Neural Network framework at the binary level to solve this problem, with the idea to take into account the shallow semantics provided by the binary code's structured control flow graph (CFG). We introduce a Graph Neural Network, called Site Neural Network (SNN), dedicated to this problem. To attain scalability at the binary level, feature extraction is simplified by forgetting almost everything in a CFG except transfer control instructions and performing a parametric graph reduction. Our experiments show that our method recovers the compiler family with a very high F1-Score of 0.9950 while the optimization level is recovered with a moderately high F1-Score of 0.7517. On the compiler version prediction task, the F1-Score is about 0.8167 excluding the clang family. A comparison with a previous work demonstrates the accuracy and performance of this framework.

关键词： toolchain provenance graph neural networks binary code analysis

来源：评论

学校读者我要写书评

暂无评论

Deductive binary code Verification Against Source-code-Level Specifications 14th

Deductive Binary Code Verification Against Source-Code-Level...

引用

14th International Conference on Tests and Proofs (TAP) held as part of Software Technologies - Applications and Foundations (STAF) Conference

作者： Kamkin, Alexander Khoroshilov, Alexey Kotsynyak, Artem Putro, Pavel Russian Acad Sci Ivannikov Inst Syst Programming Moscow Russia Lomonosov Moscow State Univ Moscow Russia Moscow Inst Phys & Technol Moscow Russia Natl Res Univ Higher Sch Econ Moscow Russia

ISBN: (纸本)9783030509958;9783030509941

There is a high demand in practical methods and tools to ensure total correctness of critical software components. A usual assumption is that the machine code (or binary code) generated by a compiler follows the semantics of the programming language. Unfortunately, modern compilers such as GCC and LLVM are too complex to be thoroughly verified, and bugs in the generated code are not uncommon. As an alternative approach, we suggest proving that the generated machine code still satisfies the functional properties expressed at the source code level. The suggested approach takes an ACSL-annotated C function along with its binary code and checks that the binary code meets the ACSL annotations. The main steps are as follows: (1) disassembling the machine code and extracting its semantics;(2) adapting the annotations to the machine level and generating the verification conditions. The implementation utilizes MicroTESK, Frama-C, Why3, and other tools. To illustrate the solution, we use the RISC-V microprocessor architecture;however, the approach is relatively independent of the target platform as it is based on formal specifications of the instruction set. It is worth noting that the presented method can be exploited as a test oracle for compiler testing.

关键词： binary code analysis Deductive verification Equivalence checking Formal instruction set specification Compiler testing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共5页 << < 1 2 3 4 5 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：