Yurii Baryshev
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Yurii Baryshev has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Stefan Köpsell
Barkhausen Institut, Dresden, Germany
2 shared publications - Yevhen Zolotavkin
Barkhausen Institut
2 shared publications - Andrii Skip
Vinnytsia National Technical University
1 shared publication - Dmytro Zarezenko1 shared publication
Eduard Kolibabchuk
Information Protection Department, Vinnytsia National Technical University, Ukraine
1 shared publication- Jannik Mähn1 shared publication
Latest Publications
- Open Access
- 26 February 2026
- Published by V.M. Glushkov Institute of Cybernetics in International Scientific Technical Journal "Problems of Control and Informatics"
- Vol. 71 (1) , 82-95
Mandatory access control method application for smart contracts
The task of access control in distributed information systems utilizing smart contracts is considered. A concise review of the main access control approaches — mandatory, role-based, and discretionary — is presented, along with their key features and limitations. Particular attention is paid to the access control approach based on mandatory access control (MAC). Known access control approaches applied in both traditional non-distributed and distributed information systems utilizing smart contracts are analyzed. The peculiarities of these distributed information systems that influence access control decisions are identified. Based on these peculiarities, the drawbacks of the discretionary and role-based approaches are determined, and the mandatory approach is proposed. To formalize the approach, a mathematical description of MAC for smart contracts is provided. To demonstrate the concept, several examples of implementing this mathematical description are presented in the form of Solidity code fragments: a direct naive implementation, an implementation using modifiers, and an implementation based on a dedicated access manager contract. The code is described, its main idea is explained, and possible directions for further scaling of these code fragments are outlined. Based on the analysis of the proposed applications, the modifier-based implementation of MAC is identified as the most efficient in terms of computational resources, while the access manager approach is considered the most scalable. The latter approach is proposed for complex distributed systems involving multiple smart contracts. The results of the experimental study are presented to compare the performance indicators of the proposed access control implementations with known implementations. Prospects for further research aimed at improving access control in distributed information systems utilizing smart contracts are identified.
- 26 February 2026
- Published by V.M. Glushkov Institute of Cybernetics in International Scientific Technical Journal "Problems of Control and Informatics"
- Vol. 71 (1) , 82-95
Open AccessMandatory access control method application for smart contracts
The task of access control in distributed information systems utilizing smart contracts is considered. A concise review of the main access control approaches — mandatory, role-based, and discretionary — is presented, along with their key features and limitations. Particular attention is paid to the access control approach based on mandatory access control (MAC). Known access control approaches applied in both traditional non-distributed and distributed information systems utilizing smart contracts are analyzed. The peculiarities of these distributed information systems that influence access control decisions are identified. Based on these peculiarities, the drawbacks of the discretionary and role-based approaches are determined, and the mandatory approach is proposed. To formalize the approach, a mathematical description of MAC for smart contracts is provided. To demonstrate the concept, several examples of implementing this mathematical description are presented in the form of Solidity code fragments: a direct naive implementation, an implementation using modifiers, and an implementation based on a dedicated access manager contract. The code is described, its main idea is explained, and possible directions for further scaling of these code fragments are outlined. Based on the analysis of the proposed applications, the modifier-based implementation of MAC is identified as the most efficient in terms of computational resources, while the access manager approach is considered the most scalable. The latter approach is proposed for complex distributed systems involving multiple smart contracts. The results of the experimental study are presented to compare the performance indicators of the proposed access control implementations with known implementations. Prospects for further research aimed at improving access control in distributed information systems utilizing smart contracts are identified.
- Open Access
- 26 September 2025
- Published by Borys Grinchenko Kyiv University in Cybersecurity: Education, Science, Technique
- Vol. 1 (29) , 263-273
SOFTWARE SUPPLY CHAIN SECURITY ANALYSIS
This article addresses the pressing issue of securing application programming interfaces (APIs) in cloud environments within the broader context of software supply chain protection. Given the widespread adoption of microservice architectures and open REST/GraphQL APIs, the need to defend APIs against attacks has become critically important. The paper presents a formalization of the software supply chain model, which serves as the basis for analyzing potential attack vectors at each stage of the chain — from the compromise of repositories, dependencies, and CI/CD servers to artifact storage and deployment environments. Special attention is given to two key security mechanisms: the Web Application Firewall (WAF) and the API Gateway. A comparative analysis is provided covering their functionality, request handling approaches, security levels, logging methods, and integration into cloud infrastructures. The study identifies that WAFs detect and block HTTP-level attacks — such as SQL injections, XSS, and CSRF — based on signatures or behavioral rules, while API Gateways act as intermediaries managing request routing, authentication, authorization, access policies, and API call control. The research findings demonstrate that WAFs and API Gateways are not interchangeable but should be used as complementary components. The article proposes a combined cloud-based API protection model in which the WAF provides perimeter control and the API Gateway enforces logical access control. Additionally, it presents methods for evaluating the effectiveness of these mechanisms, including empirical testing in sandboxed environments, comparative benchmarking under various configurations, and threat modeling. Finally, the paper outlines several unresolved challenges and directions for further research in API and CI/CD security within cloud environments.
- 26 September 2025
- Published by Borys Grinchenko Kyiv University in Cybersecurity: Education, Science, Technique
- Vol. 1 (29) , 263-273
Open AccessSOFTWARE SUPPLY CHAIN SECURITY ANALYSIS
This article addresses the pressing issue of securing application programming interfaces (APIs) in cloud environments within the broader context of software supply chain protection. Given the widespread adoption of microservice architectures and open REST/GraphQL APIs, the need to defend APIs against attacks has become critically important. The paper presents a formalization of the software supply chain model, which serves as the basis for analyzing potential attack vectors at each stage of the chain — from the compromise of repositories, dependencies, and CI/CD servers to artifact storage and deployment environments. Special attention is given to two key security mechanisms: the Web Application Firewall (WAF) and the API Gateway. A comparative analysis is provided covering their functionality, request handling approaches, security levels, logging methods, and integration into cloud infrastructures. The study identifies that WAFs detect and block HTTP-level attacks — such as SQL injections, XSS, and CSRF — based on signatures or behavioral rules, while API Gateways act as intermediaries managing request routing, authentication, authorization, access policies, and API call control. The research findings demonstrate that WAFs and API Gateways are not interchangeable but should be used as complementary components. The article proposes a combined cloud-based API protection model in which the WAF provides perimeter control and the API Gateway enforces logical access control. Additionally, it presents methods for evaluating the effectiveness of these mechanisms, including empirical testing in sandboxed environments, comparative benchmarking under various configurations, and threat modeling. Finally, the paper outlines several unresolved challenges and directions for further research in API and CI/CD security within cloud environments.
- 6 December 2024
- Published by Elsevier in Computer Networks
- Vol. 257
Optimal obfuscation of awareness messages: Improving users’ unlinkability in Intelligent Transport Systems
- 6 December 2024
- Published by Elsevier in Computer Networks
- Vol. 257
Optimal obfuscation of awareness messages: Improving users’ unlinkability in Intelligent Transport Systems
- Open Access
Improving unlinkability in C-ITS: a methodology for optimal obfuscation
In this paper, we develop a new methodology to provide high assurance about privacy in Cooperative Intelligent Transport Systems (C-ITS). Our focus lies on vehicle-to-everything (V2X) communications enabled by Cooperative Awareness Basic Service. Our research motivation is developed based on the analysis of unlinkability provision methods indicating a gap. To address this, we propose a Hidden Markov Model (HMM) to express unlinkability for the situation where two cars are communicating with a Roadside Unit (RSU) using Cooperative Awareness Messages (CAMs). Our HMM has labeled states specifying distinct origins of the CAMs observable by a passive attacker. We then demonstrate that a high assurance about the degree of uncertainty (e.g., entropy) about labeled states can be obtained for the attacker under the assumption that he knows actual positions of the vehicles (e.g., hidden states in HMM). We further demonstrate how unlinkability can be increased in C-ITS: we propose a joint probability distribution that both drivers must use to obfuscate their actual data jointly. This obfuscated data is then encapsulated in their CAMs. Finally, our findings are incorporated into an obfuscation algorithm whose complexity is linear in the number of discrete time steps in HMM.
Open AccessImproving unlinkability in C-ITS: a methodology for optimal obfuscation
In this paper, we develop a new methodology to provide high assurance about privacy in Cooperative Intelligent Transport Systems (C-ITS). Our focus lies on vehicle-to-everything (V2X) communications enabled by Cooperative Awareness Basic Service. Our research motivation is developed based on the analysis of unlinkability provision methods indicating a gap. To address this, we propose a Hidden Markov Model (HMM) to express unlinkability for the situation where two cars are communicating with a Roadside Unit (RSU) using Cooperative Awareness Messages (CAMs). Our HMM has labeled states specifying distinct origins of the CAMs observable by a passive attacker. We then demonstrate that a high assurance about the degree of uncertainty (e.g., entropy) about labeled states can be obtained for the attacker under the assumption that he knows actual positions of the vehicles (e.g., hidden states in HMM). We further demonstrate how unlinkability can be increased in C-ITS: we propose a joint probability distribution that both drivers must use to obfuscate their actual data jointly. This obfuscated data is then encapsulated in their CAMs. Finally, our findings are incorporated into an obfuscation algorithm whose complexity is linear in the number of discrete time steps in HMM.
- Open Access
Blockchain Tree as Solution for Distributed Storage of Personal ID Data and Document Access Control
This paper introduces a new method of Blockchain formation for reliable storage of personal data of ID-card holders. In particular, the model of the information system is presented, the new structure of smart ID-cards and information on these cards are proposed. The new structure of Blockchain, “Blockchain Tree”, allows not only to store information from ID-cards but also to increase the level of security and access control to this information. The proposed Subchains system allows us to integrate Blockchain of the lower level to Blockchain of the higher level, allowing us to create a multilevel protected system.
Open AccessBlockchain Tree as Solution for Distributed Storage of Personal ID Data and Document Access Control
This paper introduces a new method of Blockchain formation for reliable storage of personal data of ID-card holders. In particular, the model of the information system is presented, the new structure of smart ID-cards and information on these cards are proposed. The new structure of Blockchain, “Blockchain Tree”, allows not only to store information from ID-cards but also to increase the level of security and access control to this information. The proposed Subchains system allows us to integrate Blockchain of the lower level to Blockchain of the higher level, allowing us to create a multilevel protected system.
- 1 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 145-148
Investigation of simple Denial-of-Service attacks
Methods and ways to perform denial-of-service attack are analyzed and classified in this work. Famous Denial-of-Service attack classifications are reviewed and analyzed. New elements of modern DoS attack classification are proposed.
- 1 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 145-148
Investigation of simple Denial-of-Service attacks
Methods and ways to perform denial-of-service attack are analyzed and classified in this work. Famous Denial-of-Service attack classifications are reviewed and analyzed. New elements of modern DoS attack classification are proposed.
- 1 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 114-116
Data-driven pseudonondeterministic hashing constructions
The conception of the pseudonondeterministic cryptography is considered. Multiplied data-driven pseudonondeterministic hash constructions, which provide infeasibility increasing against generic attacks based on the multicollision designing, were proposed. The estimations of the infeasibility increasing were presented. The instances of the data-driven pseudonondeterministic hashing methods, which could be designed using the proposed approach, were presented.
- 1 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 114-116
Data-driven pseudonondeterministic hashing constructions
The conception of the pseudonondeterministic cryptography is considered. Multiplied data-driven pseudonondeterministic hash constructions, which provide infeasibility increasing against generic attacks based on the multicollision designing, were proposed. The estimations of the infeasibility increasing were presented. The instances of the data-driven pseudonondeterministic hashing methods, which could be designed using the proposed approach, were presented.
- 1 September 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 661-664
Methods of generic attacks infeasibility increasing for hash functions
This work is devoted to the multicollision attacks analysis. Known methods of the multicollision attacks counteraction are considered and main trends of these methods development are determined. Methods of data blocks bonding and hash constructions for their implementation are proposed. Theoretical infeasibility analysis of constructions based on these methods is performed and it is shown, that for proposed constructions collision attack for the certain data block is added up to the preimage attack.
- 1 September 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 661-664
Methods of generic attacks infeasibility increasing for hash functions
This work is devoted to the multicollision attacks analysis. Known methods of the multicollision attacks counteraction are considered and main trends of these methods development are determined. Methods of data blocks bonding and hash constructions for their implementation are proposed. Theoretical infeasibility analysis of constructions based on these methods is performed and it is shown, that for proposed constructions collision attack for the certain data block is added up to the preimage attack.