Quantum Honeypots

Author:

Nagy Naya1ORCID,Nagy Marius2ORCID,Alazman Ghadeer1,Hawaidi Zahra1,Alsulaibikh Saja Mustafa1,Alabbad Layla1,Alfaleh Sadeem1,Aljuaid Areej1

Affiliation:

1. Department of Networks and Communication, College of Computer Science and Information Technology, Imam Abdulrahman Bin Faisal University, Dammam 31441, Saudi Arabia

2. College of Computer Engineering and Science, Prince Mohammad Bin Fahd University, Al-Khobar 31952, Saudi Arabia

Abstract

Quantum computation offers unique properties that cannot be paralleled by conventional computers. In particular, reading qubits may change their state and thus signal the presence of an intruder. This paper develops a proof-of-concept for a quantum honeypot that allows the detection of intruders on reading. The idea is to place quantum sentinels within all resources offered within the honeypot. Additional to classical honeypots, honeypots with quantum sentinels can trace the reading activity of the intruder within any resource. Sentinels can be set to be either visible and accessible to the intruder or hidden and unknown to intruders. Catching the intruder using quantum sentinels has a low theoretical probability per sentinel, but the probability can be increased arbitrarily higher by adding more sentinels. The main contributions of this paper are that the monitoring of the intruder can be carried out at the level of the information unit, such as the bit, and quantum monitoring activity is fully hidden from the intruder. Practical experiments, as performed in this research, show that the error rate of quantum computers has to be considerably reduced before implementations of this concept are feasible.

Publisher

MDPI AG

Subject

General Physics and Astronomy

Reference17 articles.

1. Enabling an Anatomic View to Investigate Honeypot Systems: A Survey;Fan;IEEE Syst. J.,2017

2. Spitzner, L. (2002). Honeypots: Tracking Hackers, Addison-Wesley.

3. Nielsen, M., and Chuang, I. (2000). Quantum Computation and Quantum Information, Cambridge University Press.

4. Grover, L. (1996, January 22–24). A fast quantum mechanical algorithm for database search. Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, Philadelphia, PA, USA.

5. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer;Shor;Spec. Issue Quantum Comput. SIAM J. Comput.,1997

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3