Ali Shoker
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ali Shoker has a total of 52 co-authors. Here are the top co-authors by number of shared publications:
- Carlos Baquero
Universidade do Porto & INESC TEC, Porto, Portugal
11 shared publications - Paulo Sérgio Almeida
INESC TEC & University of Minho Portugal
11 shared publications Jean-Paul Bahsoun
United Parcel Service
4 shared publications- Ziad Kassam
HASLab, INESC TEC, University of Minho, Braga, Portugal
3 shared publications - Ahmad Tariq Sheikh
CEMSE Division, King Abdullah University of Science and Technology (KAUST), Thuwal, Saudi Arabia
2 shared publications - Ahmed Ahmed
Nanoelectronics Integrated Systems Center (NISC), Nile University,Giza,Egypt
1 shared publication
Latest Publications
- 27 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP (16) , 1
A Gateway-Assisted Fine-Grained Data Sharing Scheme for Cross-Domain IIoT
Cross-domain data sharing is essential for industrial 4.0, envisioning for intelligent manufacturing, equipment collaboration and industrial automation. Inherently, gearing by the interconnection of devices and systems across heterogeneous domains, how to ensure efficient and secure multi-party data sharing remains a critical challenge in the Industrial Internet of Things (IIoT). Many broadcast encryption and signature encryption schemes have been proposed to ensure the privacy and rapid sharing of cross-domain data in recent years . However, existing schemes still have shortcomings in supporting fine-grained access control and adapting to resource-constrained edge node deployments. To address this issue, this paper proposes a ciphertext policy attribute-based broadcast matching encryption scheme (CP-ABBME). This scheme integrates a ciphertext policy attribute-based encryption (CP-ABE) mechanism to achieve one-to-many secure ciphertext transmission in a fine-grained manner. Furthermore, considering the limited computation and storage resources of terminal devices, the proposed scheme builds an encapsulation–decapsulation chain architecture. It introduces bidirectional access control for mutual authentication between the sender and receiver, while offloading deployment and partial decryption to the receiving gateway. This design effectively reduces terminal-side computation and storage overhead during decryption and authentication. Formal security analysis shows that the proposed scheme meets stringent security requirements. Experimental results show that CP-ABBME improves the decryption performance by 39.3% to 99.6%, and reduces the terminal storage resource consumption by up to 9.35 KB.
- 27 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP (16) , 1
A Gateway-Assisted Fine-Grained Data Sharing Scheme for Cross-Domain IIoT
Cross-domain data sharing is essential for industrial 4.0, envisioning for intelligent manufacturing, equipment collaboration and industrial automation. Inherently, gearing by the interconnection of devices and systems across heterogeneous domains, how to ensure efficient and secure multi-party data sharing remains a critical challenge in the Industrial Internet of Things (IIoT). Many broadcast encryption and signature encryption schemes have been proposed to ensure the privacy and rapid sharing of cross-domain data in recent years . However, existing schemes still have shortcomings in supporting fine-grained access control and adapting to resource-constrained edge node deployments. To address this issue, this paper proposes a ciphertext policy attribute-based broadcast matching encryption scheme (CP-ABBME). This scheme integrates a ciphertext policy attribute-based encryption (CP-ABE) mechanism to achieve one-to-many secure ciphertext transmission in a fine-grained manner. Furthermore, considering the limited computation and storage resources of terminal devices, the proposed scheme builds an encapsulation–decapsulation chain architecture. It introduces bidirectional access control for mutual authentication between the sender and receiver, while offloading deployment and partial decryption to the receiving gateway. This design effectively reduces terminal-side computation and storage overhead during decryption and authentication. Formal security analysis shows that the proposed scheme meets stringent security requirements. Experimental results show that CP-ABBME improves the decryption performance by 39.3% to 99.6%, and reduces the terminal storage resource consumption by up to 9.35 KB.
- Open Access
- 18 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 68290-68310
Exon: An Oblivious Exactly-Once Messaging Protocol With Reliable Delegation
TCP is the default transport protocol of choice, namely for message-oriented middleware protocols (e.g., ZMTP, AMQP, MQTT) or distributed language runtimes (e.g., distributed Erlang), where exactly-once (EO) messaging is paramount. However, EO is only guaranteed within the TCP session, since reality shows that TCP connections can fail under many circumstances. Ensuring EO delivery ends up at the middleware layer, at the cost of higher complexity and lack of obliviouness—due to the use of permanent per-peer state. Moreover, using TCP at scale in highly concurrent systems leads to the need for TCP connection multiplexing, and possibly drastic performance loss due to head-of-line blocking. This paper introduces Exon, an oblivious exactly-once messaging protocol, and a corresponding lightweight library implementation over UDP. Exon uses a novel strategy of a per-message four-way protocol to ensure oblivious exactly-once messaging, with on-demand protocol-level “soft half-connections”, established when needed and safely discarded. Exon achieves simultaneously: correctness with no timing assumptions, obliviousness, and performance through merging and pipelining basic protocol messages. Exon also employs a reliable delegation technique to handover the sending responsibility to a mediating node, without violating EO, when the sender the receiver are directly unreachable to each other and even if the message had already been delivered. The empirical evaluation of Exon demonstrates significant improvements over TCP in throughput and latency under packet loss, while maintaining a negligible overhead in healthy networks.
- 18 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 68290-68310
Open AccessExon: An Oblivious Exactly-Once Messaging Protocol With Reliable Delegation
TCP is the default transport protocol of choice, namely for message-oriented middleware protocols (e.g., ZMTP, AMQP, MQTT) or distributed language runtimes (e.g., distributed Erlang), where exactly-once (EO) messaging is paramount. However, EO is only guaranteed within the TCP session, since reality shows that TCP connections can fail under many circumstances. Ensuring EO delivery ends up at the middleware layer, at the cost of higher complexity and lack of obliviouness—due to the use of permanent per-peer state. Moreover, using TCP at scale in highly concurrent systems leads to the need for TCP connection multiplexing, and possibly drastic performance loss due to head-of-line blocking. This paper introduces Exon, an oblivious exactly-once messaging protocol, and a corresponding lightweight library implementation over UDP. Exon uses a novel strategy of a per-message four-way protocol to ensure oblivious exactly-once messaging, with on-demand protocol-level “soft half-connections”, established when needed and safely discarded. Exon achieves simultaneously: correctness with no timing assumptions, obliviousness, and performance through merging and pipelining basic protocol messages. Exon also employs a reliable delegation technique to handover the sending responsibility to a mediating node, without violating EO, when the sender the receiver are directly unreachable to each other and even if the message had already been delivered. The empirical evaluation of Exon demonstrates significant improvements over TCP in throughput and latency under packet loss, while maintaining a negligible overhead in healthy networks.
- 20 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 33 (6) , 1751-1764
ResiLogic: Leveraging Composability and Diversity to Design Fault and Intrusion Resilient Chips
A long-standing challenge is the design of chips resilient to faults and glitches. Both fine-grained gate diversity and coarse-grained modular redundancy have been used in the past. However, these approaches have not been well-studied under other threat models where some stakeholders in the supply chain are untrusted. Increasing digital sovereignty tensions raise concerns regarding the use of foreign off-the-shelf tools and intellectual property (IP), or off-sourcing fabrication, driving research into the design of resilient chips under this threat model. This article addresses a threat model considering three pertinent attacks to resilience: distribution, zonal, and compound attacks. To mitigate these attacks, we introduce the ResiLogic framework that exploits Diversity by Composability: constructing diverse circuits composed of smaller diverse ones by design. This approach enables designers to develop circuits in the early stages of design without the need for additional redundancy in terms of space or cost. To generate diverse circuits, we propose a technique using E-Graphs with new rewrite definitions for diversity. Using this approach at different levels of granularity is shown to improve the resilience of circuit design in ResiLogic up to $\times 5$ against the three considered attacks.
- 20 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 33 (6) , 1751-1764
ResiLogic: Leveraging Composability and Diversity to Design Fault and Intrusion Resilient Chips
A long-standing challenge is the design of chips resilient to faults and glitches. Both fine-grained gate diversity and coarse-grained modular redundancy have been used in the past. However, these approaches have not been well-studied under other threat models where some stakeholders in the supply chain are untrusted. Increasing digital sovereignty tensions raise concerns regarding the use of foreign off-the-shelf tools and intellectual property (IP), or off-sourcing fabrication, driving research into the design of resilient chips under this threat model. This article addresses a threat model considering three pertinent attacks to resilience: distribution, zonal, and compound attacks. To mitigate these attacks, we introduce the ResiLogic framework that exploits Diversity by Composability: constructing diverse circuits composed of smaller diverse ones by design. This approach enables designers to develop circuits in the early stages of design without the need for additional redundancy in terms of space or cost. To generate diverse circuits, we propose a technique using E-Graphs with new rewrite definitions for diversity. Using this approach at different levels of granularity is shown to improve the resilience of circuit design in ResiLogic up to $\times 5$ against the three considered attacks.
- Open Access
- 8 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 37-43
Resilient and Secure System on Chip with Rejuvenation in the Wake of Persistent Attacks
To cope with the ever increasing threats of dynamic and adaptive persistent attacks, Fault and Intrusion Tolerance (FIT) is being studied at the hardware level to increase critical systems resilience. Based on state-machine replication, FIT is known to be effective if replicas are compromised and fail independently. This requires different ways of diversification at the software and hardware levels. In this paper, we introduce the first FIT hardware-based rejuvenation framework, we call Samsara, that allows for creating new FIT replicas with computing cores of diverse architectures. This is made possible by taking advantage of the reconfiguration features of MPSoC with FPGAs. A persistent attack that analyzes and exploits the vulnerability of a core will not be effective as rejuvenation using a different core architecture can be done periodically. Samsara allows for both replacing and adding/removing new cores to adapt to varying levels of threat severity. We introduce this concept and discuss the feasibility using a preliminary design we propose. A more rigorous study and empirical evaluation are left for future work.
- 8 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 37-43
Open AccessResilient and Secure System on Chip with Rejuvenation in the Wake of Persistent Attacks
To cope with the ever increasing threats of dynamic and adaptive persistent attacks, Fault and Intrusion Tolerance (FIT) is being studied at the hardware level to increase critical systems resilience. Based on state-machine replication, FIT is known to be effective if replicas are compromised and fail independently. This requires different ways of diversification at the software and hardware levels. In this paper, we introduce the first FIT hardware-based rejuvenation framework, we call Samsara, that allows for creating new FIT replicas with computing cores of diverse architectures. This is made possible by taking advantage of the reconfiguration features of MPSoC with FPGAs. A persistent attack that analyzes and exploits the vulnerability of a core will not be effective as rejuvenation using a different core architecture can be done periodically. Samsara allows for both replacing and adding/removing new cores to adapt to varying levels of threat severity. We introduce this concept and discuss the feasibility using a preliminary design we propose. A more rigorous study and empirical evaluation are left for future work.
- 17 November 2022
- Published by NASK National Research Institute in Applied Cybersecurity & Internet Governance
- Vol. 1 (1) , 1-17
Digital Sovereignty Strategies for Every Nation
Digital Sovereignty must be on the agenda of every modern nation. Digital technology is becoming part of our life details, from the vital essentials, like food and water management, to transcendence in the Metaverse and Space. Protecting these digital assets will, therefore, be inevitable for a modern country to live, excel and lead. Digital Sovereignty is a strategic necessity to protect these digital assets from the monopoly of friendly Rational states, and the threats of unfriendly Malicious states and behaviors. In this work, we revisit the definition and scope of digital sovereignty through extending it to cover the entire value chain of using, owning, and producing digital assets. We emphasize the importance of protecting the operational resources, both raw materials and human expertise, in addition to research and innovation necessary to achieve sustainable sovereignty. We also show that digital sovereignty by autonomy is often impossible, and by mutual cooperation is not always sustainable. To this end, we propose Sovereignty by Nash Equilibrium, often studied in Game Theory, to govern the relation with rational states. Finally, we propose a digital sovereignty agenda for different country’s digital profiles, based on their status quo, priorities and capabilities. We survey the state-of-the-art of digital technology that is useful to make the current digital assets sovereign; and we propose a roadmap that aims to develop a sovereign digital nation, as close as possible to autonomy. Finally, we draw the attention to the need of more research to better understand and implement digital sovereignty from different perspectives: technological, economic, and geopolitical.
- 17 November 2022
- Published by NASK National Research Institute in Applied Cybersecurity & Internet Governance
- Vol. 1 (1) , 1-17
Digital Sovereignty Strategies for Every Nation
Digital Sovereignty must be on the agenda of every modern nation. Digital technology is becoming part of our life details, from the vital essentials, like food and water management, to transcendence in the Metaverse and Space. Protecting these digital assets will, therefore, be inevitable for a modern country to live, excel and lead. Digital Sovereignty is a strategic necessity to protect these digital assets from the monopoly of friendly Rational states, and the threats of unfriendly Malicious states and behaviors. In this work, we revisit the definition and scope of digital sovereignty through extending it to cover the entire value chain of using, owning, and producing digital assets. We emphasize the importance of protecting the operational resources, both raw materials and human expertise, in addition to research and innovation necessary to achieve sustainable sovereignty. We also show that digital sovereignty by autonomy is often impossible, and by mutual cooperation is not always sustainable. To this end, we propose Sovereignty by Nash Equilibrium, often studied in Game Theory, to govern the relation with rational states. Finally, we propose a digital sovereignty agenda for different country’s digital profiles, based on their status quo, priorities and capabilities. We survey the state-of-the-art of digital technology that is useful to make the current digital assets sovereign; and we propose a roadmap that aims to develop a sovereign digital nation, as close as possible to autonomy. Finally, we draw the attention to the need of more research to better understand and implement digital sovereignty from different perspectives: technological, economic, and geopolitical.
- Open Access
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 42-48
Successful Systems in Production Graduate Teaching
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 42-48
Open AccessSuccessful Systems in Production Graduate Teaching
- 30 January 2019
- Published by Institution of Engineering and Technology (IET)
- p. 85-126
Data management techniques
Today, it is projected that data storage and management is becoming one of the key challenges in order to achieve ultrascale computing for several reasons. First, data is expected to grow exponentially in the coming years and this progression will imply that disruptive technologies will be needed to store large amounts of data and more importantly to access it in a timely manner. Second, the improvement of computing elements and their scalability are shifting application execution from CPU bound to I/O bound. This creates additional challenges for significantly improving the access to data to keep with computation time and thus avoid high-performance computing (HPC) from being underutilized due to large periods of I/O activity. Third, the two initially separate worlds of HPC that mainly consisted on one hand of simulations that are CPU bound and on the other hand of analytics that mainly perform huge data scans to discover information and are I/O bound are blurring. Now, simulations and analytics need to work cooperatively and share the same I/O infrastructure.
- 30 January 2019
- Published by Institution of Engineering and Technology (IET)
- p. 85-126
Data management techniques
Today, it is projected that data storage and management is becoming one of the key challenges in order to achieve ultrascale computing for several reasons. First, data is expected to grow exponentially in the coming years and this progression will imply that disruptive technologies will be needed to store large amounts of data and more importantly to access it in a timely manner. Second, the improvement of computing elements and their scalability are shifting application execution from CPU bound to I/O bound. This creates additional challenges for significantly improving the access to data to keep with computation time and thus avoid high-performance computing (HPC) from being underutilized due to large periods of I/O activity. Third, the two initially separate worlds of HPC that mainly consisted on one hand of simulations that are CPU bound and on the other hand of analytics that mainly perform huge data scans to discover information and are I/O bound are blurring. Now, simulations and analytics need to work cooperatively and share the same I/O infrastructure.
- 30 January 2019
- Published by Institution of Engineering and Technology (IET)
- p. 9-63
Programming models and runtimes
Several millions of execution flows will be executed in ultrascale computing systems (UCS), and the task for the programmer to understand their coherency and for the runtime to coordinate them is unfathomable. Moreover, related to UCS large scale and their impact on reliability, the current static point of view is not more sufficient. A runtime cannot consider to restart an application because of the failure of a single node as statically several nodes will fail every day. Classical management of these failures by the programmers using checkpoint restart is also too limited due to the overhead at such a scale. The article explores programming models and runtimes required to facilitate the task of scaling and extracting performance on continuously evolving platforms, while providing resilience and fault-tolerant mechanisms to tackle the increasing probability of failures throughout the whole software stack.
- 30 January 2019
- Published by Institution of Engineering and Technology (IET)
- p. 9-63
Programming models and runtimes
Several millions of execution flows will be executed in ultrascale computing systems (UCS), and the task for the programmer to understand their coherency and for the runtime to coordinate them is unfathomable. Moreover, related to UCS large scale and their impact on reliability, the current static point of view is not more sufficient. A runtime cannot consider to restart an application because of the failure of a single node as statically several nodes will fail every day. Classical management of these failures by the programmers using checkpoint restart is also too limited due to the overhead at such a scale. The article explores programming models and runtimes required to facilitate the task of scaling and extracting performance on continuously evolving platforms, while providing resilience and fault-tolerant mechanisms to tackle the increasing probability of failures throughout the whole software stack.
- Open Access
- 23 July 2018
- Published by Association for Computing Machinery (ACM)
- p. 269-271
Brief Announcement
Cryptocurrency and blockchain technologies are recently gaining wide adoption since the introduction of Bitcoin, being distributed, authority-free, and secure. Proof of Work (PoW) is at the heart of blockchain's security, asset generation, and maintenance. Although simple and secure, a hash-based PoW like Bitcoin's puzzle is often referred to as "useless'', and the used intensive computations are considered "waste'' of energy. A myriad of Proof of "something'' alternatives have been proposed to mitigate energy consumption; however, they either introduced new security threats and limitations, or the "work'' remained far from being really "useful''. In this work, we introduce Proof of eXercise (PoX): a sustainable alternative to PoW where an eXercise is a real world matrix-based scientific computation problem. We provide a novel study of the properties of Bitcoin's PoW, the challenges of a more "rational'' solution as PoX, and we suggest a comprehensive approach for PoX.
- 23 July 2018
- Published by Association for Computing Machinery (ACM)
- p. 269-271
Open AccessBrief Announcement
Cryptocurrency and blockchain technologies are recently gaining wide adoption since the introduction of Bitcoin, being distributed, authority-free, and secure. Proof of Work (PoW) is at the heart of blockchain's security, asset generation, and maintenance. Although simple and secure, a hash-based PoW like Bitcoin's puzzle is often referred to as "useless'', and the used intensive computations are considered "waste'' of energy. A myriad of Proof of "something'' alternatives have been proposed to mitigate energy consumption; however, they either introduced new security threats and limitations, or the "work'' remained far from being really "useful''. In this work, we introduce Proof of eXercise (PoX): a sustainable alternative to PoW where an eXercise is a real world matrix-based scientific computation problem. We provide a novel study of the properties of Bitcoin's PoW, the challenges of a more "rational'' solution as PoX, and we suggest a comprehensive approach for PoX.