Vashek Matyas
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Vashek Matyas has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Petr Švenda
Masaryk University
3 shared publications - Vlasta Stavova
Masaryk University
3 shared publications - Lukas Nemec
Centre for Research on Cryptography and Security, Faculty of Informatics, Masaryk University, Brno 60200, Czech Republic
2 shared publications - Martin Ukrop
Masaryk University
2 shared publications - Mike Just
Department of Computer Science, Heriot-Watt University, Edinburgh, U.K.
2 shared publications - Radim Ostadal
Centre for Research on Cryptography and Security, Faculty of Informatics, Masaryk University, Brno 60200, Czech Republic
2 shared publications
Latest Publications
- 23 July 2026
- Published by Taylor & Francis in IETE Journal of Research
- Vol. 72 (10) , 2600-2621
ProPETUS: Robust Prediction-Driven Spectrum Allocation for CRN-IoT Under SSDF and PUEA
1. The rapid proliferation of wireless connected devices (including IoT class nodes) is intensifying the demand for radio resources and has contributed to an increasingly perceived spectrum scarcit...
- 23 July 2026
- Published by Taylor & Francis in IETE Journal of Research
- Vol. 72 (10) , 2600-2621
ProPETUS: Robust Prediction-Driven Spectrum Allocation for CRN-IoT Under SSDF and PUEA
1. The rapid proliferation of wireless connected devices (including IoT class nodes) is intensifying the demand for radio resources and has contributed to an increasingly perceived spectrum scarcit...
- 2 April 2024
- Published by Springer Nature
- p. 209-233
MRMM-Based Keystream Generators for Information Security
- 2 April 2024
- Published by Springer Nature
- p. 209-233
MRMM-Based Keystream Generators for Information Security
- 19 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (11) , 2919-2923
ProMETHEUS: A Secure Lightweight Spectrum Allocation Protocol against SSDF Attacks in Cognitive Radio IoT Networks
The reliability and accuracy of collaborative spectrum sensing in Cognitive Radio Networks (CRNs) is highly dependent on integrity of shared spectrum sensing data. This poses challenges if the protocols need to be realized on Internet of Things-based CRNs (IoT-CRNs) without additional resources. In this paper, we introduce ProMETHEUS, a secure and lightweight spectrum allocation protocol designed specifically for IoT-CRNs. ProMETHEUS utilizes a blockchain framework to ensure the integrity of shared spectrum sensing data and employs a simple pattern-based channel state prediction technique for efficient spectrum allocation. We implemented ProMETHEUS in an IoT-CRN using Raspberry Pi 3 devices connected with software-defined radios. Our evaluation demonstrates that ProMETHEUS outperforms recently proposed CRN protocols, such as ProBLeSS [1] and PROLEMus [2].
- 19 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (11) , 2919-2923
ProMETHEUS: A Secure Lightweight Spectrum Allocation Protocol against SSDF Attacks in Cognitive Radio IoT Networks
The reliability and accuracy of collaborative spectrum sensing in Cognitive Radio Networks (CRNs) is highly dependent on integrity of shared spectrum sensing data. This poses challenges if the protocols need to be realized on Internet of Things-based CRNs (IoT-CRNs) without additional resources. In this paper, we introduce ProMETHEUS, a secure and lightweight spectrum allocation protocol designed specifically for IoT-CRNs. ProMETHEUS utilizes a blockchain framework to ensure the integrity of shared spectrum sensing data and employs a simple pattern-based channel state prediction technique for efficient spectrum allocation. We implemented ProMETHEUS in an IoT-CRN using Raspberry Pi 3 devices connected with software-defined radios. Our evaluation demonstrates that ProMETHEUS outperforms recently proposed CRN protocols, such as ProBLeSS [1] and PROLEMus [2].
- 3 June 2022
- Published by Springer Nature
- p. 289-305
Usability Insights from Establishing TLS Connections
- 3 June 2022
- Published by Springer Nature
- p. 289-305
Usability Insights from Establishing TLS Connections
- 14 September 2020
- Published by Springer Nature
- Vol. 580, 338-351
Privacy-Friendly Monero Transaction Signing on a Hardware Wallet
Keeping cryptocurrency spending keys safe and being able to use them when signing a transaction is a well-known problem, addressed by hardware wallets. Our work focuses on a transaction signing process for privacy-centric cryptocurrency Monero, in the hardware wallets. We designed, implemented, and analyzed a privacy-preserving transaction signing protocol that runs on a hardware wallet and protects the spending keys. Moreover, we also implemented a privacy-preserving multi-party version of the Bulletproof zero-knowledge prover algorithm, which runs on a hardware wallet with constant memory. We present the protocols and evaluate their performance on a real hardware wallet.
- 14 September 2020
- Published by Springer Nature
- Vol. 580, 338-351
Privacy-Friendly Monero Transaction Signing on a Hardware Wallet
Keeping cryptocurrency spending keys safe and being able to use them when signing a transaction is a well-known problem, addressed by hardware wallets. Our work focuses on a transaction signing process for privacy-centric cryptocurrency Monero, in the hardware wallets. We designed, implemented, and analyzed a privacy-preserving transaction signing protocol that runs on a hardware wallet and protects the spending keys. Moreover, we also implemented a privacy-preserving multi-party version of the Bulletproof zero-knowledge prover algorithm, which runs on a hardware wallet with constant memory. We present the protocols and evaluate their performance on a real hardware wallet.
- Open Access
Crowdsourced Security Reconstitution for Wireless Sensor Networks: Secrecy Amplification
Research in the area of security for Wireless Sensor Networks over the past two decades has yielded many interesting findings. We focus on the topic of (re-)securing link keys between sensor nodes through so-called secrecy amplification (SA) protocols. Crowdsourcing is at the very heart of these SA protocols. Not only do SA protocols work wonders even for low-level constrained nodes with no tamper resistance, they exhibit astonishing performance in networks under significant attacker control. Our work shows that even when 50% of all network links are compromised, SA protocols can re-secure over 90% of the link keys through an intriguingly simple crowdsourcing mechanism. These protocols allow us to re-take control without any broadly coordinated cooperation, without knowledge of the compromised links, with only very limited knowledge of each particular network node and independently of decisions made by other nodes. Our article first outlines the principles of and presents existing approaches to SA, introducing most of the important related concepts, then presents novel conclusive results for a realistic attacker model parametrised by attacker behaviour and capabilities. We undertook this work using two very different simulators, and we present here the results of analyses and detailed comparisons that have not previously been available. Finally, we report the first real, non-simulated network test results for the most attractive SA protocol, our implementations of which are available as open-source code for two platforms: Arduino and TinyOS. This work demonstrates the practical usability (and the attractive performance) of SA, serving as a ripe technology enabler for (among others) networks with many potentially compromised low-level devices.
Open AccessCrowdsourced Security Reconstitution for Wireless Sensor Networks: Secrecy Amplification
Research in the area of security for Wireless Sensor Networks over the past two decades has yielded many interesting findings. We focus on the topic of (re-)securing link keys between sensor nodes through so-called secrecy amplification (SA) protocols. Crowdsourcing is at the very heart of these SA protocols. Not only do SA protocols work wonders even for low-level constrained nodes with no tamper resistance, they exhibit astonishing performance in networks under significant attacker control. Our work shows that even when 50% of all network links are compromised, SA protocols can re-secure over 90% of the link keys through an intriguingly simple crowdsourcing mechanism. These protocols allow us to re-take control without any broadly coordinated cooperation, without knowledge of the compromised links, with only very limited knowledge of each particular network node and independently of decisions made by other nodes. Our article first outlines the principles of and presents existing approaches to SA, introducing most of the important related concepts, then presents novel conclusive results for a realistic attacker model parametrised by attacker behaviour and capabilities. We undertook this work using two very different simulators, and we present here the results of analyses and detailed comparisons that have not previously been available. Finally, we report the first real, non-simulated network test results for the most attractive SA protocol, our implementations of which are available as open-source code for two platforms: Arduino and TinyOS. This work demonstrates the practical usability (and the attractive performance) of SA, serving as a ripe technology enabler for (among others) networks with many potentially compromised low-level devices.
- 1 August 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 267, 64-72
When Lagged Fibonacci Generators jump
- 1 August 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 267, 64-72
When Lagged Fibonacci Generators jump
- 1 June 2019
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 46, 296-306
Examining PBKDF2 security margin—Case study of LUKS
- 1 June 2019
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 46, 296-306
Examining PBKDF2 security margin—Case study of LUKS
- Open Access
Evaluating Dynamic Approaches to Key (Re-)Establishment in Wireless Sensor Networks
Wireless sensor networks with a large number of cheap low-power interconnected devices bring up challenging tasks when considering the security of their communications. In our previous work, we presented two approaches for the design of dynamic protocols for link key (re-)establishment in ad hoc networks, using two elements studied earlier—secrecy amplification and key extraction from radio channel fading. The goal of this article is to provide a unified approach to the design of these protocols, together with their experimental verification, in a real network with various settings. The overall results of our experiments show that our dynamic combination of secrecy amplification and key extraction from radio channel fading saves a significant portion of messages with corresponding energy expenditure and can adapt to a much wider scale of environments when compared to previous solutions based on the exploitation of the individual elements of secrecy amplification and key extraction from radio channel fading.
Open AccessEvaluating Dynamic Approaches to Key (Re-)Establishment in Wireless Sensor Networks
Wireless sensor networks with a large number of cheap low-power interconnected devices bring up challenging tasks when considering the security of their communications. In our previous work, we presented two approaches for the design of dynamic protocols for link key (re-)establishment in ad hoc networks, using two elements studied earlier—secrecy amplification and key extraction from radio channel fading. The goal of this article is to provide a unified approach to the design of these protocols, together with their experimental verification, in a real network with various settings. The overall results of our experiments show that our dynamic combination of secrecy amplification and key extraction from radio channel fading saves a significant portion of messages with corresponding energy expenditure and can adapt to a much wider scale of environments when compared to previous solutions based on the exploitation of the individual elements of secrecy amplification and key extraction from radio channel fading.
- 1 July 2018
- Published by Elsevier in Computers & Security
- Vol. 76, 92-100
Experimental large-scale review of attractors for detection of potentially unwanted applications
- 1 July 2018
- Published by Elsevier in Computers & Security
- Vol. 76, 92-100
Experimental large-scale review of attractors for detection of potentially unwanted applications