Miljenko Švarcmajer

Mr. Miljenko Švarcmajer

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
11 July 2025 in Technologies
Verified
Journal Article
Open access
PDF file
ILIvica Lukić
Ivica Lukić
MKMirko Kohler
Mirko Kohler
ZKZdravko Krpic
Zdravko Krpic
MŠMiljenko Švarcmajer
Miljenko Švarcmajer
This paper presents an integrated Smart City platform that combines digital twin technology, advanced machine learning, and a private blockchain network to enhance data-driven decision making and operational efficiency in both public enterprises and small and medium-sized enterprises (SMEs). The proposed cloud-based business intelligence model automates Extract, Transform, Load (ETL) processes, enables real-time analytics, and secures data integrity and transparency through blockchain-enabled audit trails. By implementing the proposed solution, Smart City and public service providers can significantly improve operational efficiency, including a 15% reduction in costs and a 12% decrease in fuel consumption for waste management, as well as increased citizen engagement and transparency in Smart City governance. The digital twin component facilitated scenario simulations and proactive resource management, while the participatory governance module empowered citizens through transparent, immutable records of proposals and voting. This study also discusses technical, organizational, and regulatory challenges, such as data integration, scalability, and privacy compliance. The results indicate that the proposed approach offers a scalable and sustainable model for Smart City transformation, fostering citizen trust, regulatory compliance, and measurable environmental and social benefits.

13 January 2025 in Technologies
Verified
Journal Article
Open access
PDF file
MŠMiljenko Švarcmajer
Miljenko Švarcmajer
DIDenis Ivanović
Denis Ivanović
TRTomislav Rudec
Tomislav Rudec
ILIvica Lukić
Ivica Lukić
This paper investigates the application of graph theory and variants of greedy graph coloring algorithms for the optimization of distributed peer-to-peer networks, with a special focus on private blockchain networks. The graph coloring problem, as an NP-hard problem, presents a challenge in determining the minimum number of colors needed to efficiently allocate resources within the network. The paper deals with the influence of different graph density, i.e., the number of links, on the efficiency of greedy algorithms such as DSATUR, Descending, and Ascending. Experimental results show that increasing the number of links in the network contributes to a more uniform distribution of colors and increases the resistance of the network, whereby the DSATUR algorithm achieves the most uniform color saturation. The optimal configuration for a 100-node network has been identified at around 2000 to 2500 links, which achieves stability without excessive redundancy. These results are applied in the context of a private blockchain network that uses optimal connectivity to achieve high resilience and efficient resource allocation. The research findings suggest that adapting network configuration using greedy algorithms can contribute to the optimization of distributed systems, making them more stable and resilient to loads.

4 May 2026 in IEEE Access
Verified
Journal Article
Open access
MŠMiljenko Švarcmajer
Miljenko Švarcmajer
DŠDina Šabanović
Dina Šabanović
MKMirko Kohler
Mirko Kohler
ILIvica Lukić
Ivica Lukić
Quantum computers pose a long-term threat to classical cryptographic systems, including those used in blockchain platforms. While prior work has estimated the number of logical qubits required to compromise cryptographic schemes such as RSA and ECDSA, relatively few studies have modeled when such quantum capacity might realistically be achieved. In this paper, we construct a time-series dataset of publicly documented gate-based quantum processors developed between 2016 and 2025. We estimate the number of logical qubits under three fault-tolerance scenarios and apply forecasting models based on exponential trend analysis. Our results provide year-by-year projections for when quantum computers may reach logical qubit thresholds associated with widely used cryptographic schemes. These projections are mapped to specific blockchain security mechanisms, offering a practical timeline for transition planning toward post-quantum systems. These projections should be interpreted as indicators of logical qubit availability rather than precise estimates of full cryptanalytic execution timelines.

Verified
Journal Article
Open access
PDF file
TKTea Krčmar
Tea Krčmar
DŠDina Šabanović
Dina Šabanović
MŠMiljenko Švarcmajer
Miljenko Švarcmajer
ILIvica Lukić
Ivica Lukić
Anomaly detection on tabular data is widely used in fraud detection, predictive maintenance, and medical screening. While heterogeneous ensembles combining multiple detection paradigms achieve strong performance, their computational cost limits deployment in latency-sensitive or resource-constrained environments. We propose KD-AnomalyNet, a teacher–student framework that distills anomaly knowledge from a high-capacity ensemble into a lightweight neural model for efficient inference. Beyond performance replication, we study how anomaly representations transfer during distillation. To this end, we introduce a noise perturbation analysis that serves as a diagnostic probe for representation stability without introducing additional trainable components. Experiments on ten benchmark datasets show that the distilled model preserves up to 98.5% of the teacher’s AUC-ROC on the nine capacity-sufficient datasets (84.7% mean retention across all ten datasets) while achieving 26–181× inference speedups. Our analysis reveals which forms of anomaly knowledge transfer reliably—global outliers (78% transfer) and isolation-based detection (88% retention)—and which degrade under compression—local outliers (20% transfer) and neighborhood-based detection (76% retention)—providing practical guidance for deploying distilled anomaly detectors.

26 August 2025 in Sensors
Verified
Journal Article
Open access
PDF file
MŠMiljenko Švarcmajer
Miljenko Švarcmajer
MKMirko Kohler
Mirko Kohler
ZKZdravko Krpic
Zdravko Krpic
ILIvica Lukić
Ivica Lukić
The increasing demand for decentralized and user-controlled cryptographic key management in blockchain ecosystems has created interest in alternative entropy sources that do not rely on dedicated hardware. This study investigates whether commercial smartwatches can generate sufficient entropy for secure local key generation by utilizing their onboard sensors. An open-source Wear OS application was developed to harvest sensor data in two acquisition modes: still mode, where the device remains stationary, and shake mode, where data collection is triggered by motion events exceeding a predefined acceleration threshold. A total of 4800 still-mode and 4800 shake-mode samples were collected, each producing 11,400 bits of sensor-generated data. Entropy was evaluated using statistical metrics commonly employed in entropy analysis, including Shannon entropy, min-entropy, Markov dependency analysis, and compression-based redundancy estimation. The shake mode achieved Shannon entropy of 0.997 and min-entropy of 0.918, outperforming the still mode (0.991 and 0.851, respectively) and approaching the entropy levels of software-based random number generators. These results demonstrate that smartwatches can act as practical entropy sources for cryptographic applications, provided that appropriate post-processing, such as cryptographic hashing, is applied. The method offers a low-cost, transparent, and user-friendly alternative to specialized hardware wallets, aligning with the principles of decentralization and self-sovereign identity.

Verified
Journal Article
Open access
PDF file
MŠMiljenko Švarcmajer
Miljenko Švarcmajer
MKMirko Kohler
Mirko Kohler
ZKZdravko Krpic
Zdravko Krpic
ILIvica Lukić
Ivica Lukić
Modern data-driven distributed systems increasingly rely on blockchain technologies to ensure trust, transparency, and decentralized coordination. However, the rapid proliferation of consensus mechanisms has created a complex design space, making the selection of an appropriate protocol a non-trivial architectural and decision-making challenge. Different consensus mechanisms rely on distinct security resources, validator admission models, and agreement architectures, leading to diverse trade-offs between scalability, decentralization, performance, and governance. Existing studies primarily focus on classification or performance comparison of consensus mechanisms, while the problem of systematic, requirement-driven selection remains insufficiently addressed. In particular, there is a lack of structured approaches that integrate multiple system requirements into a unified decision framework suitable for real-world environments. To address this gap, this paper proposes a consensus-driven, layered framework for blockchain consensus mechanism selection, formulated as a multi-criteria decision problem. The framework organizes the consensus design space across key architectural dimensions and analyzes 32 consensus mechanisms, enabling systematic comparison and supporting data-driven decision-making. The approach is further demonstrated through five representative use-case scenarios, showing its applicability in optimizing distributed system design.