Mariana Durcheva

Dr. Mariana Durcheva

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 January 2012 in AIP Conference Proceedings
Verified
Conference Paper
Open access
MDMariana Durcheva
Mariana Durcheva
ITIvan D. Trendafilov
Ivan D. Trendafilov
When we replace addition and multiplication of real numbers by the operations of taking the maximum of two numbers and of adding two numbers respectively, we obtain the so-called max-algebra which offers an attractive language to deal with certain problems in automata theory, scheduling theory, discrete event systems, manufacturing systems, telecommunication networks, parallel processing systems and traffic control. The aim of this paper is to employ max-algebra as platforms for secret key establishment between two individuals whose only means of communication is a public channel. The proposed new cryptographic protocols are based on the difficulty of solving matrix equations since matrices over max-semirings are generally not invertible.

1 July 2017
Verified
Conference Paper
Open access
CKChristophe Kiennert
Christophe Kiennert
PRPierre-Olivier Rocher
Pierre-Olivier Rocher
MIMalinka Ivanova
Malinka Ivanova
ARAnna Rozeva
Anna Rozeva
MDMariana Durcheva
Mariana Durcheva
Joaquin Garcia-AlfaroJoaquin Garcia-Alfaro
Joaquin Garcia-Alfaro
E-Assessment is an innovative form for the evaluation of learners' knowledge and skills in online education, as well as in blended-learning environments, where part of the assessment activities is carried out online. As e-assessment involves online communication channel between learners and educators, as well as data transfer and storage, security measures are required to protect the environment against system and network attacks. The issue concerning security is challenging from both educational and technical point of views. Such issues are discussed under the scope of the TeSLA project. Educational challenging problems at e-assessment are analyzed and technical architectural recommendations for securing the e-assessment system according to the General Data Protection Regulation are provided.

25 April 2017 in Mathematics in Computer Science
Verified
Journal Article
Closed access
PDF file
MDMariana Durcheva
Mariana Durcheva
EVElena Varbanova
Elena Varbanova

13 November 2019 in AIP Conference Proceedings
Verified
Conference Paper
Open access
PDF file
MDMariana Durcheva
Mariana Durcheva
PTPavel Tsankov
Pavel Tsankov
We investigate similarities and differences between stock and cryptocurrency networks obtained from log-return and volatility time series. We constructed correlation and Fast Fourier Transform based graphs and minimum spanning trees from a set of 100 highly capitalized cryptocurrencies and 100 highly capitalized NASDAQ stocks over a time window of fixed length. Our analysis is based on comparison between both economies in terms of network properties. We also examined distributions of node degrees and edge weights. Our results show that cryptocurrencies and companies with high capitalization tend to correspond to central and densely connected nodes. Network topologies for both economies and node degree distributions are rather similar. Nevertheless, the crypto-economy is more correlated and more strongly linked to important nodes, unlike the graphs of NASDAQ stocks, where we observed clusters of nodes having small dissimilarities.

1 January 2015 in AIP Conference Proceedings
Verified
Conference Paper
Closed access
MDMariana Durcheva
Mariana Durcheva
MRMartin Rachev
Martin Rachev
The problem of solving two sided linear equations in the idempotent semirings R ¯ m a x and R ¯ m i n has been proved to be reducible to the problem mean payoff game which is of the NP∩ coNP type. In the present paper, we use the mentioned security results and construct a new public key encryption scheme based on the hardness of the problem of solving two sided linear equations in the idempotent semirings.

7 May 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
MDMariana Durcheva
Mariana Durcheva
KDKiril Danilchenko
Kiril Danilchenko
In the quest for robust and efficient digital communication, this paper introduces cutting-edge key exchange protocols leveraging the computational prowess of tropical semirings and the structural resilience of block matrices. Moving away from the conventional use of finite fields, these protocols deliver markedly faster processing speeds and heightened security. We present two implementations of our concept, each utilizing a different platform for the set of commuting matrices: one employing tropical polynomials of matrices and the other employing Linde–de la Puente matrices. The inherent simplicity of tropical semirings leads to a decrease in operational complexity, while using block matrices enhances our protocols’ security profile. The security of these protocols relies on the Matrix Decomposition Problem. In addition, we provide a comparative analysis of our protocols against existing matrix block-based protocols in finite fields. This research marks a significant shift in cryptographic protocol design, is specifically tailored for demanding engineering applications, and sets a new standard in secure and efficient digital communication.