E. Paul Ratazzi

E. Paul Ratazzi

Auto-generated profile, based on publicly available information

E. Paul Ratazzi

Information Warfare Division, Air Force Research Laboratory, Rome, NY, USA

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2007 in Journal of Communications
Verified
Journal Article
Closed access
PDF file
XLXiaohua Li
Xiaohua Li
JHJuite Hwu
Juite Hwu
ERE. Paul Ratazzi
E. Paul Ratazzi
Using Antenna Array Redundancy and Channel Diversity for Secure Wireless Transmissions

7 September 2009 in EURASIP Journal on Wireless Communications and Networking
Verified
Journal Article
Open access
PDF file
ELEric Like
Eric Like
VCVasuD Chakravarthy
VasuD Chakravarthy
PRPaul Ratazzi
Paul Ratazzi
ZWZhiqiang Wu
Zhiqiang Wu
Cognitive Radio (CR), a hierarchical Dynamic Spectrum Access (DSA) model, has been considered as a strong candidate for future communication systems improving spectrum efficiency utilizing unused spectrum of opportunity. However, to ensure the effectiveness of dynamic spectrum access, accurate signal classification in fading channels at low signal to noise ratio is essential. In this paper, a hierarchical cyclostationary-based classifier is proposed to reliably identify the signal type of a wide range of unknown signals. The proposed system assumes no a priori knowledge of critical signal statistics such as carrier frequency, carrier phase, or symbol rate. The system is designed with a multistage approach to minimize the number of samples required to make a classification decision while simultaneously ensuring the greatest reliability in the current and previous stages. The system performance is demonstrated in a variety of multipath fading channels, where several multiantenna-based combining schemes are implemented to exploit spatial diversity.

1 October 2014
Verified
Conference Paper
Closed access
MSMoustafa Saleh
Moustafa Saleh
ERE. Paul Ratazzi
E. Paul Ratazzi
SXShouhuai Xu
Shouhuai Xu
Every day thousands of malware are released online. The vast majority of these malware employ some kind of obfuscation ranging from simple XOR encryption, to more sophisticated anti-analysis, packing and encryption techniques. Dynamic analysis methods can unpack the file and reveal its hidden code. However, these methods are very time consuming when compared to static analysis. Moreover, considering the large amount of new malware being produced daily, it is not practical to solely depend on dynamic analysis methods. Therefore, finding an effective way to filter the samples and delegate only obfuscated and suspicious ones to more rigorous tests would significantly improve the overall scanning process. Current techniques of identifying obfuscation rely mainly on signatures of known packers, file entropy score, or anomalies in file header. However, these features are not only easily bypass-able, but also do not cover all types of obfuscation. In this paper, we introduce a novel approach to identify obfuscated files based on anomalies in their instructions-based characteristics. We detect the presence of interleaving instructions which are the result of the opaque predicate anti-disassembly trick, and present distinguishing statistical properties based on the opcodes and control flow graphs of obfuscated files. Our detection system combines these features with other file structural features and leads to a very good result of detecting obfuscated malware.

1 May 2008
Verified
Conference Paper
Closed access
ZWZhiqiang Wu
Zhiqiang Wu
PRPaul Ratazzi
Paul Ratazzi
VCVasu D. Chakravarthy
Vasu D. Chakravarthy
LHLang Hong
Lang Hong
In this paper, we present a quantitative performance evaluation of non-contiguous multi-carrier code vision multiple access (NC-MC-CDMA) for cognitive radio in a dynamic spectrum access (DSA) network. In a DSA network, multi-carrier based cognitive radio transceivers need to deactivate some of its subcarriers to avoid interference to primary users. However, by deactivating subcarriers, orthogonality among different spreading codes are lost, leading to poor BER performance. The performance of the NC-MC-CDMA can be improved by adaptive spreading code adjustment to compensate for the loss of orthogonality. However, since Hadamard-Walsh codes only exist for certain code length, loss of orthogonality can only be minimized instead of eliminated for many cases. On the other hand, orthogonal Carrier Interferometry codes exist for code length of any integer. Hence, by applying non-contiguous CI/MC-CDMA into DSA, the loss of orthogonality among spreading codes caused by deactivating subcarriers can be eliminated. As a direct result, adaptive NC-CI/MC-CDMA significantly outperforms adaptive NC-MC-CDMA using Hadamard-Walsh codes.

1 October 2017
Verified
Conference Paper
Closed access
MSMoustafa Saleh
Moustafa Saleh
ERE. Paul Ratazzi
E. Paul Ratazzi
SXShouhuai Xu
Shouhuai Xu
The large number of malicious files that are produced daily outpaces the current capacity of malware analysis and detection. For example, Intel Security Labs reported that during the second quarter of 2016, their system found more than 40M of new malware [1]. The damage of malware attacks is also increasingly devastating, as witnessed by the recent Cryptowall malware that has reportedly generated more than $325M in ransom payments to its perpetrators [2]. In terms of defense, it has been widely accepted that the traditional approach based on byte-string signatures is increasingly ineffective, especially for new malware samples and sophisticated variants of existing ones. New techniques are therefore needed for effective defense against malware. Motivated by this problem, the paper investigates a new defense technique against malware. The technique presented in this paper is utilized for automatic identification of malware packers that are used to obfuscate malware programs. Signatures of malware packers and obfuscators are extracted from the CFGs of malware samples. Unlike conventional byte signatures that can be evaded by simply modifying one or multiple bytes in malware samples, these signatures are more difficult to evade. For example, CFG-based signatures are shown to be resilient against instruction modifications and shuffling, as a single signature is sufficient for detecting mildly different versions of the same malware. Last but not least, the process for extracting CFG-based signatures is also made automatic.

1 January 2005
Verified
Conference Paper
Closed access
XLXiaohua Li
Xiaohua Li
ERE.P. Ratazzi
E.P. Ratazzi
Information-theoretic secrecy gives the strongest information security that is important for military wire- less networks. In this paper, we show that random- ized MIMO transmissions can achieve such secrecy. A method is proposed to randomize the MIMO trans- mission coefficients. The received signal of the adver- sary has some special statistical distributions, based on which the indeterminacy of the adversary's blind deconvolution is proved. Receiving error rates and secret channel capacity are analyzed and simulated. This paper points out a practical way to realize the well-known wire-tap channel for perfect secrecy, which is one of the interesting challenges in information the- ory. The proposed method is also useful for key man- agement in military wireless networks.