Aleksandra Mileva

Prof. Dr. Aleksandra Mileva

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
1 May 2021 in Computers & Security
Verified
Journal Article
Open access
Aleksandra MilevaAleksandra Mileva
Aleksandra Mileva
AVAleksandar Velinov
Aleksandar Velinov
LHLaura Hartmann
Laura Hartmann
Steffen WendzelSteffen Wendzel
Steffen Wendzel
WMWojciech Mazurczyk
Wojciech Mazurczyk

1 January 2014 in Open Computer Science
Verified
Journal Article
Open access
PDF file
Aleksandra MilevaAleksandra Mileva
Aleksandra Mileva
BPBoris Panajotov
Boris Panajotov
We give a survey of different techniques for hiding data in several protocols from the TCP/IP protocol stack. Techniques are organized according to affected layer and protocol. For most of the covert channels its data bandwidth is given.

4 November 2019 in IEEE Access
Verified
Journal Article
Open access
AVAleksandar Velinov
Aleksandar Velinov
Aleksandra MilevaAleksandra Mileva
Aleksandra Mileva
SWSteffen Wendzel
Steffen Wendzel
WMWojciech Mazurczyk
Wojciech Mazurczyk

19 December 2012 in Glasnik Matematicki
Verified
Journal Article
Closed access
Aleksandra MilevaAleksandra Mileva
Aleksandra Mileva
SMSmile Markovski
Smile Markovski
Shapeless quasigroups are needed for cryptography purposes. In this paper, we construct shapeless quasigroups by the diagonal method from orthomorphisms over abelian groups. We use generalizations of Feistel networks as orthomorphisms. We introduce parameters into several types of Extended Feistel networks and Generalized Feistel-non linear feedback shift registers and, by suitable choice of the parameter values, different shapeless quasigroup can be used in every application

6 May 2025 in ACM Computing Surveys
Verified
Journal Article
Open access
Steffen WendzelSteffen Wendzel
Steffen Wendzel
LCLuca Caviglione
Luca Caviglione
WMWojciech Mazurczyk
Wojciech Mazurczyk
Aleksandra MilevaAleksandra Mileva
Aleksandra Mileva
JDJana Dittmann
Jana Dittmann
SZSebastian Zillien
Sebastian Zillien
A unified understanding of terms is essential for every scientific discipline: steganography is no exception. Being divided into several domains (e.g., network and text steganography), it is crucial to provide a unified terminology as well as a taxonomy that is not limited to few applications or areas. A prime attempt toward a unified understanding of terms was conducted in 2015 with the introduction of a pattern-based taxonomy for network steganography. In 2021, the first work toward a pattern-based taxonomy for all domains of steganography was proposed. However, this initial attempt still faced several shortcomings, e.g., remaining inconsistencies and a lack of patterns for several steganography domains. As the consortium who published the previous studies on steganography patterns, we present the first comprehensive pattern-based taxonomy tailored to fit all known domains of steganography, including smaller and emerging areas, such as filesystem, IoT/CPS, and AI/ML steganography. To make our contribution more effective and promote the use of the taxonomy to advance research, we also provide a unified description method joint with a thorough tutorial on its utilization.

15 January 2021
Verified
Book Chapter
Open access
PDF file
Aleksandra MilevaAleksandra Mileva
Aleksandra Mileva
VDVesna Dimitrova
Vesna Dimitrova
OKOrhun Kara
Orhun Kara
MMMiodrag J. Mihaljević
Miodrag J. Mihaljević
The main objective of this chapter is to offer to practitioners, researchers and all interested parties a brief categorized catalog of existing lightweight symmetric primitives with their main cryptographic features, ultimate hardware performance, and existing security analysis, so they can easily compare the ciphers or choose some of them according to their needs. Certain security evaluation issues have been addressed as well. In particular, the reason behind why modern lightweight block cipher designs have in the last decade overwhelmingly dominated stream cipher design is analyzed in terms of security against tradeoff attacks. It turns out that it is possible to design stream ciphers having much smaller internal states.