Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mohamed Shaban

dblp:137/9886 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
3since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Quantum computing and quantum information · 100%
Network and information security
1 paper
Cryptographic protocols and secure computation · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information
quantum communication
1.012026
Efficient Protocols for Controlled Quantum Teleportation With Single and Multi-Controllers · IEEE Trans. Netw. 2026
Quantum computing and quantum information › quantum communication
quantum teleportation
1.012026
Efficient Protocols for Controlled Quantum Teleportation With Single and Multi-Controllers · IEEE Trans. Netw. 2026
Cryptographic protocols and secure computation › key management › key distribution
quantum key distribution
0.312026
Efficient Protocols for Controlled Quantum Teleportation With Single and Multi-Controllers · IEEE Trans. Netw. 2026

Methods — techniques the papers use, named apart from their topics

quantum hiding · 2.0entanglement resource analysis · 2.0GHZ state · 2.0
YearPublicationVenuePosition
2026 Efficient Protocols for Controlled Quantum Teleportation With Single and Multi-Controllers
abstract
Controlled quantum teleportation (CQT) is a key technique that allows quantum information to be transmitted over a quantum network under the control of a network administrator/ firewall. Existing CQT protocols rely on complex entanglement structures or increased number of qubits to enhance the administrator’s ability to block unauthorized communication, referred to as the control level, which poses practical challenges on current quantum hardware due to decoherence and the fragility of quantum states. In contrast, we propose efficient single and dual controller protocols that improve the control level, while using practical and experimentally feasible entanglement resources such as GHZ and GHZ-like states. The proposed protocols adopt quantum hiding to enhance the network’s control level, whether the receiver is compliant or non-compliant with the protocol. The dual-controller design further enables the integration of demilitarized zones (DMZs) into quantum networks, providing isolated intermediate regions jointly governed by two controllers and strengthening security boundaries. Our results demonstrate that the single-controller protocol achieves 87.5% control, reflecting a 75% improvement over the standard CQT scheme, while the dual-controller protocol achieves 98.44% control, corresponding to a 96.88% improvement. This improvement is achieved at a low cost of 2−9% reduction in the rate of successful teleportation when tested in noisy environments. In addition, both protocols maintain high state-averaged teleportation fidelity across randomly generated input states. When benchmarked against existing protocols, the proposed schemes demonstrate superior performance by achieving the highest efficiency while using the least amount of quantum resources.
Jesse Holland, Mohamed Shaban, Mahdi Chehimi, Muhammad Ismail 0001, Ahmed Younes, Walid Saad 0001
IEEE Trans. Netw.2
2024 Secure and Efficient Entanglement Distribution Protocols for Near-Term Quantum Internet
abstract
Quantum information technology has the potential to revolutionize computing, communications, and security. To fully realize its potential, quantum processors with millions of qubits are needed, which are still far from being accomplished. Thus, it is important to establish quantum networks to enable distributed quantum computing to leverage existing and near-term quantum processors into more powerful resources. This paper proposes an efficient entanglement distribution protocol for classical-quantum networks with a limited number of quantum links, enabling quantum teleportation in near-term hybrid networks. The proposed protocol uses entanglement swapping and classical network coding to distribute entanglements efficiently while overcoming bottlenecks and minimizing qubit and link usage. Experimental results show that the proposed protocol requires quantum resources that scale linearly with network size, with individual nodes only requiring a fixed number of qubits. For small network sizes of up to three transceiver pairs, the proposed protocol outperforms the benchmark by using 17% fewer qubit resources, achieving 8.8% higher accuracy, and with a 35% faster simulation time. The percentage improvement increases significantly for large network sizes. We also propose a protocol for securing entanglement distribution against malicious entanglements using quantum state encoding through rotation. Our analysis shows that this method requires no communication overhead and reduces the chance of a malicious node retrieving the teleported state to 7.2%. The achieved results point toward a protocol that enables a highly scalable, efficient, and secure near-term quantum Internet.
Nicholas Skjellum, Mohamed Shaban
ICCCN2
2024 Secured Quantum Identity Authentication Protocol for Quantum Networks
abstract
The emergence of sixth-generation (6G) networks presents a promising paradigm aimed at meeting stringent quality-of-service (QoS) requirements, thereby paving the way for modern applications such as the metaverse. In contrast, the advent of quantum computers poses a significant threat to the security of such networks. However, the quantum Internet signifies a remarkable advancement in communication technology, harnessing the principles of quantum entanglement and superposition to facilitate unparalleled levels of security and efficient computations. Quantum communication can be achieved through the utilization of quantum entanglement. Through the exchange of entangled pairs between two entities, quantum communication becomes feasible, enabled by the process of quantum teleportation. Given the lossy nature of the channels and the exponential decoherence of the transmitted photons, a set of intermediate nodes can serve as quantum repeaters to perform entanglement swapping and directly entangle two distant nodes. Such quantum repeaters may be malicious and by setting up malicious entanglements, intermediate nodes can jeopardize the confidentiality of the quantum information exchanged between the two communication nodes. Hence, this paper proposes a quantum identity authentication protocol that protects quantum networks from malicious entanglements. Unlike the existing protocols, the proposed quantum authentication protocol does not require periodic refreshments of the shared secret keys. Simulation results demonstrate that the proposed protocol can detect malicious entanglements with a 100% probability after an average of 4 authentication rounds. Moreover, the average number of authentication rounds required to detect an attack is reduced by 69% and 76.5% compared with benchmark protocols. Index Terms—Quantum identity authentication, quantum communications, malicious entanglement, quantum security, quantum Internet, 6G.
Mohamed Shaban
VTC Fall1
2015 ASIC implementation of a computationally efficient compressive sensing detection method using least squares optimization in 45 nm CMOS technology
abstract
This paper presents a high speed architecture of a recently proposed compressive sensing detection method for wideband cognitive radios using least squares. Using least squares instead of the orthogonal matching pursuit for signal recovery reduces the computational complexity where, the index search and matrix inverse stages are avoided. The proposed architecture is fully pipelined where, 14 clock cycles are required to detect 1024-length signal occupying 8 channels from 16 measurements. The design is implemented in 45 nm CMOS operating at 165 MHz. Since, the sensing time for 1024-length signal is roughly 84.8 ns, the proposed design offers high speed signal detection compared with state of art orthogonal matching pursuit architecture.
Mohamed Shaban, Tarek A. Idriss, Haytham Idriss, Magdy A. Bayoumi
ICASSP1