{"title":"A New Light-Weight JPEG2000 Encryption Technique Based on Arithmetic Coding","authors":"H. Y. El-Arsh, Y. Mohasseb","doi":"10.1109/MILCOM.2013.311","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.311","url":null,"abstract":"We propose a novel multimedia security framework based on the nonlinear properties of the arithmetic coder, which is used by most image and video coding standards in the entropy coding stage. This technique performs simultaneous entropy coding and encryption which reduces the delay and the required system resources by manipulating the probability maps of the arithmetic coder. Furthermore, the proposed technique does not incur any additional complexity for performing encryption, nor does it increase the size of the compressed image. Consequently, when applying the proposed technique to un-encrypted images, in contrast to standard encryption techniques, the decoder can still progressively display the decoded/deciphered image. Furthermore, there is no companion error-propagation usually associated with this type of encryption. The proposed scheme does not need to append any extra bits to the coded bit stream, unlike most block ciphers. The proposed technique can be applied to any multimedia coder using arithmetic coding. However, the implementation in this paper is tailored to the JPEG2000 standard. Also, we introduce assessments and measurements for this encryption technique.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"11 suppl_1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125785571","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Breaking the Barrier of Transmission Noise in Full-Duplex Radio","authors":"Y. Hua, Yiming Ma, Ping Liang, A. Cirik","doi":"10.1109/MILCOM.2013.263","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.263","url":null,"abstract":"The key technical challenge in making a full-duplex radio is self-interference cancelation (SIC). The self-interference received by a full-duplex radio has two major components: one corresponds to an information-carrying waveform meant for a remote radio and the other corresponds to the noise generated from the transmit chain of the full-duplex radio. The transmission signal-to-noise ratio (SNR) of a typical radio is only about 30dB. This severely limits the performance of any SIC methods which ignore the transmission noise. None of the previously known digital or hybrid methods for SIC has any built-in mechanism to handle the transmission noise. In this paper, we present a new analog-digital hybrid method whose performance is no longer limited by the transmission noise. This method also involves a blind system identification and equalization algorithm for finding the optimal parameters of the cancelation filter.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129970316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cost-Based Placement of Virtualized Deep Packet Inspection Functions in SDN","authors":"M. Bouet, Jérémie Leguay, V. Conan","doi":"10.1109/MILCOM.2013.172","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.172","url":null,"abstract":"In today's IT systems, cyber security requires fine-grained, flexible, adaptable and cost optimized monitoring mechanisms. The emergence of new networking technologies, like Network Function Virtualization (NFV) and Software Defined Networking (SDN), opens up new venues for large scale adoption of these cyber security tools. In particular, Deep Packet Inspection (DPI) engines can be virtualized and dynamically deployed as pieces of software on commodity hardware. Deploying such software DPI engines is costly in terms of license fees and power consumption. Designing cost effective DPI engine deployment strategies that meet the cybersecurity operational constraints is thus mandatory for the adoption of this approach. For this purpose, we propose a method, based on genetic algorithms, that optimizes the cost of DPI engine deployment, minimizing their number, the global network load and the number of unanalyzed flows. We conduct several experiments with different types of traffic and different cost structures. The results show that the method is able to reach a trade-off between the number of DPI engines and network load. Furthermore, the global cost can be reduced up to 58% when relaxing the constraint on the used link capacity, that is the provisioning rate.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130118453","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Measurement-Based Analysis of Two-Hop Cooperative Relaying","authors":"G. Eriksson, S. Linder, Jimmi Grönkvist","doi":"10.1109/MILCOM.2013.98","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.98","url":null,"abstract":"For tactical military communications, ad hoc networks are an attractive choice because they can provide good area coverage without the vulnerabilities of any central node or base station. Their performance is, however, strongly dependent on the ability to maintain link quality information, and to distribute the changing routing tables, in a timely and efficient manner in highly mobile scenarios. A relatively new concept of cooperative relaying, in which several relay nodes simultaneously retransmits identical copies of the message on the same channel, is promising as it eliminates the need of routing. In this paper, we analyze the performance of an OFDM based cooperative simultaneous relaying scheme for two-hop networks. The networks are simulated based on measured channels for the individual links. The results are compared with the performance for the traditional single relay technique with optimal and suboptimal route information. The results show that the performance of the cooperative relaying scheme in the investigated scenario is equal to, or better than, the performance for the best route for the single relay scheme in a large majority of the simulated networks. However, some fraction of the networks shows a worse result for the cooperative scheme. This fraction decreases as the bandwidth increases. Furthermore, the performance for the cooperative relay scheme show significant increase in performance when compared to the single relay scheme for the next-best route. Moreover, we observe that the performance of the cooperative relay scheme, in general, is non-reciprocal with respect to the direction of transmission for a given pair of terminal nodes.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129687576","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dynamic Selection of Persistence and Transport Layer Protocols in Challenged Networks","authors":"A. Rosenfeld, R. N. Lass, W. Regli, J. Macker","doi":"10.1109/MILCOM.2013.248","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.248","url":null,"abstract":"This work applies a distributed algorithm utilizing Markov Random Fields (MRFs) to the problem of dynamically selecting Session and Transport layer protocols in challenged networks such as mobile ad-hoc networks. It motivates the problem by identifying the primary network properties which affect Message Delivery Ratio (MDR) in networks with varying degrees of connectivity and traffic load. Using this information, local and remote observations are used to select a set of protocols which should perform the best. Analysis shows that dynamically selecting a set of protocols can deliver up to 50% more messages in challenged environments, and never under-performs statically choosing protocols.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129219385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Advantages of Mobile Broadband Communications Services for Military Applications","authors":"D. Wilcoxson","doi":"10.1109/MILCOM.2013.53","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.53","url":null,"abstract":"Military operations continually evolve in response to threats and regardless of budget stress the need for quality communications is essential to modern military effectiveness. In particular, highly asymmetric opposition and non-traditional conflicts put a significant emphasis on intelligence gathering and real-time dissemination of that information to military leaders and operators. Additionally, current conflict experience shows that the location of operation of military and intelligence forces can change dramatically over short periods of time, leading to highly dispersed forces and the need to provide for worldwide reach of those forces. With such dynamic vectoring of these operations it is clear that communications over a global scale is needed. Furthermore, the minimum communications need has shifted from basic voice and data communications to highly multimedia-intensive video and other broadband communications, both in regional operational areas and for communications enroute to forward operating locations. The sheer amount of required broadband communications to support operations overwhelms MILSATCOM systems such as DSCS and WGS and thus a majority of such communication is currently supported by commercial satellites and commercial services on those satellites. In fact a variety of enabling services are being provided on global shared, global private, and regional private networks to military forces and in a significant number of cases provide more value to the military end user than could be provided with solely military-owned and operated networks. This paper examines key system advantages of commercially provided mobile broadband services, when such services makes sense compared to government-owned and operated systems/networks, when amalgams of multiple networks make sense, and describes why such architectures of services and systems can provide superior value to military end users now and in the future.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129636336","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Migrating an OS Scheduler into Tightly Coupled FPGA Logic to Increase Attacker Workload","authors":"Jason Dahlstrom, Stephen Taylor","doi":"10.1109/MILCOM.2013.171","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.171","url":null,"abstract":"This paper explores the idea of increasing attacker workload by hiding core operating system functions within Field Programmable Gate Array (FPGA) logic, recently introduced within the fabric of high-performance embedded processors. The research is conducted in the context of a from-scratch micro-kernel operating system (BEAR [1]) under development at Dartmouth. This paper explains the performance costs and security enhancements associated with a rudimentary hardware scheduler on the Xilinx Zynq Z-7020 All Programmable System-on-Chip. Baseline measurements are collected for a traditional C-based software implementation. Implementations coded directly in VHDL and transformed from C to HDL via High Level Synthesis (HLS) are then compared. Performance and hardware resource utilization costs between AXI4 and AXI4-lite processor-FPGA interfaces are also evaluated.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125045214","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Relay Location Optimization for Full-Duplex Decode-and-Forward Relaying","authors":"Bo Yu, Liuqing Yang, Xiang Cheng, Rui Cao","doi":"10.1109/MILCOM.2013.11","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.11","url":null,"abstract":"In this paper, we investigate the optimum relay location for full-duplex decode-and-forward (DF) relaying systems. The outage probability is adopted as the optimization criterion and a relay location optimization problem is formulated. Analytical and numerical results are provided to show the advantages of the location optimization. The intriguing effect of residual self-interference (RSI) introduced by full-duplex transmission is examined in terms of the optimal relay location, outage probability improvement and power saving benefits.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"44 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128916426","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Partitioned-Stream Communications for Increased Spectral Efficiency in CDMA Systems","authors":"C. Schlegel, M. Jar","doi":"10.1109/MILCOM.2013.75","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.75","url":null,"abstract":"Interleaved and partitioned spread-spectrum signaling is proposed to increase the effectively available spectral efficiency in situations where multiple uncoordinated terminals communicate with a central receiver. The concept of partitioned signaling (PS) is applied to stream-based signaling and embedded pilot signals are proposed as an effective way to achieve synchronization of the multiple signal streams.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125609424","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Rapid Permissions-Based Detection and Analysis of Mobile Malware Using Random Decision Forests","authors":"W. Glodek, Richard E. Harang","doi":"10.1109/MILCOM.2013.170","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.170","url":null,"abstract":"The explosion in mobile malware has led to the need for early, rapid detection mechanisms that can detect malware and identify risky applications prior to their deployment on end-user devices without the high cost of manual static and dynamic analysis. Previous work has shown that specific combinations of Android permissions, intents, broadcast receivers, native code and embedded applications can be effectively used to identify potentially malicious applications. We extend this work by using frequent combinations of such attributes as training features for random decision forest classification of malicious and benign applications. We demonstrate that using combinations of frequently-occuring permissions in this manner significantly improves previous results, and provides true positive rates in excess of 90% while maintaining tractable false positive rates. This is true even with novel malware that is not reliably detected at the time of release by conventional anti-malware tools. In addition, the auxiliary information generated by the random decision forest algorithm provides useful insights into the key indicators of malicious activity and the functionality of the associated malware.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121282590","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}