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

A lightweight identity based mutual authenticated key agreement scheme for telecare medical information system

Multimedia Tools and Applications 2025年 1-25页

作者： Banerjee, Ananya Sahana, Subhas Chandra Department of Computer Science & Engineering National Institute of Technology West Bengal Durgapur713209 India

The Telecare Medical Information System (TMIS) faces challenges in securely exchanging sensitive health information between TMIS nodes. A Mutual Authenticated Key Agreement (MAKA) scheme is used to eliminate security flaws, ensure users’ authenticity and establish a shared session key between two communicating nodes. A Public Key Infrastructure (PKI) based traditional authenticated key agreement scheme in TMIS driven by resource-constrained devices requires extra processing power and storage space to perform different certificate management activities. This overhead can be eliminated adopting Identity-Based Cryptography. We propose a mutual authenticated key agreement scheme based on Identity-Based Cryptography (IBC) incorporating elliptic curves which make the scheme not only computation cost efficient but also communication cost efficient. The proposed scheme is secure against all attacks related to a key agreement protocol. Comparative analysis with existing authentication schemes and formal security simulation using the AVISPA toolset demonstrate that the proposed scheme outperforms similar types of existing established schemes in the TMIS literature. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

A Deep Learning based Ultra-Lightweight Architecture for Atrial Fibrillation Detection Using Single-Lead ECG Recordings

引用

IEEE Access 2025年 13卷 86474-86486页

作者： Khan, Abbas Mughal, Muhammad Rizwan Irtaza, Syed Ali Khan, Mohsin Tahir, Madiha Ali, Ahtisham Saeed, Zoraize Ghulam Ishaq Khan Institute of Engineering Science and Technology Pakistan Sultan Qaboos University Electrical and Computer Engineering Department Muscat Oman Institute of Space Technology Electrical Engineering and Computer Science Department Islamabad Pakistan FAST National University of Computer and Emerging Sciences Islamabad Pakistan

In this paper, we have proposed a novel deep-learning model to process electrocardiogram (ECG) signals from single-lead ECG device. This is achieved by using a hybrid of CNN (convolutional neural network) and LSTM (long short-term memory) neural netwrok, where CNN extracts localized features from ECG signals, while the LSTM network extract temporal relationships. Moreover, a filtering-based method is proposed to generate synthetic data to overcome the data imbalance posed by the publicly available PhysioNet/CinC Challenge 2017 dataset. Specifically, three distinct ECG filters: Neurokit, BioSPPy, and EngZeeMod are used to perform data augmentation. As depicted by the simulation results, the proposed model exhibits superior performance with an F1 score of 99.56% providing a gain of 102.25 dB in terms of model size and performance gain of 1.06% outperforming existing state-of-the-art method enabling cost-effective real-time diagnosis with an inference time of 0.48×10-3 secs. Atrial fibrillation (A-Fib), a common cardiac arrhythmia, is linked to serious complications like heart failure and stroke, which early diagnosis could prevent. However, its paroxysmal and often asymptomatic nature complicates detection. In this paper, we propose a novel deep-learning model for single-lead ECG signal analysis, combining a convolutional neural network (CNN) to extract localized features and a long short-term memory (LSTM) network to capture temporal dependencies. To address data imbalance in the PhysioNet/CinC Challenge 2017 dataset, we employ a filtering-based approach with Neurokit, BioSPPy, and EngZeeMod for synthetic data generation. Simulation results show the model achieves a 99.56% F1 score, a 102.25 dB gain in efficiency, a 1.06% performance gain over the state-of-the-art method, and real-time diagnosis with a 0.48×10-3 second inference time. These simulation results confirm the superior performance of the proposed model. © 2013 IEEE.

关键词： Electrocardiography

来源：评论

学校读者我要写书评

暂无评论

Text steganography: enhanced character-level embedding algorithm using font attribute with increased resilience to statistical attacks

引用

Multimedia Tools and Applications 2025年第11期84卷 9367-9392页

作者： KL, Shreya Narasimhan R, Bala Krishnan Department of Computer Science and Engineering National Institute of Technology Tiruchirappalli Tamil Nadu Tiruchirappalli India

Text steganography, the science of hiding secret messages in innocent-looking text documents ensures the secrecy of the embedded secret. Cryptography, on the other hand, encrypts and converts the secret message into an unintelligible form ensuring confidentiality, integrity, and authentication of the message. It is to be noted that both steganography and cryptography are expected to work together hand-in-hand in order to attain a better security. Hence, a methodology that combines techniques from both steganography and cryptography is an unavoidable one for the complete protection of sensitive data. This paper aims to achieve one such methodology. The best existing method which works in similar direction is observed to use character spacing feature of text documents to embed the secrets. The method is reported to attain an average embedding capacity of ≈2 bits/cover-character and 8-bits/distortion with high imperceptibility and considerable cryptographic security. However, during experimentation, it is noticed that the methodology has the potential vulnerability of leaving clues for attackers with a probability of 0.51% which paves way for possible statistical attacks namely frequency analysis. This vulnerability occurred because of the constant left circular shift operation that is performed after embedding each secret character. This paper aims to address this vulnerability by proposing a novel modification that facilitates the methodology to perform both left and right circular shifts in an unbiased manner, based on the embedded secret, without affecting the notable achievements of the existing methodology. The proposed modification is successfully implemented, and further analysis indicated that the performed modification has in fact embedded the secret characters uniformly thereby reducing the standard deviation by 24%. This increased the resilience of the extended method to potential attacks that rely on statistical techniques. © The Author(s), under exclusive

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Complex preference analysis: a score-based evaluation strategy for ranking and comparison of the evolutionary algorithms

引用

Soft Computing 2025年第4期29卷 1967-1980页

作者： Sarkar, Debojyoti Biswas, Anupam Department of Computer Science and Engineering National Institute of Technology Silchar Assam Silchar788010 India

In this paper, an evaluation strategy is proposed for evaluation of optimization algorithms, called the Complex Preference Analysis, that assesses the efficiency of different evolutionary algorithms by considering multiple performance metrics concurrently across diverse dimensions and generating a single score for ranking. The proposed strategy allows for a thorough evaluation by assigning distinct priorities in the form of weights, to various performance parameters. The algorithm’s performances on each performance parameter are captured and the best and worst performances in each performance category are identified. The deviation of each algorithm from the best and worst performances in the respective performance category is formulated to generate a single score for each of the algorithms for comparison. The flexibility to adjust weights provides a valuable tool for customizing evaluations according to individual needs and preferences. The proposed evaluation strategy is studied by running evaluations on nine evolutionary algorithms based on their performance over five performance indicators on six datasets of the Travelling Salesman Problem. Conducting Complex Preference Analysis on the different evolutionary algorithms reveals distinctive patterns in their performance, with some algorithms such as Simulated Annealing, Tabu Search, Bat Algorithm, Genetic Algorithm, etc. consistently demonstrating superior results across multiple Travelling Salesman Problem instances, while other algorithms such as Ant Colony Optimization, Teaching Learning Based Optimization, etc. rank lower. The algorithms’ performances on individual performance parameters, when reflected on the final rank of the algorithms, generated based on the collective impact of all the parameters, elucidate the efficiency of the proposed evaluation strategy. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

A brief review on Quantum Key Distribution Protocols

引用

Multimedia Tools and Applications 2025年 1-40页

作者： Kumar, Mandeep Mondal, Bhaskar Department of Computer Science & Engineering National Institute of Technology Patna Bihar Patna800005 India

Development in Quantum computing paves the path to Quantum key distribution (QKD) by using the principles of quantum physics. QKD enables two remote parties to produce and share secure keys while removing all computing constraints on an adversary. The basic physics laws are used to identify any outside parties eavesdropping on the key exchange. In recent years many revolutionary developments in the field of QKD have been developed to overcome security and networking constraints. This survey provides an overview of the QKD protocol’s evolution and quantum network architecture. The paper also demonstrates QKD deployment techniques and elements of the QKD network. It also highlights ongoing design challenges by considering security and error estimation and correction, in contrast to studies concentrating on optical channels and equipment. Finally, this paper examines the possible directions for future research and offers design principles to guide the development of QKD and its related area. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

A moment-based pooling approach in convolutional neural networks for breast cancer histopathology image classification

引用

Neural Computing and Applications 2025年第2期37卷 1127-1156页

作者： Kumar, Arvind Singh, Chandan Sachan, Manoj Kumar Department of Computer Science and Engineering Sant Longowal Institute of Engineering and Technology Longowal Punjab Sangrur148106 India Department of Computer Science Punjabi University Punjab Patiala147002 India

Automated analysis of breast cancer (BC) histopathology images is a challenging task due to the high resolution, multiple magnifications, color variations, the presence of image artifacts, and morphological variability in the tissue images, often resulting in misdiagnosis. We propose four CNN models using a novel Zernike moments (ZMs)-based pooling approach, which replaces the existing global average pooling for the effective classification, referred to as CZP-CNN, MZP-CNN, SPMZP-CNN, and SPCZP-CNN. We utilize the ZMs-based pooling at three intermediate and last convolution layers. Of the four models, the two models, SPMZP-CNN and SPCZP-CNN, employ spatial pyramidal structures of feature maps to represent global and local characteristics of the feature maps. They effectively integrate the ZMs of various orders derived from the pyramidal representation of a feature map, representing the global and local aspects of shape and fine morphological details. The ability of ZMs is fully utilized to capture shape and morphological information available in the feature map using only a few low-order moments, which adds to the robustness of the proposed approach. Detailed experimental results on the publicly available BreaKHis dataset with four magnification levels and on the high-resolution BACH dataset demonstrate the proposed models’ effectiveness, robustness, and generalization ability. Among these proposed models, the complex ZMs-based SPCZP-CNN model achieves an impressive mean classification accuracy of 94.16% on the BreaKHis dataset and overall best binary and multiclass classification accuracy of 96.25% and 93.75% on the BACH dataset. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Silver Lining in the Fake News Cloud: Can Large Language Models Help Detect Misinformation?

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第1期6卷 14-24页

作者： Kumar, Raghvendra Goddu, Bhargav Saha, Sriparna Jatowt, Adam Indian Institute of Technology Department of Computer Science and Engineering Patna801106 India University of Innsbruck Department of Computer Science Innsbruck6020 Austria

In the times of advanced generative artificial intelligence, distinguishing truth from fallacy and deception has become a critical societal challenge. This research attempts to analyze the capabilities of large language models (LLMs) for detecting misinformation. Our study employs a versatile approach, covering multiple LLMs with few- and zero-shot prompting. These models are rigorously evaluated across various fake news and rumor detection datasets. Introducing a novel dimension, we additionally incorporate sentiment and emotion annotations to understand the emotional influence on misinformation detection using LLMs. Moreover, to extend our inquiry, we employ ChatGPT to intentionally distort authentic news as well as human-written fake news, utilizing zero-shot and iterative prompts. This deliberate corruption allows for a detailed examination of various parameters such as abstractness, concreteness, and named entity density, providing insights into differentiating between unaltered news, human-written fake news, and its LLM-corrupted counterpart. Our findings aspire to furnish a refined framework for discerning authentic news, human-generated misinformation, and LLM-induced distortions. This multifaceted approach, utilizing various prompt techniques, contributes to a comprehensive understanding of the subtle variations shaping misinformation sources. © 2024 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

ProxaDyn: A Proximity-Aware Dynamic Caching Approach for Named Data Networks

引用

IEEE Transactions on Network science and engineering 2025年第3期12卷 2360-2372页

作者： Kumari, Matta Krishna Tripathi, Nikhil Joshi, Piyush Indian Institute of Information Technology Computer Science and Engineering Group Sri City517 646 India Department of Computer Science and Engineering Dhanbad826 004 India

Named Data Network (NDN), a future Internet architecture is introduced to address the shortcomings of the current Internet architecture. NDN supports in-network caching to facilitate scalable content distribution and enhance overall network performance. However, the known NDN caching strategies suffer from a few common drawbacks, such as inefficient cache utilization, high content redundancy, and overhead due to lookup repetition. To address these issues, in this paper, we propose a novel caching strategy called ProxaDyn for efficient content lookup, placement, and replacement. During the content lookup phase, ProxaDyn interacts exclusively with the router responsible for caching a particular content. This eliminates interaction with other intermediate routers, thereby significantly reducing content access latency. For content placement, ProxaDyn strategically selects an on-path router based on content popularity. Popular content is placed in the cache of a router closer to the consumer, while less popular content is cached in a router away from the consumer. This approach significantly improves the cache hits and reduces the access latency. We test ProxaDyn over a diverse range of real-world network topologies. Using extensive experiments, we show that ProxaDyn could achieve significantly better results compared to the state-of-the-art NDN caching strategies. © 2013 IEEE.

关键词： Data communication systems

来源：评论

学校读者我要写书评

暂无评论

HeRo: Heuristic-Based Routing in Payment Channel Networks

IEEE Networking Letters

引用

IEEE Networking Letters 2025年第1期7卷 56-60页

作者： Mishra, Shruti Aggarwal, Virat Pal, Sujata Agarwal, Vidushi Indian Institute of Technology Ropar Department of Computer Science and Engineering Rupnagar140001 India

Payment channels support off-chain transactions by enhancing transaction speed and reducing fees in the main blockchain. However, the costs and complexity of the network increase as we increase the size of the network. To address these challenges, we propose Heuristic-Based Routing with Scheduling (HeRo) combining heuristic-based routing and scheduling techniques in Payment Channel Networks (PCNs). HeRo achieves a cost reduction of 32.71% and 73.08% compared with multi-charge PCN (MPCN-RP) and Dijkstra algorithms, respectively. © 2019 IEEE.

关键词： Network routing

来源：评论

学校读者我要写书评

暂无评论

Analysing theoretical and neural distinguishers in Salsa 128 bits

引用

International Journal of Ad Hoc and Ubiquitous Computing 2025年第1期49卷 43-59页

作者： Karthika, S.K. Singh, Kunwar Department of Computer Science and Engineering Vellore Institute of Technology Tamilnadu Chennai India Department of Computer Science and Engineering National Institute of Technology Tamilnadu Tiruchirappalli India

One of the finalists for the eSTREAM projects in 2005 was Salsa, created by Daniel J. Bernstein. Salsa is a widely recognised stream cipher that gained prominence after multiple cryptanalytic techniques were applied to the popular stream cipher RC4. Salsa offers two variations, with key sizes of 128 bits and 256 bits, depending on the seed key’s length. Salsa has undergone multiple key recovery attacks, particularly targeting the 256-bit variant, reaching up to its eighth round. Additionally, numerous experimental attacks have been conducted on Salsa, leaving room for further theoretical analysis. Theoretical analysis plays a crucial role in identifying vulnerable aspects of the cipher, enabling the design of stronger ciphers that are resistant to attacks. In a study by Dey and Sarkar (2021), they conducted a theoretical analysis to examine the origins of distinguishers found in experimental attacks on Salsa 256 bits and Chacha 256 bits. Inspired by their work, our paper focuses on the theoretical analysis of a differential attack on Salsa 128 bits, specifically up to four rounds. We mathematically established the probabilities of various observations and our theoretical analysis aligns with the experimental findings for Salsa 128 bits. Further, we have also found neural distinguisher for Salsa 128 bits based on the model proposed by Gohr (2019) in CRYPTO 2019. The designed model has found neural distinguishers at round 4 with 72.1% accuracy. Copyright © 2025 Inderscience Enterprises Ltd.

关键词： Uncertainty analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：