Journal of Information Security and Applications最新文献_第4页

Anomaly detection for blockchain nodes based on eBPF and fine-tuning large language model 基于eBPF和大语言模型微调的区块链节点异常检测

IF 3.7 2区计算机科学

Journal of Information Security and Applications Pub Date : 2026-03-01 Epub Date: 2025-12-10 DOI: 10.1016/j.jisa.2025.104329

Jincheng Su , Zhide Chen , Kexin Zhu , Chen Feng

{"title":"Anomaly detection for blockchain nodes based on eBPF and fine-tuning large language model","authors":"Jincheng Su , Zhide Chen , Kexin Zhu , Chen Feng","doi":"10.1016/j.jisa.2025.104329","DOIUrl":"10.1016/j.jisa.2025.104329","url":null,"abstract":"<div><div>While blockchain technology is widely used across various fields, it faces growing security challenges. Traditional blockchain anomaly detection methods, such as log analysis and fixed pattern recognition, struggle to handle complex and dynamic attack techniques. This paper proposes the Blockchain Live Anomaly Detection with eBPF and LLMs (BLAD-eLLM) scheme, which combines the efficient data capture capabilities of extended Berkeley Packet Filter (eBPF) technology for kernel-level security monitoring with the deep text understanding and semantic analysis power of large language models (LLMs) to enhance the network layer security of blockchain nodes. The proposed approach analyzes blockchain network activities comprehensively, aiming for accurate identification of potential anomalous behaviors. Furthermore, a knowledge-enhanced reasoning framework is developed, integrating Retrieval-Augmented Generation (RAG) for contextual blockchain threat intelligence and Chain-of-Thought (COT) prompting for multi-step attack analysis while employing Weight-Decomposed Low-Rank Adaptation (DoRA) based prompt fine-tuning to optimize the LLMs’ domain-specific adaptability and detection accuracy. Experimental results demonstrate that the proposed scheme significantly improves blockchain anomaly detection accuracy while maintaining minimal impact on system performance, ensuring the stability and security of the blockchain system.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"97 ","pages":"Article 104329"},"PeriodicalIF":3.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145738763","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

SAB:A stealing and robust backdoor attack based on steganographic algorithm against federated learning SAB：一种基于隐写算法的针对联邦学习的窃取和鲁棒后门攻击

IF 3.7 2区计算机科学

Journal of Information Security and Applications Pub Date : 2026-03-01 Epub Date: 2025-12-27 DOI: 10.1016/j.jisa.2025.104353

Weida Xu , Yang Xu , Sicong Zhang

{"title":"SAB:A stealing and robust backdoor attack based on steganographic algorithm against federated learning","authors":"Weida Xu , Yang Xu , Sicong Zhang","doi":"10.1016/j.jisa.2025.104353","DOIUrl":"10.1016/j.jisa.2025.104353","url":null,"abstract":"<div><div>Federated learning, an innovative network architecture designed to safeguard user privacy, is gaining widespread adoption in technology. However, given the existence of backdoor attacks in federated learning, exploring the security of federated learning is significant. Nevertheless, the backdoors investigated in current federated learning research can be readily detected by human inspection or resisted by detection algorithms. Accordingly, a new goal has been set to develop stealthy, robust federated learning backdoor attacks. This paper introduces a novel approach, SAB, explicitly tailored for backdoor attacks in federated learning, presenting an alternative gradient updating mechanism. SAB attack based on steganographic algorithm, using image steganographic algorithm to build a full-size trigger to improve the accuracy of backdoors and use multiple loss joint computation to produce triggers. SAB exhibits smaller distances to benign samples and greater imperceptibility to the human eye. As such, our triggers can mitigate or evade specific backdoor defense methods. In SAB, the bottom-95 % method is applied to extend the lifespan of backdoor attacks. It updates the gradient on minor value points to reduce the probability of being cleaned. Finally, the generalization of backdoors is enhanced with Sparse-update to improve the backdoor accuracy.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"97 ","pages":"Article 104353"},"PeriodicalIF":3.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145840958","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A lattice-based dual blockchain anonymous authentication scheme with forward security and revocability for VANETs 一种基于格的双向区块链匿名认证方案，具有前向安全性和可撤销性

IF 3.7 2区计算机科学

Journal of Information Security and Applications Pub Date : 2026-03-01 Epub Date: 2026-01-07 DOI: 10.1016/j.jisa.2025.104369

Xiuhua Lu , Jingzhuo Zhang , Shuanggen Liu , Yanzhe Dong , Xijie Lu , Junzhong Liu

{"title":"A lattice-based dual blockchain anonymous authentication scheme with forward security and revocability for VANETs","authors":"Xiuhua Lu , Jingzhuo Zhang , Shuanggen Liu , Yanzhe Dong , Xijie Lu , Junzhong Liu","doi":"10.1016/j.jisa.2025.104369","DOIUrl":"10.1016/j.jisa.2025.104369","url":null,"abstract":"<div><div>Vehicular Ad-hoc Networks (VANETs) play a vital role in Intelligent Transportation Systems (ITS) by improving traffic safety and efficiency. However, its open communication channels and high-speed mobility introduce privacy and security vulnerabilities, which makes anonymous authentication particularly important for privacy protection and secure communication. Nevertheless, existing anonymous authentication schemes face significant limitations in resisting single point of failure and supporting distributed storage of authentication messages. Moreover, most of these schemes rely on traditional number-theoretic assumptions, and lack resistance to quantum attacks. We propose a lattice-based dual blockchain anonymous authentication scheme with forward security and revocability for VANETs. The dual blockchain framework logically decouples vehicle identities from their mobility patterns, thereby enhancing anonymity. Forward security is obtained by leveraging bonsai trees structure, ensuring that exposure of current secret key of a vehicle does not affect the authenticity of previously transmitted messages. To address the issue of vehicle misbehavior or credential compromise, the scheme also supports revocability, allowing the system to efficiently and anonymously exclude malicious vehicles from the network without affecting honest participants. Our scheme is rigorously proven to achieve correctness, full anonymity and forward secure traceability. Experimental evaluations show its balanced performance in terms of security and efficiency.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"97 ","pages":"Article 104369"},"PeriodicalIF":3.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145926040","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Seeing the invisible: Detection of stealth DoS attacks using variational U-Net-like models 看到不可见的：使用变分u - net样模型检测隐形DoS攻击

IF 3.7 2区计算机科学

Journal of Information Security and Applications Pub Date : 2026-03-01 Epub Date: 2025-12-31 DOI: 10.1016/j.jisa.2025.104356

Enrico Cambiaso , Francesco Folino , Massimo Guarascio , Angelica Liguori , Antonino Rullo

{"title":"Seeing the invisible: Detection of stealth DoS attacks using variational U-Net-like models","authors":"Enrico Cambiaso , Francesco Folino , Massimo Guarascio , Angelica Liguori , Antonino Rullo","doi":"10.1016/j.jisa.2025.104356","DOIUrl":"10.1016/j.jisa.2025.104356","url":null,"abstract":"<div><div>The increasing sophistication of cyberattacks targeting companies and organizations continues to challenge the effectiveness of modern defense systems. Among these threats, slow Denial-of-Service (slow DoS) attacks are particularly difficult to detect, as they rely on evasion strategies that add significant complexity to cybersecurity efforts. Modern intrusion detection systems, especially those based on deep learning, have become essential tools in combating such attacks. However, their performance is often hindered by challenges such as limited data availability, noisy inputs, and the presence of out-of-distribution samples. Furthermore, their dependence on large labeled datasets makes detecting subtle or rare attack patterns particularly challenging. To overcome these limitations, this work proposes a novel unsupervised deep learning framework for detecting slow DoS attacks. The proposed approach incorporates a customized preprocessing pipeline to improve input data quality and leverages a sparse variational <em>U-Net-like</em> architecture for robust anomaly identification. Extensive experiments conducted on three real-world datasets demonstrate the ability of the framework to accurately and efficiently detect slow DoS attacks, highlighting its robustness, generalizability, and practical suitability for deployment in operational environments.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"97 ","pages":"Article 104356"},"PeriodicalIF":3.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145884191","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A high efficiency AVX2-optimized engineering of the post-quantum digital signature CROSS 后量子数字签名CROSS的高效avx2优化工程

IF 3.7 2区计算机科学

Journal of Information Security and Applications Pub Date : 2026-03-01 Epub Date: 2025-12-29 DOI: 10.1016/j.jisa.2025.104331

Alessandro Barenghi, Marco Gianvecchio, Gerardo Pelosi

{"title":"A high efficiency AVX2-optimized engineering of the post-quantum digital signature CROSS","authors":"Alessandro Barenghi, Marco Gianvecchio, Gerardo Pelosi","doi":"10.1016/j.jisa.2025.104331","DOIUrl":"10.1016/j.jisa.2025.104331","url":null,"abstract":"<div><div>Post-quantum cryptosystems are currently attracting a significant amount of research efforts due to the continuous improvements in quantum computing technologies, and the inherent high inertia characterizing the replacement of cryptographic standards. This situation has pushed large standardization bodies, such as the USA National Institute of Standards and Technology (NIST), to open standardization competitions to foster proposals and public scrutiny of new quantum-resistant cryptosystems and digital signatures. Whilst NIST has chosen, after four selection rounds (November 2017 - June 2023), three digital signature algorithms, in July 2023 it started a new selection process as the chosen candidates either rely exclusively on lattice-based computationally hard problems, or have unsatisfactory performance figures. In this work, we tackle the performance engineering of the Codes and Restricted Objects Signature Scheme (CROSS), which has been admitted to the second round of selection by NIST in October 2024. We propose a set of techniques to optimize software realizations of CROSS, targeting the AVX2 ISA extension by Intel, as requested by NIST; exploiting fully our choices on the signature scheme parameters, as part of the design team. We note that these techniques are general enough to be ported to other vector ISA extensions (e.g., ARM Neon). We provide a complete performance validation of our realization both with dedicated microbenchmarks as well as full end-to-end TLS benchmarks with realistic network delays. Our results show that CROSS is competitive with each of the already standardized post-quantum signature schemes as well as with the other schemes still under evaluation in the second selection round.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"97 ","pages":"Article 104331"},"PeriodicalIF":3.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145884189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A taxonomy of graph-based risk, vulnerability, and attack assessment methods in IoT systems 物联网系统中基于图的风险、漏洞和攻击评估方法的分类

IF 3.7 2区计算机科学

Journal of Information Security and Applications Pub Date : 2026-03-01 Epub Date: 2026-01-09 DOI: 10.1016/j.jisa.2025.104360

Ferhat Arat , Aykut Karakaya , Sedat Akleylek

{"title":"A taxonomy of graph-based risk, vulnerability, and attack assessment methods in IoT systems","authors":"Ferhat Arat , Aykut Karakaya , Sedat Akleylek","doi":"10.1016/j.jisa.2025.104360","DOIUrl":"10.1016/j.jisa.2025.104360","url":null,"abstract":"<div><div>This paper presents a comprehensive Systematic Literature Review (SLR) focusing on graph-based security and risk assessment approaches for IoT systems, utilizing a comprehensive taxonomy. In addition to elucidating IoT fundamentals and principles, we offer an expansive framework with a specific emphasis on graph-IoT-security concepts, contributing to the systematic organization of information. Unlike existing reviews, our focus is explicitly directed towards using graph theory for security assessment. Moreover, no systematic literature review has been conducted to specifically analyze security assessment approaches of IoT systems using graph methods, excluding other theoretical and applied techniques.</div><div>The objective is to describe, synthesize, and compare security developments in IoT from the perspective of various research questions. To the best of our knowledge, this paper represents the first SLR that concentrates on graph-based risk and vulnerability assessments. The primary objective of the SLR is to provide a comprehensive overview for researchers to identify attack graph or attack tree-based approaches. We delineate the IoT paradigm from a security perspective, highlighting various types of attacks detected by graph-based techniques. Furthermore, we present a comparative analysis of existing graph-based security evaluation mechanisms designed for IoT under various metrics, such as procedural performance, runtime, complexity, and other algorithmic overheads. Finally, we reveal issues and challenges regarding open problems that have not been considered and addressed in existing studies.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"97 ","pages":"Article 104360"},"PeriodicalIF":3.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145926054","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Robust DSSA-Net framework for splicing detection in image encryption domain 鲁棒dsa - net框架在图像加密领域的拼接检测

IF 3.7 2区计算机科学

Journal of Information Security and Applications Pub Date : 2026-03-01 Epub Date: 2025-12-15 DOI: 10.1016/j.jisa.2025.104341

Debolina Ghosh , Ruchira Naskar , Bidesh Chakraborty

{"title":"Robust DSSA-Net framework for splicing detection in image encryption domain","authors":"Debolina Ghosh , Ruchira Naskar , Bidesh Chakraborty","doi":"10.1016/j.jisa.2025.104341","DOIUrl":"10.1016/j.jisa.2025.104341","url":null,"abstract":"<div><div>One of the most common and widespread types of digital image fraudulence is image splicing attack, which combines contents from several sources into a single composite to deceive viewers. In this work, we address the problem of image splicing detection by proposing a robust deep learning-based framework. Specifically, the detector is built to operate for splicing detection on encrypted images, considering the growing usage of images in encrypted domains in IoT environments. The proposed model operates at two levels of granularity. At <em>level 1</em>, the model answers a binary question: whether an encrypted image is spliced or authentic. We achieve this by adding Self-Attention and Squeeze-and-Excitation modules to a custom <em>DenseNet</em> backbone, which enhances feature discrimination and localization in difficult scenarios like compression and encryption. At <em>level 2</em>, we determine the encryption technique that the image under question has undergone. Dense connections and attention mechanisms allow the network to focus on subtle splicing artifacts, on encrypted image inputs. Our results show that learnable patterns are persistent in encrypted image representations, resulting in robust classification performance.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"97 ","pages":"Article 104341"},"PeriodicalIF":3.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145791477","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Verifiable cross-modal searchable encryption via hierarchical spherical tree with beam search 带波束搜索的分层球树可验证跨模态可搜索加密

IF 3.7 2区计算机科学

Journal of Information Security and Applications Pub Date : 2026-03-01 Epub Date: 2026-01-19 DOI: 10.1016/j.jisa.2026.104373

Yuzhe Wang, Jiachen Shen, Xiaolei Dong, Zhenfu Cao

{"title":"Verifiable cross-modal searchable encryption via hierarchical spherical tree with beam search","authors":"Yuzhe Wang, Jiachen Shen, Xiaolei Dong, Zhenfu Cao","doi":"10.1016/j.jisa.2026.104373","DOIUrl":"10.1016/j.jisa.2026.104373","url":null,"abstract":"<div><div>Large-scale multimedia data are widely outsourced to cloud services to support cross-modal retrieval, such as text-to-image search. However, the cloud server is not fully trusted, which raises privacy concerns. Cross-modal searchable encryption (CMSE) enables retrieval over encrypted data without revealing content or query information. In large-scale settings, efficient similarity search over encrypted high-dimensional embeddings remains challenging. Existing indexing approaches, such as locality-sensitive hashing and tree-based methods, face trade-offs between retrieval quality and efficiency. Moreover, a malicious server may skip computations or return incomplete results, making verifiability an important requirement. This paper proposes VCSE-HST, a verifiable cross-modal searchable encryption scheme. VCSE-HST builds a hierarchical spherical tree index for fast pruning and uses beam search to explore multiple candidate paths, achieving both high efficiency and high retrieval quality on large datasets. The scheme provides a dual verification mechanism: score correctness verification for encrypted similarity scores and execution integrity verification based on Merkle commitment. Security analysis demonstrates that VCSE-HST achieves index confidentiality and trapdoor indistinguishability. Experimental evaluation validates that VCSE-HST attains substantial efficiency gains over linear search while preserving retrieval accuracy.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"97 ","pages":"Article 104373"},"PeriodicalIF":3.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146022999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Reversible data hiding in PDF files by overlapping characters 通过重叠字符隐藏在PDF文件中的可逆数据

IF 3.7 2区计算机科学

Journal of Information Security and Applications Pub Date : 2026-03-01 Epub Date: 2026-01-20 DOI: 10.1016/j.jisa.2026.104375

Wendi Zhu, Mohamed Mazeen Mujthaba, KokSheik Wong

{"title":"Reversible data hiding in PDF files by overlapping characters","authors":"Wendi Zhu, Mohamed Mazeen Mujthaba, KokSheik Wong","doi":"10.1016/j.jisa.2026.104375","DOIUrl":"10.1016/j.jisa.2026.104375","url":null,"abstract":"<div><div>Most reported PDF-based data hiding methods make subtle changes to existing PDF elements to conceal data, where the changes are predominantly made to the existing ‘TJ’ operator in a typical PDF document. However, this choice limits the volume of data that can be hidden, and most methods inevitably introduce visual distortion to the PDF document. Therefore, in this work, we propose a novel method called <em>OPAC</em> to hide data in PDF by means of <em><u>o</u>verla<u>p</u>ping char<u>ac</u>ters</em>, which is the first of its kind for data hiding purposes. Specifically, overlapping employs a series of technical steps to strategically stack characters. First, all 26 characters in the English alphabet are arranged into a 4 × 7 table based on their frequency of occurrences, where each character can be referred to by specifying the column and row in which it appears. Subsequently, the encrypted message is hidden, one character at a time, by superimposing a special symbol called <em>anchor</em> onto a specific character to indicate the column number, and specific combination of the ‘Tf’ and ‘Tz’ operators is added to the PDF stream to indicate the row number. Meanwhile, the newly added ‘Tf’ and ‘Tz’ operators are further manipulated to reduce the size and width of <em>anchor</em> to allow for complete character overlapping. We evaluate the performance of the proposed method OPAC using 220 PDF documents generated from various famous texts. On average, OPAC can hide 3877 characters at the expense of 0.224 MB increase in PDF file size. Furthermore, experiment results confirmed that OPAC achieves distortion-free data hiding and reversibility. Moreover, OPAC is empirically verified to be resistant to several common PDF processing and alterations.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"97 ","pages":"Article 104375"},"PeriodicalIF":3.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146023002","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Novel Privacy-Preserving user information queries scheme with functional policy 一种新的带功能策略的保隐私用户信息查询方案

IF 3.7 2区计算机科学

Journal of Information Security and Applications Pub Date : 2026-03-01 Epub Date: 2026-01-05 DOI: 10.1016/j.jisa.2025.104359

Yuhang Lei , Rui Shi , Yang Yang , Chunjie Cao , Huamin Feng

{"title":"A Novel Privacy-Preserving user information queries scheme with functional policy","authors":"Yuhang Lei , Rui Shi , Yang Yang , Chunjie Cao , Huamin Feng","doi":"10.1016/j.jisa.2025.104359","DOIUrl":"10.1016/j.jisa.2025.104359","url":null,"abstract":"<div><div>Privacy-preserving information queries enable a requester to obtain only the value <em>f</em>(<em>x</em>) computed over sensitive data <em>x</em>, while preventing disclosure of the underlying records. Existing approaches typically reveal full data, incur high on-chain overhead, or lack fair and verifiable delivery of function outputs. We propose a general-purpose, blockchain-compatible framework that ensures the requester learns only <em>f</em>(<em>x</em>) with no extra leakage and that the provider receives fair payment. The design integrates Adaptor Signatures (AS) for fair exchange and Inner-Product Functional Encryption (IPFE) for fine-grained function extraction. The framework is domain-agnostic and applicable to privacy-sensitive applications such as medical insurance and financial risk assessment. We formally prove advertisement soundness, unforgeability, witness extractability, and witness privacy. A prototype demonstrates linear scalability up to ℓ=100,000. We conduct a comparative evaluation between our scheme and related works under typical attribute dimensions <span><math><mrow><mi>ℓ</mi><mo>=</mo><mrow><mn>10</mn><mo>,</mo><mn>20</mn><mo>,</mo><mn>30</mn></mrow></mrow></math></span>. The results show that, under the same dimensional settings, our scheme achieves a 2.5×-6× performance improvement. Meanwhile, the storage overhead of our solution ranges from 1.6 KB to 4.1 KB, which is slightly lower than that of existing schemes (2.7-4.0 KB), and the on-chain cost consistently remains a fixed 64 bytes. These findings demonstrate that our approach provides significant practical advantages in low-dimensional, high-frequency medical query scenarios.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"97 ","pages":"Article 104359"},"PeriodicalIF":3.7,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145926104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0