The study of software bugs has long been a key area in software security. Dynamic symbolic execution, in exploring the program's execution paths, finds bugs by analyzing all potential dangerous operations. Due to ...
详细信息
ISBN:
(纸本)9781538605431
The study of software bugs has long been a key area in software security. Dynamic symbolic execution, in exploring the program's execution paths, finds bugs by analyzing all potential dangerous operations. Due to its high coverage and abilities to generate effective testcases, dynamic symbolic execution has attracted wide attention in the research community. However, the success of dynamic symbolic execution is limited due to complex program logic and its difficulty to handle large symbolic data. In our experiments we found that phase-related features of a program often prevents dynamic symbolic execution from exploring deep paths. On the basis of this discovery, we proposed a novel symbolic execution technology guided by program phase characteristics. Compared to KLEE, the most well-known symbolic execution approach, our method is capable of covering more code and discovering more bugs. We designed and implemented pbSE system, which was used to test several commonly used tools and libraries in Linux. Our results showed that pbSE on average covers code twice as much as what KLEE does, and we discovered 21 previously unknown vulnerabilities by using pbSE, out of which 7 are assigned CVE IDs.
There have been many attacks that exploit side-effects of program execution to expose secret information and many proposed countermeasures to protect against these attacks. However there is currently no systematic, ho...
详细信息
ISBN:
(纸本)9781450316422
There have been many attacks that exploit side-effects of program execution to expose secret information and many proposed countermeasures to protect against these attacks. However there is currently no systematic, holistic methodology for understanding information leakage. As a result, it is not well known how design decisions affect information leakage or the vulnerability of systems to side-channel attacks. In this paper, we propose a metric for measuring information leakage called the Side-channel Vulnerability Factor (SVF). SVF is based on our observation that all side-channel attacks ranging from physical to microarchitectural to software rely on recognizing leaked execution patterns. SVF quantifies patterns in attackers' observations and measures their correlation to the victim's actual execution patterns and in doing so captures systems' vulnerability to side-channel attacks. In a detailed case study of on-chip memory systems, SVF measurements help expose unexpected vulnerabilities in whole-system designs and shows how designers can make performance-security trade-offs. Thus, SVF provides a quantitative approach to secure computerarchitecture.
Four kinds of sequences generated by single cycle triangular function (T-function) are investigated to check the possibility for a single cycle T-function to be a cryptographic component in stream ciphers. Based on ...
详细信息
Four kinds of sequences generated by single cycle triangular function (T-function) are investigated to check the possibility for a single cycle T-function to be a cryptographic component in stream ciphers. Based on the special properties of single cycle T-function and an algorithm due to Wei, linear complexities of these four kinds of sequence are all acquired. The results show that single cycle T-function sequences have high linear complexity. Therefore, T-function satisfies the essential requirements being a basic component of stream cipher.
Cryptographic properties of the single cycle T-function's output sequences are *** of autocorrelation functions of the kth coordinate sequence and bounds of state output sequence are calculated *** Maximum Sidelob...
详细信息
Cryptographic properties of the single cycle T-function's output sequences are *** of autocorrelation functions of the kth coordinate sequence and bounds of state output sequence are calculated *** Maximum Sidelobe Ratio(MSR) of the kth coordinate sequence and the MSR of state output sequence are given *** bounds of autocorrelation functions show that the values of autocorrelation functions are large when shifts are *** of the autocorrelations between the state output sequence and coordinate output sequence are *** autocorrelation properties demonstrate that T-functions have cryptographic weaknesses and the illustration result shows coordinate output sequences have better autocorrelation than that of state output sequences.
Hardware components can contain hidden backdoors, which can be enabled with catastrophic effects or for ill-gotten profit. These backdoors can be inserted by a malicious insider on the design team or a third-party IP ...
详细信息
Hardware components can contain hidden backdoors, which can be enabled with catastrophic effects or for ill-gotten profit. These backdoors can be inserted by a malicious insider on the design team or a third-party IP provider. In this paper, we propose techniques that allow us to build trustworthy hardware systems from components designed by untrusted designers or procured from untrusted third-party IP providers. We present the first solution for disabling digital, design-level hardware backdoors. The principle is that rather than try to discover the malicious logic in the design -- an extremely hard problem -- we make the backdoor design problem itself intractable to the attacker. The key idea is to scramble inputs that are supplied to the hardware units at runtime, making it infeasible for malicious components to acquire the information they need to perform malicious actions. We show that the proposed techniques cover the attack space of deterministic, digital HDL backdoors, provide probabilistic security guarantees, and can be applied to a wide variety of hardware components. Our evaluation with the SPEC 2006 benchmarks shows negligible performance loss (less than 1% on average) and that our techniques can be integrated into contemporary microprocessor designs.
Single cycle T-functions are newly proposed components in stream cipher. In order to verify if such function is suitable for cipher design, the cryptographic properties of single cycle T-function are discussed. Nonlin...
详细信息
Patarin proposed the dragon scheme, pointed out the insecurity of the dragon algorithm with one hidden monomial and suggested a candidate dragon signature algorithm with a complicated function. This paper presents an ...
详细信息
Patarin proposed the dragon scheme, pointed out the insecurity of the dragon algorithm with one hidden monomial and suggested a candidate dragon signature algorithm with a complicated function. This paper presents an algebraic method to attack the candidate dragon signature algorithm. The attack borrows the basic idea of the attack due to Kipnis and Shamir, and utilizes the underlying algebraic structure of the candidate dragon signature algorithm over the extension field to derive a way to enable the variable Y be viewed as a fixed value. The attack recovers the private keys efficiently when the parameters are n≤2s and D=[logq^d]≤3.
This paper investigates the security of the projected C*- cryptographic scheme, and presents a method to attack the scheme. The basic idea of the attack is to utilize the affine part of the private keys and the weakne...
详细信息
暂无评论