AOAlina Olteanu

Alina Olteanu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Alina Olteanu has a total of 26 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Corrections to “A Survey on DNA-Based Cryptography and Steganography”

    by Tasnuva Mahjabin, Alina Olteanu, Yang Xiao, Wenlin Han, Tieshan Li, Wei Sun

    In the above article [1] , we missed to citing one reference [2] and some references were incorrect.

  • Open Access

    A Survey on DNA-Based Cryptography and Steganography

    by Tasnuva Mahjabin, Alina Olteanu, Yang Xiao, Wenlin Han, Tieshan Li, Wei Sun

    This paper provides a comprehensive survey of different techniques for Deoxyribonucleic acid (DNA) -based cryptography and steganography. DNA-based cryptography is an emerging field that utilizes DNA molecules’ massive parallelism and vast storage capacity to encode and decode information. The field has gained significant attention in recent years due to its potential advantages over traditional cryptographic methods, such as high storage capacity, low error rate, and resistance to environmental factors. In this paper, we review three types of DNA-based cryptography: natural DNA cryptography, pseudo-DNA cryptography, and DNA-based steganography. For each technique, we discuss its advantages and limitations, as well as future directions for research. Our goal is to contribute to a better understanding of the applications and limitations of using DNA for cryptographic purposes. We believe that our analysis will be useful for researchers working on developing new techniques for secure data transmission using DNA molecules.


  • Open Access

    Optimizing the Number and Size of Signature Cells in a Modulated Sensor System

    by Alina Olteanu

    The localization and tracking capabilities of binary sensors can be significantly enhanced by associating sensor nodes with modulators. The addition of modulators segments the detection area into subregions, called signature cells. While much of the related research focuses on modulator design and sensor data processing, there are few studies on the optimum number of cells, especially when considering small area cells with small area variances. This paper studies the optimum number of cells for varying numbers of per-sensor modulators under a placement scenario that produces signature cells with small area variances. We first derive the optimum number of signature cells and find necessary and sufficient conditions under which the maximum is achieved. We then focus on the sensors’ spatial awareness and deduct the conditions under which maximal spatial awareness is achieved. Finally, we study the asymptotic behavior of the individual cells’ areas in terms of the number of modulators. Our study can guide researchers in enhancing the tracking and localization precision of applications and improve the spatial awareness of sensors.


  • Optimal Design for Modulated Binary Sensors

    by Alina Olteanu, Longxiang Luo, Yang Xiao, Wei Liang

    A paramount factor limiting the applications of binary sensors is these senors’ on-off property outputting binary digits of “0” or “1”. To overcome this limitation, modulators or obscurants are added to enhance the sensing ability of binary sensors and render them usable in applications such as multi-target tracking and human activity recognition. Obscurants segment the field of interest into subregions and distinguish each subregion by a list of sensor states called signatures. This paper studies two placement scenarios in a two-dimensional planar graph. In the first scenario, we prove upper and lower bounds on the maximum number of achievable signatures. In the second scenario, starting from the placement of sensors and obscurants in which the maximum number of signatures is achievable, we propose a novel mathematical model based on four main metrics: the object space size, the sensor space size, the obscurant space size, and the sizes of individual obscurants. We find the minimum and maximum radiuses that bound the object detection area given the number and sizes of sensors and obscurants. We derive the obscurant space size as a function of the object space size and the size of individual obscurants. We also provide a linear relationship formula between the obscurant space radius, the sensor space radius, and the obscurants’ radiuses and conduct modeling experiments to study the relationship between these metrics. Finally, we deduct an explicit formula for the maximum obscurant space size for the sensor space and the individual obscurant sizes.


  • Nonintrusive tracing in the Internet

    by Alina Olteanu, Yang Xiao, Jing Liu, Thomas M. Chen, C. L. Philip Chen

    SUMMARY: Intruders that log in through a series of machines when conducting an attack are hard to trace because of the complex architecture of the Internet. The thumbprinting method provides an efficient way of tracing such intruders by determining whether two connections are part of the same connection chain. Because many connections are transient and therefore short in length, choosing the best time interval to thumbprint over can be an issue. In this paper, we provide a way to shorten the time interval used for thumbprinting. We then study some special properties of the thumbprinting function. We also study another mechanism for tracing intruders in the Internet based on a timestamping approach, which passively monitors flows between source and destination pairs. Given a potentially suspicious source, we identify its true destination. We compute the error probability of our algorithm and show that its value decreases exponentially as the observation time increases. Our simulation results show that our approach performs well. Copyright © 2012 John Wiley & Sons, Ltd.


  • Open Access

    A lightweight block cipher based on a multiple recursive generator for wireless sensor networks and RFID

    by Alina Olteanu, Yang Xiao, Fei Hu, Bo Sun, Hongmei Deng


  • Weaving a proper net to catch large objects in wireless sensor networks

    by Alina Olteanu, Yang Xiao, Kui Wu, Xiaojiang Du

    Wireless sensor networks consist of a large number of sensors and have been broadly used for intrusion detection in surveillance systems. To guarantee detection quality, such networks are usually over-engineered, i.e., more than required sensors are deployed and remain active in order to cover each point in the monitored field with a high probability at any time instance. Existing sensor scheduling schemes based on the point coverage model tightly weave a sensor "net" that is unnecessarily dense. Intuitively, when the size and the shape of intrusion objects are considered, any net with holes no smaller than the size of the intrusion object would work fine. With this design philosophy in mind, we build a new mathematical model to investigate the impact of size and shape of intrusion objects on network configuration. We derive analytical results that provide practitioners with insights on how to weave an effective sensor "net" for intrusion object detection with minimum number of active sensors.


  • Security overhead and performance for aggregation with fragment retransmission (AFR) in very high-speed wireless 802.11 LANs

    by Alina Olteanu, Yang Xiao

    In this paper, we study the overhead introduced by the advanced encryption standard cipher in the context of wireless LANs, specifically at the medium access control layer, as described in the 802.11 standard developed by the 802.11n task group. The advanced encryption standard is incorporated into existing aggregation schemes for 802.11 wireless LANs in order to achieve secure transmission of frames. We compute the maximum throughput, optimal frame, and fragment sizes which can be achieved in this context and compare them to the optimal values when encryption is not used. We evaluate the delay performance of such a scheme in the context of encryption and study asymptotic properties of the medium access control layer efficiency, expected frame size, and throughput.


  • Optimization between AES security and performance for IEEE 802.15.3 WPAN

    by Alina Olteanu, Yang Xiao, Yan Zhang

    Ultra-wideband (UWB) is a new technology that enables wireless connectivity with consistent high data rates across multiple devices, such as high-definition television (HDTV) receivers, PCs, printers and digital cameras, within the digital home, and the office. In this paper, we focus on UWB transmissions where multiple accesses to the channel are coordinated by the IEEE 802.15.3 medium access control mechanism proposed in the IEEE 802.15.3a task group. Advanced encryption standard (AES), the most popular encryption cipher used nowadays, is used to ensure the security of the transmission. We study the overhead introduced by applying the AES cipher to the transmitted frames. Specifically, we analyze the tradeoff between throughput, payload size, and channel error when AES is used to encrypt the frames.


  • A Lightweight Block Cipher Based on a Multiple Recursive Generator

    by Alina Olteanu, Y. Xiao, Fei Hu, Bo Sun

    In this paper, we propose to use a Multiple Recursive Generator (MRG) to generate sequences of numbers with very long periods, i.e., pseudo-random sequences. The MRG effectively constructs a block cipher which satisfies important quality requirements such as security, long period, randomness, and efficiency. The proposed cipher is a light weight cipher, which is very useful for resource limited resources such as sensor nodes in sensor networks, RFID tags, etc.