Victor Mateu
Research Subjects
Victor Mateu has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Ahmed Alzubaidi
Al Nokhba Program Smart OR Lab, Advanced Power and Energy Center, Department of Electrical Engineering Khalifa Universityc Abu Dhabi UAE
2 shared publications - Alexandre Augusto Giron
UTFPR
2 shared publications - Chan Yeob Yeun
Department of Computer Science, Center for Cyber-Physical Systems, Khalifa University, Abu Dhabi, United Arab Emirates
2 shared publications - Ernesto Damiani
Università degli Studi di Milano
2 shared publications - Khouloud Eledlebi
Department of Computer Science, Center for Secure Cyber-Physical Systems, Khalifa University, Abu Dhabi, United Arab Emirates
2 shared publications - Lucas Pandolfo Perin
Technology Innovation Institute (TII)
2 shared publications
Latest Publications
- Open Access
- 31 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (23) , 37421-37436
Bio-Integrated Hybrid TESLA: A Fully Symmetric Lightweight Authentication Protocol
The rapid integration of IoT devices into everyday decision-making processes underscores the need for continuous user authentication and data integrity checking during network communication, all while minimizing energy consumption to extend device lifespan. This paper introduces the Bio-Integrated Hybrid TESLA protocol, which is a fully symmetric and energy-efficient authentication protocol designed for resource-constrained IoT devices. Based on the Hybrid TLI-lTESLA protocol, this innovative solution prioritizes high cybersecurity levels and minimal computational requirements for continuous authentication. An innovative advancement involves eliminating the public cryptography process during the synchronization stage of TESLA protocols. Instead, biometric authentication through distorted fingerprint and EEG templates is employed, to establish a non-shared symmetric session key, utilized only once. Furthermore, neither the key nor the original biometric templates are transmitted over the network, ensuring user identity preservation and effectively resolving the key distribution challenge inherent in symmetric cryptography. By offloading intensive tasks to servers and avoiding the storage or transmission of biometric data, the proposed approach conserves IoT device energy and enhances cybersecurity. Simulation analyses and cybersecurity assessments demonstrate successful synchronization, privacy preservation, and low computational demands compared to existing protocols, making the Bio-Integrated Hybrid TESLA protocol a significant advancement in IoT authentication.
- 31 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (23) , 37421-37436
Open AccessBio-Integrated Hybrid TESLA: A Fully Symmetric Lightweight Authentication Protocol
The rapid integration of IoT devices into everyday decision-making processes underscores the need for continuous user authentication and data integrity checking during network communication, all while minimizing energy consumption to extend device lifespan. This paper introduces the Bio-Integrated Hybrid TESLA protocol, which is a fully symmetric and energy-efficient authentication protocol designed for resource-constrained IoT devices. Based on the Hybrid TLI-lTESLA protocol, this innovative solution prioritizes high cybersecurity levels and minimal computational requirements for continuous authentication. An innovative advancement involves eliminating the public cryptography process during the synchronization stage of TESLA protocols. Instead, biometric authentication through distorted fingerprint and EEG templates is employed, to establish a non-shared symmetric session key, utilized only once. Furthermore, neither the key nor the original biometric templates are transmitted over the network, ensuring user identity preservation and effectively resolving the key distribution challenge inherent in symmetric cryptography. By offloading intensive tasks to servers and avoiding the storage or transmission of biometric data, the proposed approach conserves IoT device energy and enhances cybersecurity. Simulation analyses and cybersecurity assessments demonstrate successful synchronization, privacy preservation, and low computational demands compared to existing protocols, making the Bio-Integrated Hybrid TESLA protocol a significant advancement in IoT authentication.
- 29 February 2024
- Published by Springer Nature
- p. 3-23
Automated Issuance of Post-Quantum Certificates: A New Challenge
- 29 February 2024
- Published by Springer Nature
- p. 3-23
Automated Issuance of Post-Quantum Certificates: A New Challenge
- 26 September 2023
- Published by Springer Nature
- p. 293-312
Post-quantum Hybrid KEMTLS Performance in Simulated and Real Network Environments
- 26 September 2023
- Published by Springer Nature
- p. 293-312
Post-quantum Hybrid KEMTLS Performance in Simulated and Real Network Environments
- Open Access
Simulation Analysis and Comparison of New Hybrid TLI-µTESLA and Variant TESLA Protocols Using SHA-2 and SHA-3 Hash Functions
The evolution of 5G and 6G networks has enhanced the ability of massive IoT devices to provide real-time monitoring and interaction with the surrounding environment. Despite recent advances, the necessary security services, such as immediate and continuous authentication, high scalability, and cybersecurity handling of IoT cannot be achieved in a single broadcast authentication protocol. This paper presents a new hybrid protocol called Hybrid Two-level µ-timed-efficient stream loss-tolerant authentication (Hybrid TLI-µTESLA) protocol, which maximizes the benefits of the previous TESLA protocol variants, including scalability support and immediate authentication of Multilevel-µTESLA protocol and continuous authentication with minimal computation overhead of enhanced Inf-TESLA protocol. The inclusion of three different keychains and checking criteria of the packets in the Hybrid TLI-µTESLA protocol enabled resistance against Masquerading, Modification, Man-in-the-Middle, Brute-force, and DoS attacks. A solution for the authentication problem in the first and last packets of the high-level and low-level keychains of the Multilevel-µTESLA protocol was also proposed. The simulation analysis was performed using Java, where we compared the Hybrid TLI-µTESLA protocol with other variants for time complexity and computation overhead at the sender and receiver sides. We also conducted a comparative analysis between two hash functions, SHA-2 and SHA-3, and assessed the feasibility of the proposed protocol in the forthcoming 6G technology. The results demonstrated the superiority of the proposed protocol over other variants in terms of immediate and continuous authentication, scalability, cybersecurity, lifetime, network performance, and compatibility with 5G and 6G IoT generations.
Open AccessSimulation Analysis and Comparison of New Hybrid TLI-µTESLA and Variant TESLA Protocols Using SHA-2 and SHA-3 Hash Functions
The evolution of 5G and 6G networks has enhanced the ability of massive IoT devices to provide real-time monitoring and interaction with the surrounding environment. Despite recent advances, the necessary security services, such as immediate and continuous authentication, high scalability, and cybersecurity handling of IoT cannot be achieved in a single broadcast authentication protocol. This paper presents a new hybrid protocol called Hybrid Two-level µ-timed-efficient stream loss-tolerant authentication (Hybrid TLI-µTESLA) protocol, which maximizes the benefits of the previous TESLA protocol variants, including scalability support and immediate authentication of Multilevel-µTESLA protocol and continuous authentication with minimal computation overhead of enhanced Inf-TESLA protocol. The inclusion of three different keychains and checking criteria of the packets in the Hybrid TLI-µTESLA protocol enabled resistance against Masquerading, Modification, Man-in-the-Middle, Brute-force, and DoS attacks. A solution for the authentication problem in the first and last packets of the high-level and low-level keychains of the Multilevel-µTESLA protocol was also proposed. The simulation analysis was performed using Java, where we compared the Hybrid TLI-µTESLA protocol with other variants for time complexity and computation overhead at the sender and receiver sides. We also conducted a comparative analysis between two hash functions, SHA-2 and SHA-3, and assessed the feasibility of the proposed protocol in the forthcoming 6G technology. The results demonstrated the superiority of the proposed protocol over other variants in terms of immediate and continuous authentication, scalability, cybersecurity, lifetime, network performance, and compatibility with 5G and 6G IoT generations.
- Open Access
Faulty isogenies: a new kind of leakage
In SIDH and SIKE protocols, public keys are defined over quadratic extensions of prime fields. We present in this work a projective invariant property characterizing affine Montgomery curves defined over prime fields. We then force a secret 3-isogeny chain to repeatedly pass through a curve defined over a prime field in order to exploit the new property and inject zeros in the A-coefficient of an intermediate curve to successfully recover the isogeny chain one step at a time. Our results introduce a new kind of fault attacks applicable to SIDH and SIKE.
Open AccessFaulty isogenies: a new kind of leakage
In SIDH and SIKE protocols, public keys are defined over quadratic extensions of prime fields. We present in this work a projective invariant property characterizing affine Montgomery curves defined over prime fields. We then force a secret 3-isogeny chain to repeatedly pass through a curve defined over a prime field in order to exploit the new property and inject zeros in the A-coefficient of an intermediate curve to successfully recover the isogeny chain one step at a time. Our results introduce a new kind of fault attacks applicable to SIDH and SIKE.
- Open Access
- 10 May 2021
- Published by Springer Nature in Quantum Information Processing
- Vol. 20 (5) , 1-28
Quantum search for scaled hash function preimages
We present the implementation of Grover’s algorithm in a quantum simulator to perform a quantum search for preimages of two scaled hash functions, whose design only uses modular addition, word rotation and bitwise exclusive or. Our implementation provides the means to assess with precision the scaling of the number of gates and depth of a full-fledged quantum circuit designed to find the preimages of a given hash digest. The detailed construction of the quantum oracle shows that the presence of AND gates, OR gates, shifts of bits and the reuse of the initial state along the computation require extra quantum resources as compared with other hash functions based on modular additions, XOR gates and rotations. We also track the entanglement entropy present in the quantum register at every step along the computation, showing that it becomes maximal at the inner core of the first action of the quantum oracle, which implies that no classical simulation based on tensor networks would be of relevance. Finally, we show that strategies that suggest a shortcut based on sampling the quantum register after a few steps of Grover’s algorithm can only provide some marginal practical advantage in terms of error mitigation.
- 10 May 2021
- Published by Springer Nature in Quantum Information Processing
- Vol. 20 (5) , 1-28
Open AccessQuantum search for scaled hash function preimages
We present the implementation of Grover’s algorithm in a quantum simulator to perform a quantum search for preimages of two scaled hash functions, whose design only uses modular addition, word rotation and bitwise exclusive or. Our implementation provides the means to assess with precision the scaling of the number of gates and depth of a full-fledged quantum circuit designed to find the preimages of a given hash digest. The detailed construction of the quantum oracle shows that the presence of AND gates, OR gates, shifts of bits and the reuse of the initial state along the computation require extra quantum resources as compared with other hash functions based on modular additions, XOR gates and rotations. We also track the entanglement entropy present in the quantum register at every step along the computation, showing that it becomes maximal at the inner core of the first action of the quantum oracle, which implies that no classical simulation based on tensor networks would be of relevance. Finally, we show that strategies that suggest a shortcut based on sampling the quantum register after a few steps of Grover’s algorithm can only provide some marginal practical advantage in terms of error mitigation.