检索结果-内蒙古大学图书馆

Energy Harvesting Jammer-Aided Covert Communications in Wireless Multi-Relay IoT systems

IEEE Internet of Things Journal 2025年第11期12卷 17443-17455页

作者： Lv, Hao Yang, Bin Sun, Xiuwen Gao, Chan Gui, Bao Taleb, Tarik School of Computer Science and Technology of Anhui University Hefei230000 China Chuzhou University School of Computer and Information Engineering Chuzhou239000 China Xi'an University of Posts and Telecommunications National Engineering Research Center for Secured Wireless School of Cybersecurity Xi'an710121 China Ruhr University Bochum Faculty of Electrical Engineering and Information Technology Bochum44801 Germany

This paper investigates covert communications in a multi-relay Internet of Things (IoT) system with multiple energy harvesting jammers, where a transmitter (Alice) attempts to covertly transmit confidential messages to its destination (Bob) through relay forwarding, while a warden (Willie) detects the existence of Alice's transmission. Specifically, we employ a harvesting-then-jamming protocol with which the jammers first harvest energy from Alice and then send jamming signals to interfere with Willie's detection. We propose a relay and jammer selection strategy, namely quality of service (QoS)-aware selection, and use the random selection strategy as a comparison strategy. Under these two selection strategies, we derive the optimal detection threshold and minimum detection error probability at Willie, respectively. We then model the covert throughput performance and obtain the maximum covert throughput by jointly optimizing covert transmit power and jamming transmit power. Extensive numerical results are provided to illustrate the impacts of system parameters on covert throughput performance. © 2014 IEEE.

关键词： Jamming

来源：评论

学校读者我要写书评

暂无评论

Evaluating marginal likelihood approximations of dose–response relationship models in Bayesian benchmark dose methods for risk assessment

引用

Computational Toxicology 2025年 34卷

作者： Minewaki, Sota Ohigashi, Tomohiro Sozu, Takashi Department of Information and Computer Technology Tokyo University of Science of Engineering Japan Department of Information and Computer Technology Faculty of Engineering Tokyo University of Science Japan

Benchmark dose (BMD;a dose associated with a specified change in response) is used to determine the point of departure for the acceptable daily intake of substances for humans. Multiple dose–response relationship models are considered in the BMD method. The Bayesian model averaging (BMA) method is commonly used, where several models are averaged based on their posterior probabilities, which are determined by calculating the marginal likelihood (ML). Several ML approximation methods are employed in standard software packages, such as BBMD, ToxicR, and the EFSA platform for the BMD method, because the ML cannot be analytically calculated. Although ML values differ among approximation methods, resulting in BMD estimates, this phenomenon is neither widely recognized nor quantitatively evaluated. In this study, we evaluated the agreement of BMD estimates among five ML approximation methods in the BMA method. The five ML approximation methods are (1) maximum likelihood estimation (MLE)-based Schwarz criterion, (2) Markov chain Monte Carlo (MCMC)-based Schwarz criterion, (3) Laplace approximation, (4) density estimation, and (5) bridge sampling. We used eight dose–response relationship models and three prior distributions used in BBMD and ToxicR for 518 experimental datasets. The agreement among the approximation methods tended to be low in the non-informative prior distribution. Although the agreements tended to be high in the informative prior distribution, they were low in some approximation methods. Since the approximation method and the prior distribution affect the agreement, their selection should be carefully considered when implementing BMD methods. © 2025 Elsevier B.V.

关键词： Risk assessment

来源：评论

学校读者我要写书评

暂无评论

A secure quantum homomorphic encryption ciphertext retrieval scheme

引用

Soft Computing 2025年第3期29卷 1497-1509页

作者： Cheng, Zhen-Wen Chen, Xiu-Bo Xu, Gang Chang, Yan Miao, Li-Hua Yang, Yi-Xian Wang, Ya-Lan School of Data and Computer Science Shandong Women’s University Jinan250300 China Information Security Center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China School of Information Science and Technology North China University of Technology Beijing100144 China School of Cybersecurity Chengdu University of Information Technology Chengdu610225 China Huawei Technologies Co. Ltd Shenzhen518129 China Department of Computer Science Faculty of Engineering and Physical Sciences University of Surrey Surrey GuildfordGU2 7XH United Kingdom

In a recent paper (Gong et al. Quantum Inf Process 19:3, 2020), a novel ciphertext retrieval scheme based on the Grover algorithm and quantum homomorphic encryption was presented. In this scheme, when the server performs the operation of marking the solution on the user’s encrypted state in the Grover iteration, it needs to remove many gate-errors generated in the homomorphic evaluation of the T gate. And the server could judge this specific solution from the quantum circuit of marking the solution. It makes this scheme unable to achieve the low-cost and secure ciphertext retrieval. Therefore, we improve the Gong et al.’s scheme and propose a secure quantum homomorphic encryption ciphertext retrieval scheme. In our scheme, the trusted third party is introduced to cooperate with the server to execute the Grover algorithm. In each Grover iteration, the trusted third party can quickly mark the solution on the plaintext state, encrypt the marked state, and transmit it to the server. Then the server performs the remaining operations of this Grover iteration on the encrypted state. The trusted third party finally decrypts the iterated state. This cooperative approach ensures that the number of auxiliary qubits required and extra quantum gates executed in our scheme are lower than the Gong et al.’s scheme. By analyzing the security of our scheme, we confirm that the server and the trusted third party will not be informed of this solution. Thus, our scheme realizes the secure ciphertext retrieval with low computational overhead. We utilize IBM’s Qiskit framework to simulate our scheme, and the experimental result shows that our scheme is correct. It is worth noting that the low-cost and secure ciphertext retrieval will play a crucial role in modern information security and privacy protection. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Ciphertext

来源：评论

学校读者我要写书评

暂无评论

Review of dehazing techniques: challenges and future trends

引用

Multimedia Tools and Applications 2025年第3期84卷 1103-1131页

作者： Ayoub, Abeer El-Shafai, Walid El-Samie, Fathi E. Abd Hamad, Ehab K. I. EL-Rabaie, El-Sayed M. Department of Electronics and Electrical Communication Engineering Faculty of Electronic Engineering Menoufia University Menouf32952 Egypt Security Engineering Lab Computer Science Department Prince Sultan University Riyadh11586 Saudi Arabia Department of Information Technology College of Computer and Information Sciences Princess Nourah Bint Abdulrahman University Riyadh11671 Saudi Arabia Electrical Engineering Department Faculty of Engineering Aswan University Aswan81542 Egypt

The phenomenon of atmospheric haze arises due to the scattering of light by minute particles suspended in the atmosphere. This optical effect gives rise to visual degradation in images and videos. The degradation is primarily influenced by two key factors: atmospheric attenuation and scattered light. Scattered light causes an image to be veiled in a whitish veil, while attenuation diminishes the image inherent contrast. Efforts to enhance image and video quality necessitate the development of dehazing techniques capable of mitigating the adverse impact of haze. This scholarly endeavor presents a comprehensive survey of recent advancements in the domain of dehazing techniques, encompassing both conventional methodologies and those founded on machine learning principles. Traditional dehazing techniques leverage a haze model to deduce a dehazed rendition of an image or frame. In contrast, learning-based techniques employ sophisticated mechanisms such as Convolutional Neural Networks (CNNs) and different deep Generative Adversarial Networks (GANs) to create models that can discern dehazed representations by learning intricate parameters like transmission maps, atmospheric light conditions, or their combined effects. Furthermore, some learning-based approaches facilitate the direct generation of dehazed outputs from hazy inputs by assimilating the non-linear mapping between the two. This review study delves into a comprehensive examination of datasets utilized within learning-based dehazing methodologies, elucidating their characteristics and relevance. Furthermore, a systematic exposition of the merits and demerits inherent in distinct dehazing techniques is presented. The discourse culminates in the synthesis of the primary quandaries and challenges confronted by prevailing dehazing techniques. The assessment of dehazed image and frame quality is facilitated through the application of rigorous evaluation metrics, a discussion of which is incorporated. To provide empiri

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Smart Voting system Using Deep Learning 5th

Smart Voting System Using Deep Learning

引用

5th International Conference on Innovative Product Design and Intelligent Manufacturing systems, ICIPDIMS 2023

作者： Prasanthi, P. Aneesha, K. Sujith, P. Deepika, S. Sai Vamsi, S. Jayanthi Rao, M. Department of Information Technology Aditya Institute of Technology and Management Tekkali532201 India Department of Computer Science and Engineering Aditya Institute of Technology and Management Tekkali532201 India

ISBN: (纸本)9789819767311

The world's largest democratic nation is India, where we live. Therefore, it is imperative to guarantee that a fair election is used to elect the governing body. India exclusively employs an offline voting system, which is characterized by inefficiency and substandard performance due to the substantial manpower requirements and the extended duration for processing and disseminating the results. Therefore, a change that addresses these drawbacks is necessary for the system to become effective. The new procedure makes voting easier by not requiring a voter's physical appearance. This study focuses on a two-step authentication system that uses face recognition and an OTP mechanism to enable voters to cast their ballots remotely from any location using a computer or mobile device. If the user finds it more comfortable, this product also lets them vote offline. Prior to the election, voters’ faces are recorded using a face scanning technique that is helpful while voting. RFID tags, not voter ID the offline voting method. In order to use this method, voters must snap a photo of themselves prior to the election and compare it to the original before casting their vote. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

A Lightweight U-Net Model for Accurate Skin Lesion Segmentation

Iraqi Journal for Computer Science and Mathematics

引用

Iraqi Journal for computer science and Mathematics 2025年第2期6卷 1-11页

作者： Najjar, Fallah H. Kadhim, Karrar A. Mohamed, Farhan Rahim, Mohd Shafry Mohd Abdullah, Asniyani Nur Haidar Department of Emergent Computing Faculty of Computing Universiti Teknologi Malaysia Johor Bahru Malaysia Department of Computer Systems Techniques Technical Institute of Najaf Al-Furat Al-Awsat Technical University Najaf54001 Iraq Computer Techniques Engineering Department Faculty of Information Technology Imam Ja’afar Al-Sadiq University Baghdad Iraq Faculty of Information & Communication Technology Universiti Teknikal Malaysia Melaka Hang Tuah Jaya Melaka Durian Tunggal76100 Malaysia

In this paper, a new lightweight U-Net deep learning-based neural network designed for the segmentation of skin lesions is proposed. Segmentation of skin lesions is the most critical step in computer-aided dermatology diagnosis for the early detection of melanoma and other diseases. However, we address the difficulty related to the precise definition of the lesion margins with an eye on the computation cost. We have demonstrated the state-of-the-art performance of DeepSkinSeg in most metrics on dermoscopic images using the PH2 and Human Against Machine (HAM10000) datasets. The metrics of the DeepSkinSeg model were robustness measured as the Intersection over Union (IoU) at 91.49, Dice coefficient at 95.56, precision at 97.97, sensitivity at 96.84, and accuracy at 96.71 for the PH2 dataset. Other standard generalization capabilities for the HAM10000 dataset could be an IoU of 92.97, a Dice coefficient of 96.36, precision at 97.64, sensitivity at 95.10, and an accuracy of 94.59. DeepSkinSeg has a very efficient inference because the model itself is lightweight, proving to be very helpful for real-time dermatological analysis. This work further advanced the computer-aided diagnosis in the task of skin lesion classification, guaranteeing even more promising clinical applications. © 2025 The Author(s).

关键词： computer aided diagnosis

来源：评论

学校读者我要写书评

暂无评论

G-Thinkerq: A General Subgraph Querying system With a Unified Task-Based Programming Model

引用

IEEE Transactions on Knowledge and Data Engineering 2025年第6期37卷 3429-3444页

作者： Yuan, Lyuheng Guo, Guimu Yan, Da Adhikari, Saugat Khalil, Jalal Long, Cheng Zou, Lei Indiana University Bloomington Department of Computer Science BloomingtonIN47405 United States Rowan University Department of Computer Science GlassboroNJ08028 United States St. Cloud State University Department of Computer Science and Information Technology St. CloudMN56301 United States Nanyang Technological University School of Computer Science and Engineering 639798 Singapore Peking University Wangxuan Institute of Computer Technology Beijing100871 China

Given a large graphG, a subgraph queryQfinds the set of all subgraphs ofGthat satisfy certain conditions specified by Q. Examples of subgraph queries including finding a community containing designated members to organize an event, and subgraph matching. To overcome the weakness of existing graph-parallel systems that underutilize CPU cores when finding subgraphs, our prior system, G-thinker, was proposed that adopts a novel think-like-a-task (TLAT) parallel programming model. However, G-thinker targets offline analytics and cannot support interactive online querying where users continually submit subgraph queries with different query contents. The challenges here are (i) how to maintain fairness that queries are answered in the order that they are received: a later query is processed only if earlier queries cannot saturate the available computation resources;(ii) how to track the progress of active queries (each with many tasks under computation) so that users can be timely notified as soon as a query completes;and (iii) howtomaintainmemory boundedness and high task concurrency as inG-thinker. In this article, we propose a novel TLATprogramming framework, calledG-thinkerQ, for answering online subgraph queries. G-thinkerQ inherits the memory boundedness and high task concurrency of G-thinker by organizing the tasks of each query using a "task capsule"structure, and designs a novel task-capsule list is to ensure fairness among queries. A novel lineage-based mechanism is also designed to keep track ofwhen the last task of a query is completed. Parallel counterparts of the stateof- the-art algorithms for 4 recent advanced subgraph queries are implemented on G-thinkerQ to demonstrate its CPU-scalability. © 2025 IEEE.

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

Ethiopic Cryptography: An Efficient Hybrid Encryption Algorithm for Reducing Cybersecurity Attack 11th

Ethiopic Cryptography: An Efficient Hybrid Encryption Algori...

引用

11th EAI International Conference on Advancement of science and technology, ICAST 2023

作者： Akele, Tadesse Birara Bahiru, Tadesse Kebede Molla, Tibebu Legesse Fentie, Shambel Dessale Belay, Tadesse Destaw Marye, Almaz Yemataw Getaneh, Mersha Derese Department of Information System Kombolcha Institute of Technology Wollo University Kombolcha Ethiopia Department of Information Technology Kombolcha Institute of Technology Wollo University Kombolcha Ethiopia Deparment of Software Engineering Kombolcha Institute of Technology Wollo University Kombolcha Ethiopia Department of Computer Science Kombolcha Institute of Technology Wollo University Kombolcha Ethiopia

ISBN: (纸本)9783031641503

Cryptography is an essential tool in ensuring the security of data during network communication. Network and service providers prioritize data security to ensure secure data exchanges. Ethiopic cryptography is a unique encryption method that utilizes the Amharic language, prevalent in Ethiopia. Unlike Latin alphabets, Amharic consists of 287 characters, making decryption challenging. The encryption process involves converting the text to Amharic and then mapping it to a pair of randomly chosen two-bit English alphabets, creating an intermediate cipher. The Ethiopic cryptography algorithm employs a hybrid approach, using the RSA algorithm for secure key exchange and the Advanced Encryption Standard algorithm for text confidentiality. The algorithm comprises three phases—translation, mapping, and encryption—contributing to its effectiveness in securing data over the network. Decryption requires familiarity with the Amharic language and mapping details. The algorithm demonstrates a stronger avalanche effect (97%) in comparison with Blowfish and DES. The algorithm is proposed and evaluated using the design science research methodology, and its performance is validated through simulation using MATLAB and BunnaScript tools, considering factors like the avalanche effect, time complexity, and memory consumption. The evaluation shows that the suggested solution operates faster, requires lesser time for data encryption, and uses less memory than other methods in use. Overall, the proposed Ethiopic cryptography algorithm proves to be an efficient and effective method for securing data during network communication, offering stronger text confidentiality and an improved avalanche effect. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： MATLAB

来源：评论

学校读者我要写书评

暂无评论

Lightweight and Roubust Key Agreement for Securing IIoT-Driven Flexible Manufacturing systems

引用

IEEE Internet of Things Journal 2025年第11期12卷 17197-17209页

作者： Hammad, Muhammad Badshah, Akhtar Almeer, Mohammed A. Waqas, Muhammad Song, Houbing Chen, Sheng Han, Zhu GIK Institute of Engineering Sciences and Technology Faculty of Mechanical Engineering Topi23640 Pakistan University of Malakand Department of Software Engineering Dir Lower18800 Pakistan University of Bahrain Computer Engineering Department College of Information Technology 32038 Bahrain University of Greenwich Faculty of Engineering and Science Centre for Sustainable Cybersecurity United Kingdom Edith Cowan University School of Engineering PerthWA6027 Australia Department of Information Systems BaltimoreMD United States University of Southampton School of Electronics and Computer Science SouthamptonSO17 1BJ United Kingdom University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

The ever-evolving Internet of Things (IoT) has ushered in a new era of intelligent manufacturing across multiple industries. However, the security and privacy of real-time data transmitted over the public channel of the industrial IoT (IIoT) remain formidable challenges. Existing lightweight protocols often omit one or more critical security features, such as anonymity and untraceability, and are susceptible to threats like desynchronization attacks. Additionally, they struggle to achieve an optimal balance between robust security and performance efficiency. To bridge these gaps, we introduce a new lightweight key agreement security scheme that guarantees secure access to the IIoT-enabled flexible manufacturing system (FMS). The strength of our scheme lies in its utilization of the authenticated encryption with associative data (AEAD) primitive, AEGIS, along with hash functions and physical unclonable functions, which secure the IIoT ecosystem. Additionally, our scheme offers flexibility in the form of the addition of new machines, password updates, and revocation in cases of theft or loss. A comprehensive security analysis demonstrates the efficacy of the proposed scheme in thwarting various attacks. The formal analysis, based on the Real-Or-Random (RoR) model, ensures session key indistinguishability, while the informal analysis highlights its resilience against known attacks. The comparative assessment demonstrate that the proposed scheme consistently outperforms the benchmark schemes across multiple dimensions, including security and functionality features, computational and communication overheads, and runtime efficiency. Specifically, the proposed scheme achieves peak performance enhancements of 77.55%, 44.73%, and 69.6% in computational overhead, runtime overhead, and communication overhead, respectively, underscoring its substantial performance advantages. © 2025 IEEE.

关键词： Flexible manufacturing systems

来源：评论

学校读者我要写书评

暂无评论

Social Networks on WEB 3.0 12th

Social Networks on WEB 3.0

引用

12th International Conference on Frontiers of Intelligent Computing: Theory and Applications, FICTA 2024

作者： Cidri, Anirudh AshaRedddy, M. Bhaskar, T. Vijaya Krishna, A. Suryanarayana, G. Department of Information Technology Vardhaman College of Engineering Hyderabad India Department of Computer Science & Engineering-AIML CMR College of Engineering Hyderabad India Department of Information Technology G. Narayanamma Institute of Technology and Science Hyderabad India

ISBN: (纸本)9789819601462

The "Social Network on WEB3.0" project is poised to revolutionize online social dynamics by leveraging blockchain technology to create a decentralized platform. This initiative prioritizes user control and security, aiming to address the shortcomings of existing Web 2.0 networks. Users will have unprecedented control over their data and privacy, with blockchain ensuring transaction irreversibility. Key goals include user empowerment, enhanced data security, decentralization, incentivized participation, and adherence to legal and privacy standards. The project incorporates a token-based incentive system to stimulate user engagement and collaboration, fostering a vibrant online community. Leveraging Ethereum and MetaMask for transactions and smart contracts highlights the project’s adaptability and scalability. With a commitment to ongoing enhancement and user feedback, the initiative heralds a significant shift toward a digital landscape characterized by user-centricity, heightened security, and privacy awareness, offering individuals unparalleled authority over their online interactions. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Decentralized finance

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：