Pier Luca Montessoro
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Pier Luca Montessoro has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- David Palma
Polytechnic Department of Engineering and Architecture, University of Udine, 33100 Udine, Italy
4 shared publications - Franco Blanchini
Dipartimento di Scienze matematiche, informatiche e fisiche, Universita degli Studi di Udine, Udine, Italy
4 shared publications - Daniele Casagrande
Polytechnic Department of Engineering and Architecture, University of Udine, Udine, Italy
3 shared publications - Giulia Giordano
Department of Industrial Engineering, University of Trento, Trento, Italy
2 shared publications - Andrea Fusiello
Polytechnic Department of Engineering and Architecture (DPIA), University of Udine, Udine, Italy
1 shared publication - Babak Jafarpisheh
Department of Electrical Engineering, Faculty of Engineering, University of Isfahan, Isfahan, Iran
1 shared publication
Latest Publications
- Open Access
- 19 November 2025
- Published by MDPI AG in Cryptography
- Vol. 9 (4) , 72
A Post-Quantum Cryptography Enabled Feature-Level Fusion Framework for Privacy-Preserving Multimodal Biometric Recognition
As quantum computing continues to advance, it threatens the long-term protection of traditional cryptographic methods, especially in biometric authentication systems where it is important to protect sensitive data. To overcome this challenge, we present a comprehensive, privacy-preserving framework for multimodal biometric authentication that can easily integrate any two binary-encoded modalities through feature-level fusion, ensuring that all sensitive information remains encrypted under a CKKS-based homomorphic encryption scheme resistant to both classical and quantum-enabled attacks. To demonstrate its versatility and effectiveness, we apply this framework to the retinal vascular patterns and palm vein features, which are inherently spoof-resistant and particularly well suited to high-security applications. This method not only ensures the secrecy of the combined biometric sample, but also enables the complete assessment of recognition performance and resilience against adversarial attacks. The results show that our approach provides protection against threats such as data leakage and replay attacks while maintaining high recognition performance and operational efficiency. These findings demonstrate the feasibility of integrating multimodal biometrics with post-quantum cryptography, giving a strong, privacy-oriented authentication solution suitable for mission-critical applications in the post-quantum era.
- 19 November 2025
- Published by MDPI AG in Cryptography
- Vol. 9 (4) , 72
Open AccessA Post-Quantum Cryptography Enabled Feature-Level Fusion Framework for Privacy-Preserving Multimodal Biometric Recognition
As quantum computing continues to advance, it threatens the long-term protection of traditional cryptographic methods, especially in biometric authentication systems where it is important to protect sensitive data. To overcome this challenge, we present a comprehensive, privacy-preserving framework for multimodal biometric authentication that can easily integrate any two binary-encoded modalities through feature-level fusion, ensuring that all sensitive information remains encrypted under a CKKS-based homomorphic encryption scheme resistant to both classical and quantum-enabled attacks. To demonstrate its versatility and effectiveness, we apply this framework to the retinal vascular patterns and palm vein features, which are inherently spoof-resistant and particularly well suited to high-security applications. This method not only ensures the secrecy of the combined biometric sample, but also enables the complete assessment of recognition performance and resilience against adversarial attacks. The results show that our approach provides protection against threats such as data leakage and replay attacks while maintaining high recognition performance and operational efficiency. These findings demonstrate the feasibility of integrating multimodal biometrics with post-quantum cryptography, giving a strong, privacy-oriented authentication solution suitable for mission-critical applications in the post-quantum era.
- Open Access
- 27 March 2025
- Published by Wiley in Advanced Intelligent Systems
- Vol. 7 (5)
A Privacy‐Preserving System for Confidential Carpooling Services Using Homomorphic Encryption
Carpooling enables multiple users with similar travel habits to share rides, reducing vehicles on the road, leading to benefits such as lower fuel consumption, reduced traffic congestion, and lower environmental impact. However, carpooling also poses a challenge to the privacy of the users, as they may not want to reveal their location or route information to others. This research study delves into a cutting‐edge approach to address these privacy concerns by leveraging homomorphic encryption (HE) within the realm of carpooling services. The proposed solution makes use of a HE scheme that supports encrypted computation on real numbers, which is suitable for carpooling applications that involve distance and time calculations. The approach enables decision makers to perform efficient and accurate route matching over encrypted data, without disclosing their sensitive information about users, thus preserving the confidentiality of the data. The proposed system is evaluated through extensive experiments and simulations, demonstrating its effectiveness in terms of both security and privacy when the system operates in normal (ideal) and abnormal (under attack) conditions. Experimental results indicate that the proposed solution offers robust resistance to various attacks, including replay attacks and data exposure, providing a robust and privacy‐centric solution for carpooling services.
- 27 March 2025
- Published by Wiley in Advanced Intelligent Systems
- Vol. 7 (5)
Open AccessA Privacy‐Preserving System for Confidential Carpooling Services Using Homomorphic Encryption
Carpooling enables multiple users with similar travel habits to share rides, reducing vehicles on the road, leading to benefits such as lower fuel consumption, reduced traffic congestion, and lower environmental impact. However, carpooling also poses a challenge to the privacy of the users, as they may not want to reveal their location or route information to others. This research study delves into a cutting‐edge approach to address these privacy concerns by leveraging homomorphic encryption (HE) within the realm of carpooling services. The proposed solution makes use of a HE scheme that supports encrypted computation on real numbers, which is suitable for carpooling applications that involve distance and time calculations. The approach enables decision makers to perform efficient and accurate route matching over encrypted data, without disclosing their sensitive information about users, thus preserving the confidentiality of the data. The proposed system is evaluated through extensive experiments and simulations, demonstrating its effectiveness in terms of both security and privacy when the system operates in normal (ideal) and abnormal (under attack) conditions. Experimental results indicate that the proposed solution offers robust resistance to various attacks, including replay attacks and data exposure, providing a robust and privacy‐centric solution for carpooling services.
- Open Access
- 5 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 183688-183706
For Your Eyes Only: A Privacy-Preserving Authentication Framework Based on Homomorphic Encryption and Retina Biometrics
Securing personal information and data has become an imperative challenge, especially after the introduction of legal frameworks, such as, in Europe, the General Data Protection Regulation (GDPR). Conventional authentication methods, such as PINs and passwords, have demonstrated their vulnerabilities to various cyber threats, making it necessary the study of robust and reliable biometric authentication systems that can accurately verify an user’s identity. The human retina has demonstrated remarkable reliability as a biometric trait mainly because of its unique and stable patterns, even though the adoption of these systems gives rise to significant concerns regarding the confidentiality of biometric data. This study presents a groundbreaking approach to address these concerns by integrating homomorphic encryption into retina-based authentication. The combination of homomorphic encryption and retina biometrics within the proposed framework offers a comprehensive solution that ensures both privacy and security with no loss in accuracy. The proposed approach mitigates the risks associated with possible unauthorised access and security breaches by keeping the data encrypted throughout the entire procedure. Furthermore, it preserves the individual’s privacy by preventing the exposure of sensitive biometric information. We evaluated the proposed system through extensive experiments and simulations, demonstrating its effectiveness in terms of both security and privacy when the system operates in normal (ideal) and abnormal (under attack) conditions. Experimental results indicate that the combined approach offers robust resistance to various attacks, including replay attacks and data exposure, providing a robust and privacy-centric authentication solution.
- 5 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 183688-183706
Open AccessFor Your Eyes Only: A Privacy-Preserving Authentication Framework Based on Homomorphic Encryption and Retina Biometrics
Securing personal information and data has become an imperative challenge, especially after the introduction of legal frameworks, such as, in Europe, the General Data Protection Regulation (GDPR). Conventional authentication methods, such as PINs and passwords, have demonstrated their vulnerabilities to various cyber threats, making it necessary the study of robust and reliable biometric authentication systems that can accurately verify an user’s identity. The human retina has demonstrated remarkable reliability as a biometric trait mainly because of its unique and stable patterns, even though the adoption of these systems gives rise to significant concerns regarding the confidentiality of biometric data. This study presents a groundbreaking approach to address these concerns by integrating homomorphic encryption into retina-based authentication. The combination of homomorphic encryption and retina biometrics within the proposed framework offers a comprehensive solution that ensures both privacy and security with no loss in accuracy. The proposed approach mitigates the risks associated with possible unauthorised access and security breaches by keeping the data encrypted throughout the entire procedure. Furthermore, it preserves the individual’s privacy by preventing the exposure of sensitive biometric information. We evaluated the proposed system through extensive experiments and simulations, demonstrating its effectiveness in terms of both security and privacy when the system operates in normal (ideal) and abnormal (under attack) conditions. Experimental results indicate that the combined approach offers robust resistance to various attacks, including replay attacks and data exposure, providing a robust and privacy-centric authentication solution.
- Open Access
- 25 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 1700-1705
Distributed Interval Synchronization
In this paper we address the problem of using pairwise measures associated with the edges of a graph to obtain absolute consistent measures associated with the nodes. This problem is known in the literature as graph synchronisation. In particular, we rigorously deal with the uncertainty affecting the measures thanks to the interval analysis approach. We propose an asynchronous, distributed algorithm that converges to an interval solution that represents all possible sharp solutions consistent with the measures.
- 25 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 1700-1705
Open AccessDistributed Interval Synchronization
In this paper we address the problem of using pairwise measures associated with the edges of a graph to obtain absolute consistent measures associated with the nodes. This problem is known in the literature as graph synchronisation. In particular, we rigorously deal with the uncertainty affecting the measures thanks to the interval analysis approach. We propose an asynchronous, distributed algorithm that converges to an interval solution that represents all possible sharp solutions consistent with the measures.
- 5 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 9 (4) , 1679-1691
Optimal Control Approach to Scheduling Power Supply Facilities: Theory and Heuristics
We consider a scheduling problem for a power charging facility under hard bounds on the deliverable power. Appliances require an amount of energy for a certain time interval at specific times. Under congestion, power supply to the appliances may be possibly delayed and the goal of the scheduler is to minimize the average waiting time. We formulate the problem as an optimal control problem. We study three versions of the problem: the case when no interruption of an appliance is possible after admission, the case in which it is possible, and the case in which the overall energy can be delivered at an arbitrary rate over time. We show that these three versions of the problem can be faced in the proposed framework by suitably choosing the cost function. We then propose some relaxations to derive lower bounds for the cost. These lower bounds will be used to test some heuristics with real data available from the literature.
- 5 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 9 (4) , 1679-1691
Optimal Control Approach to Scheduling Power Supply Facilities: Theory and Heuristics
We consider a scheduling problem for a power charging facility under hard bounds on the deliverable power. Appliances require an amount of energy for a certain time interval at specific times. Under congestion, power supply to the appliances may be possibly delayed and the goal of the scheduler is to minimize the average waiting time. We formulate the problem as an optimal control problem. We study three versions of the problem: the case when no interruption of an appliance is possible after admission, the case in which it is possible, and the case in which the overall energy can be delivered at an arbitrary rate over time. We show that these three versions of the problem can be faced in the proposed framework by suitably choosing the cost function. We then propose some relaxations to derive lower bounds for the cost. These lower bounds will be used to test some heuristics with real data available from the literature.
- 28 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 49 (12) , 2676-2687
Biometric Palmprint Verification: A Dynamical System Approach
Most of the existing techniques for palmprint recognition rely on metrics, typically based on static functions, which evaluate the distance between a pair of features. In this paper, we propose a new technique for palmprint verification based on a dynamical system approach for principal palm lines matching. The proposed dynamic algorithm is recursive and involves a positive linear dynamical system, whose evolution depends on the matching level between the two input images. In a preprocessing phase, the procedure iteratively erodes both of the images to be compared, by eliminating points in each image that do not have enough close neighboring points both in the image itself and the comparison image. As a result of the iterations, only the points that have enough neighboring points in both the image itself and in the comparison image can survive. Thus, the output of the dynamical system converges either to zero, when a deep mismatch exists between the two images, or to a high value, when a good matching is observed. The results, in terms of verification, are in line with the state-of-the-art results in the current literature. The main advantage of the approach is its robustness when dealing with low-resolution and noisy images. The impact of noise (e.g., salt and pepper noise) is effectively reduced: images corrupted with such noise are easily recognized, while a randomly generated image is rejected even when compared with itself.
- 28 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 49 (12) , 2676-2687
Biometric Palmprint Verification: A Dynamical System Approach
Most of the existing techniques for palmprint recognition rely on metrics, typically based on static functions, which evaluate the distance between a pair of features. In this paper, we propose a new technique for palmprint verification based on a dynamical system approach for principal palm lines matching. The proposed dynamic algorithm is recursive and involves a positive linear dynamical system, whose evolution depends on the matching level between the two input images. In a preprocessing phase, the procedure iteratively erodes both of the images to be compared, by eliminating points in each image that do not have enough close neighboring points both in the image itself and the comparison image. As a result of the iterations, only the points that have enough neighboring points in both the image itself and in the comparison image can survive. Thus, the output of the dynamical system converges either to zero, when a deep mismatch exists between the two images, or to a high value, when a good matching is observed. The results, in terms of verification, are in line with the state-of-the-art results in the current literature. The main advantage of the approach is its robustness when dealing with low-resolution and noisy images. The impact of noise (e.g., salt and pepper noise) is effectively reduced: images corrupted with such noise are easily recognized, while a randomly generated image is rejected even when compared with itself.
- 1 February 2016
- Published by Elsevier in Automatica
- Vol. 64, 18-28
Compartmental flow control: Decentralization, robustness and optimality
- 1 February 2016
- Published by Elsevier in Automatica
- Vol. 64, 18-28
Compartmental flow control: Decentralization, robustness and optimality
- 1 April 2013
- Published by Elsevier in Computer Networks
- Vol. 57 (5) , 1277-1288
Fair and optimal dynamic admission control of elastic flows
- 1 April 2013
- Published by Elsevier in Computer Networks
- Vol. 57 (5) , 1277-1288
Fair and optimal dynamic admission control of elastic flows
- 23 March 2012
- Published by Springer Nature in Journal of Network and Systems Management
- Vol. 21 (2) , 194-217
Efficient Management and Packets Forwarding for Multimedia Flows
- 23 March 2012
- Published by Springer Nature in Journal of Network and Systems Management
- Vol. 21 (2) , 194-217
Efficient Management and Packets Forwarding for Multimedia Flows
- 25 May 2010
- Published by Springer Nature in Journal of Network and Systems Management
- Vol. 18 (4) , 418-446
REBOOK: A Deterministic, Robust and Scalable Resource Booking Algorithm
- 25 May 2010
- Published by Springer Nature in Journal of Network and Systems Management
- Vol. 18 (4) , 418-446
REBOOK: A Deterministic, Robust and Scalable Resource Booking Algorithm