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

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

IF 3.7 2区计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

Journal of Information Security and Applications

Pub Date : 2026-01-20 DOI: 10.1016/j.jisa.2026.104375

Wendi Zhu, Mohamed Mazeen Mujthaba, KokSheik Wong

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 OPAC to hide data in PDF by means of overlapping characters, 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 anchor 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 anchor 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.

大多数报告的基于PDF的数据隐藏方法对现有的PDF元素进行细微的更改以隐藏数据，其中主要是对典型PDF文档中现有的‘ TJ ’操作符进行更改。但是，这种选择限制了可以隐藏的数据量，并且大多数方法不可避免地会给PDF文档带来视觉失真。因此，在这项工作中，我们提出了一种新的方法，称为OPAC，通过重叠字符来隐藏PDF中的数据，这是第一个用于数据隐藏的方法。具体来说，重叠使用了一系列技术步骤来策略性地堆叠字符。首先，根据出现频率将英文字母表中的所有26个字符排列到4 × 7表中，每个字符可以通过指定其出现的列和行来引用。随后，通过将称为anchor的特殊符号叠加到指示列号的特定字符上来隐藏加密消息，每次隐藏一个字符，并将‘ Tf ’和‘ Tz ’操作符的特定组合添加到PDF流中以指示行号。同时，对新增加的“Tf”和“Tz”操作符进行了进一步的操作，以减小锚的大小和宽度，从而允许完整的字符重叠。我们使用220个由各种著名文本生成的PDF文档来评估所提出的方法OPAC的性能。平均而言，OPAC可以隐藏3877个字符，代价是PDF文件大小增加0.224 MB。实验结果表明，OPAC实现了无失真的数据隐藏和可逆性。此外，经验证明OPAC可以抵抗几种常见的PDF处理和更改。

{"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-01-20","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

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

IF 3.7 2区计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

Journal of Information Security and Applications

Pub Date : 2026-01-19 DOI: 10.1016/j.jisa.2026.104373

Yuzhe Wang, Jiachen Shen, Xiaolei Dong, Zhenfu Cao

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.

大规模多媒体数据被广泛外包给云服务，以支持跨模式检索，如文本到图像的搜索。然而，云服务器不是完全可信的，这引起了隐私问题。跨模式可搜索加密（CMSE）支持在不泄露内容或查询信息的情况下对加密数据进行检索。在大规模环境下，对加密的高维嵌入进行有效的相似性搜索仍然是一个挑战。现有的索引方法，如位置敏感散列和基于树的方法，面临着检索质量和效率之间的权衡。此外，恶意服务器可能跳过计算或返回不完整的结果，这使得可验证性成为一个重要的需求。提出了一种可验证的跨模态可搜索加密方案VCSE-HST。VCSE-HST构建了层次球形树索引进行快速剪枝，并利用束搜索探索多个候选路径，在大数据集上实现了高效率和高检索质量。该方案提供了双重验证机制：加密相似度分数的分数正确性验证和基于默克尔承诺的执行完整性验证。安全性分析表明，VCSE-HST实现了索引机密性和陷门不可分辨性。实验评估验证了VCSE-HST在保持检索精度的同时获得了比线性搜索更大的效率提升。

{"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-01-19","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

Practical collusion-resistant conjunctive dynamic searchable encryption with result pattern hiding 具有结果模式隐藏的实用抗合谋联合动态可搜索加密

IF 3.7 2区计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

Journal of Information Security and Applications

Pub Date : 2026-01-19 DOI: 10.1016/j.jisa.2025.104363

Mingyue Li , Honggang Wan , Ruizhong Du , Guanxiong Ha , Xiaoyun Guang

With the rapid development of cloud computing security, multi-user conjunctive dynamic searchable encryption is receiving more and more attention. However, existing schemes mainly rely on the XSet structure to implement conjunctive queries, which brings significant additional computational costs such as exponentiation, an extra round of communication. In addition, the leakage of keyword pair result pattern (KPRP) has been overlooked. In this work, a practical multi-user conjunction dynamic searchable encryption scheme (named MORF-MUDSE) is proposed, which can against a passive attack by a server colluding with any search user while ensuring the two basic attributes of both forward and backward security. Specifically, a mask-obfuscation random function protocol (named MORF) that includes document keyword set information is designed to implement a new subset validation method of conjunctive queries. This method only completes one round of communication to obtain results, which greatly improves computational efficiency while protecting KPRP. Moreover, a delayed update strategy is proposed, which address the issue of information synchronization between data owner and users during those updates. Through theoretical and experimental analysis, it has been shown that the proposed scheme in this paper has better efficiency in computation and communication compared to the state-of-the-art schemes.

随着云计算安全技术的飞速发展，多用户联合动态可搜索加密技术越来越受到人们的关注。然而，现有的方案主要依赖于XSet结构来实现联合查询，这带来了大量的额外计算成本，例如幂运算，即额外的一轮通信。此外，关键字对结果模式（KPRP）的泄漏问题一直被忽视。本文提出了一种实用的多用户联合动态可搜索加密方案（MORF-MUDSE），该方案在保证前向和后向安全两个基本属性的同时，能够抵御服务器与任意搜索用户串谋的被动攻击。具体来说，设计了一个包含文档关键字集信息的掩码混淆随机函数协议（MORF）来实现一种新的联合查询子集验证方法。该方法只需完成一轮通信即可获得结果，在保护KPRP的同时大大提高了计算效率。此外，提出了一种延迟更新策略，解决了数据所有者和用户在更新过程中的信息同步问题。理论分析和实验分析表明，与现有方案相比，本文提出的方案具有更好的计算效率和通信效率。

{"title":"Practical collusion-resistant conjunctive dynamic searchable encryption with result pattern hiding","authors":"Mingyue Li , Honggang Wan , Ruizhong Du , Guanxiong Ha , Xiaoyun Guang","doi":"10.1016/j.jisa.2025.104363","DOIUrl":"10.1016/j.jisa.2025.104363","url":null,"abstract":"<div><div>With the rapid development of cloud computing security, multi-user conjunctive dynamic searchable encryption is receiving more and more attention. However, existing schemes mainly rely on the <em>XSet</em> structure to implement conjunctive queries, which brings significant additional computational costs such as exponentiation, an extra round of communication. In addition, the leakage of keyword pair result pattern (<em>KPRP</em>) has been overlooked. In this work, a practical multi-user conjunction dynamic searchable encryption scheme (named <em>MORF-MUDSE</em>) is proposed, which can against a passive attack by a server colluding with any search user while ensuring the two basic attributes of both forward and backward security. Specifically, a mask-obfuscation random function protocol (named <em>MORF</em>) that includes document keyword set information is designed to implement a new subset validation method of conjunctive queries. This method only completes one round of communication to obtain results, which greatly improves computational efficiency while protecting <em>KPRP</em>. Moreover, a delayed update strategy is proposed, which address the issue of information synchronization between data owner and users during those updates. Through theoretical and experimental analysis, it has been shown that the proposed scheme in this paper has better efficiency in computation and communication compared to the state-of-the-art schemes.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"97 ","pages":"Article 104363"},"PeriodicalIF":3.7,"publicationDate":"2026-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146023003","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

Implications of applying emulation data to machine learning-based intrusion detection systems 仿真数据应用于基于机器学习的入侵检测系统的意义

IF 3.7 2区计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

Journal of Information Security and Applications

Pub Date : 2026-01-17 DOI: 10.1016/j.jisa.2025.104362

Maximilian Wolf , Kevin Bergner , Pascal Förtsch, Dieter Landes

Intrusion detection systems (IDS) require high-quality benchmark data sets for evaluating their performance in distinguishing suspicious activities from normal behavior patterns. While real-world network environments often consist of physical hardware components, it is, however, difficult to generate an IDS benchmark data set in a real-world network environment for reasons such as scalability, costs, anonymity in real-world data, infrastructure, and availability of hardware components. A solution to this problem is the usage of emulated network environments to create IDS benchmark data sets. Nevertheless, it is unclear whether emulated data represents physical network characteristics based on the recorded data patterns. Several IDS benchmark data sets were generated in the past, but none addressed the described infrastructure gap so far. To address this issue, we recreated a small physical enterprise network by using an emulated network environment. Inside both networks, we executed identical script-based user behavior, which includes six normal behavior categories and one attack behavior category. To check whether the emulated data are a suitable proxy for training machine learning-based IDS, recorded host and network data sources of both simulation environments are analyzed via diverse approaches. We use Wasserstein distances to compare the properties of the data distributions. Subsequently, we apply established classification metrics to evaluate the performances of a collection of machine learning-based classifiers on the data. For both host and network data, differences between emulated and actual hardware-based data could be identified. In general, the machine learning-based performances show that emulated IDS data is a good proxy for hardware-generated data produced on actual devices during our experiments.

入侵检测系统（IDS）需要高质量的基准数据集来评估其在区分可疑活动和正常行为模式方面的性能。虽然真实的网络环境通常由物理硬件组件组成，但是，由于可伸缩性、成本、真实数据的匿名性、基础设施和硬件组件的可用性等原因，很难在真实的网络环境中生成IDS基准数据集。这个问题的解决方案是使用模拟网络环境来创建IDS基准数据集。然而，尚不清楚模拟数据是否表示基于记录数据模式的物理网络特征。过去生成了几个IDS基准数据集，但是到目前为止没有一个解决了所描述的基础设施差距。为了解决这个问题，我们使用模拟的网络环境重新创建了一个小型的物理企业网络。在这两个网络中，我们执行了相同的基于脚本的用户行为，其中包括六种正常行为类别和一种攻击行为类别。为了检查模拟数据是否适合用于训练基于机器学习的IDS，通过不同的方法分析了两种模拟环境中记录的主机和网络数据源。我们使用Wasserstein距离来比较数据分布的性质。随后，我们应用已建立的分类指标来评估一组基于机器学习的分类器对数据的性能。对于主机和网络数据，可以识别出仿真数据和实际基于硬件的数据之间的差异。一般来说，基于机器学习的性能表明，在我们的实验中，模拟的IDS数据是在实际设备上产生的硬件生成数据的良好代理。

{"title":"Implications of applying emulation data to machine learning-based intrusion detection systems","authors":"Maximilian Wolf , Kevin Bergner , Pascal Förtsch, Dieter Landes","doi":"10.1016/j.jisa.2025.104362","DOIUrl":"10.1016/j.jisa.2025.104362","url":null,"abstract":"<div><div>Intrusion detection systems (IDS) require high-quality benchmark data sets for evaluating their performance in distinguishing suspicious activities from normal behavior patterns. While real-world network environments often consist of physical hardware components, it is, however, difficult to generate an IDS benchmark data set in a real-world network environment for reasons such as scalability, costs, anonymity in real-world data, infrastructure, and availability of hardware components. A solution to this problem is the usage of emulated network environments to create IDS benchmark data sets. Nevertheless, it is unclear whether emulated data represents physical network characteristics based on the recorded data patterns. Several IDS benchmark data sets were generated in the past, but none addressed the described infrastructure gap so far. To address this issue, we recreated a small physical enterprise network by using an emulated network environment. Inside both networks, we executed identical script-based user behavior, which includes six normal behavior categories and one attack behavior category. To check whether the emulated data are a suitable proxy for training machine learning-based IDS, recorded host and network data sources of both simulation environments are analyzed via diverse approaches. We use Wasserstein distances to compare the properties of the data distributions. Subsequently, we apply established classification metrics to evaluate the performances of a collection of machine learning-based classifiers on the data. For both host and network data, differences between emulated and actual hardware-based data could be identified. In general, the machine learning-based performances show that emulated IDS data is a good proxy for hardware-generated data produced on actual devices during our experiments.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"97 ","pages":"Article 104362"},"PeriodicalIF":3.7,"publicationDate":"2026-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145977328","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

Privacy-aware video deanonymization: a configurable pipeline for selective reversal with intelligibility preservation 隐私意识视频去匿名化：一个可配置的管道选择性反转与可理解性保存

IF 3.7 2区计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

Journal of Information Security and Applications

Pub Date : 2026-01-16 DOI: 10.1016/j.jisa.2025.104367

Vasco Simões , João Garcia , Paulo Carreira

The emergence of Computer Vision (CV) in self-driving vehicles, smart retail, and safety monitoring provides substantial economic benefits. However, it also presents significant privacy concerns for individuals captured on video. Standard techniques to mitigate privacy threats in video processing require some form of video anonymization, such as using blurring or other obfuscation operations to redact human figures from the input data before processing or storage. Yet, the irreversible nature of redaction operations hinders the use of CV in valuable applications, such as quality assurance, safety, or fraud litigation.

This paper presents and validates a novel approach for video anonymization that guarantees the anonymity and security of human subjects appearing in the video while maintaining high levels of scene intelligibility. Our approach is based on per-subject episodic key-derived cryptography to securely store data of individuals and enable selective per-subject deanonymization. In this way we can create video streams wherein only consenting subjects can be re-identified. Moreover, our approach can be integrated into CV processing pipelines and, as we also demonstrate, allow for the interchangeability of the visual anonymization techniques, which deliver various degrees of anonymity according to application needs while maintaining significant intelligibility and preserving the scene integrity.

计算机视觉（CV）在自动驾驶汽车、智能零售和安全监控方面的出现提供了巨大的经济效益。然而，这也给被视频捕获的个人带来了严重的隐私问题。缓解视频处理中隐私威胁的标准技术需要某种形式的视频匿名化，例如在处理或存储之前使用模糊或其他混淆操作从输入数据中编辑人物形象。然而，编校操作的不可逆性质阻碍了CV在有价值的应用中的使用，例如质量保证、安全或欺诈诉讼。本文提出并验证了一种新的视频匿名化方法，该方法保证了视频中出现的人类受试者的匿名性和安全性，同时保持了高水平的场景可理解性。我们的方法是基于每个主题的情景密钥派生加密，以安全地存储个人数据，并实现选择性的每个主题去匿名化。通过这种方式，我们可以创建视频流，其中只有同意的主体才能被重新识别。此外，我们的方法可以集成到CV处理管道中，并且，正如我们所展示的，允许视觉匿名化技术的互换性，根据应用需要提供不同程度的匿名，同时保持显著的可理解性和保持场景完整性。

{"title":"Privacy-aware video deanonymization: a configurable pipeline for selective reversal with intelligibility preservation","authors":"Vasco Simões , João Garcia , Paulo Carreira","doi":"10.1016/j.jisa.2025.104367","DOIUrl":"10.1016/j.jisa.2025.104367","url":null,"abstract":"<div><div>The emergence of Computer Vision (CV) in self-driving vehicles, smart retail, and safety monitoring provides substantial economic benefits. However, it also presents significant privacy concerns for individuals captured on video. Standard techniques to mitigate privacy threats in video processing require some form of video anonymization, such as using blurring or other obfuscation operations to redact human figures from the input data before processing or storage. Yet, the irreversible nature of redaction operations hinders the use of CV in valuable applications, such as quality assurance, safety, or fraud litigation.</div><div>This paper presents and validates a novel approach for video anonymization that guarantees the anonymity and security of human subjects appearing in the video while maintaining high levels of scene intelligibility. Our approach is based on per-subject episodic key-derived cryptography to securely store data of individuals and enable selective per-subject deanonymization. In this way we can create video streams wherein only consenting subjects can be re-identified. Moreover, our approach can be integrated into CV processing pipelines and, as we also demonstrate, allow for the interchangeability of the visual anonymization techniques, which deliver various degrees of anonymity according to application needs while maintaining significant intelligibility and preserving the scene integrity.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"97 ","pages":"Article 104367"},"PeriodicalIF":3.7,"publicationDate":"2026-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145977325","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

Blockchain-enabled heterogeneous communication protocol with identifiable abort in federated learning for artificial intelligence of things 支持区块链的异构通信协议，在人工智能事物的联邦学习中具有可识别的中止

IF 3.7 2区计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

Journal of Information Security and Applications

Pub Date : 2026-01-12 DOI: 10.1016/j.jisa.2025.104370

Hu Xiong , Qiyong Xian , Kuo-Hui Yeh

The convergence of the Internet of Things (IoT) and artificial intelligence (AI) has led to the emergence of the Artificial Intelligence of Things (AIoT), creating smart devices that learn from data and make autonomous decisions. Local data produced by AIoT devices can be used to create a universal model through federated learning (FL). However, ensuring secure communication in FL among devices from public key infrastructure (PKI) and certificateless (CL) cryptosystems, is a major challenge due to untrusted channels and privacy concerns. To tackle these challenges, this article presents a novel blockchain-enabled heterogeneous communication protocol with identifiable abort (BEHCPwIA), which helps participants negotiate a group public key and their corresponding private keys in one communication round. The proposed protocol not only ensures indistinguishability and semantic security, but also applies an identifiable abort mechanism to enhance communication transparency and accountability. With the support of this BEHCPwIA protocol, the FL could foster greater collaboration and trust among participants in the expanding AIoT landscape. Experimental simulations indicate that the proposed protocol not only maintains high security but also demonstrates high efficiency compared to existing solutions.

物联网（IoT）和人工智能（AI）的融合导致了物联网人工智能（AIoT）的出现，创造了能够从数据中学习并做出自主决策的智能设备。AIoT设备产生的本地数据可用于通过联邦学习（FL）创建通用模型。然而，由于不可信的通道和隐私问题，确保来自公钥基础设施（PKI）和无证书（CL）密码系统的设备之间在FL中的安全通信是一个主要挑战。为了应对这些挑战，本文提出了一种新的具有可识别中断的支持区块链的异构通信协议（BEHCPwIA），它可以帮助参与者在一轮通信中协商组公钥及其相应的私钥。该协议不仅保证了不可区分性和语义安全性，而且采用了可识别的中断机制来提高通信的透明性和可问责性。在BEHCPwIA协议的支持下，FL可以在不断扩大的AIoT领域中促进参与者之间更大的合作和信任。实验仿真表明，与现有方案相比，该协议不仅具有较高的安全性，而且具有较高的效率。

{"title":"Blockchain-enabled heterogeneous communication protocol with identifiable abort in federated learning for artificial intelligence of things","authors":"Hu Xiong , Qiyong Xian , Kuo-Hui Yeh","doi":"10.1016/j.jisa.2025.104370","DOIUrl":"10.1016/j.jisa.2025.104370","url":null,"abstract":"<div><div>The convergence of the Internet of Things (IoT) and artificial intelligence (AI) has led to the emergence of the Artificial Intelligence of Things (AIoT), creating smart devices that learn from data and make autonomous decisions. Local data produced by AIoT devices can be used to create a universal model through federated learning (FL). However, ensuring secure communication in FL among devices from public key infrastructure (PKI) and certificateless (CL) cryptosystems, is a major challenge due to untrusted channels and privacy concerns. To tackle these challenges, this article presents a novel blockchain-enabled heterogeneous communication protocol with identifiable abort (BEHCPwIA), which helps participants negotiate a group public key and their corresponding private keys in one communication round. The proposed protocol not only ensures indistinguishability and semantic security, but also applies an identifiable abort mechanism to enhance communication transparency and accountability. With the support of this BEHCPwIA protocol, the FL could foster greater collaboration and trust among participants in the expanding AIoT landscape. Experimental simulations indicate that the proposed protocol not only maintains high security but also demonstrates high efficiency compared to existing solutions.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"97 ","pages":"Article 104370"},"PeriodicalIF":3.7,"publicationDate":"2026-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145977326","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

PVO-based reversible data hiding with flexible strip moving using classification-based adaptive prediction guided by CNN 基于分类自适应预测的基于pvo的柔性条带移动可逆数据隐藏

IF 3.7 2区计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

Journal of Information Security and Applications

Pub Date : 2026-01-10 DOI: 10.1016/j.jisa.2025.104368

Guojun Fan , Chen Zuo , Lei Lu , Zhihai Yang , Juan Zhao , Zhibin Pan

Pixel-value-ordering (PVO) based reversible data hiding methods have been widely investigated by researchers because of their effective trade-off between embedding capacity and stego image fidelity. Conventional PVO-based methods divide the cover image into non-overlapped blocks and embed secret data into their maximum/minimum pixels. However, the embedding capacity and overall performance is limited by block amount. Although we previously introduced an approach that overlaps blocks to enlarge the embedding capacity, the overlapping rate is still limited because the two-dimensional structure of the cover image, and approach rules are complicated. To address these problems, in this work, we propose to convert the cover image into a one-dimensional array. With the special one-dimensional characteristics, the steps to obtain overlapped sequences are simplified and the overlapping rate is also increased. Moreover, to generate a better distributed one-dimensional array, we also propose a deep neural network (DNN) based prediction method. Different from directly using DNN for prediction in existing methods, we use DNN to evaluate the suitability of pixels for using different classical predictors. Two thresholds are then determined to classify the pixels, allowing predictors to be used adaptively. Experiments demonstrate that the proposed prediction method achieves high prediction accuracy, and the proposed flexible strip moving mode also outstands state-of-the-art methods in overall embedding performance.

基于像素值排序（PVO）的可逆数据隐藏方法因其在嵌入容量和隐写图像保真度之间的有效平衡而受到研究者的广泛研究。传统的基于pvo的方法将封面图像划分为不重叠的块，并将秘密数据嵌入到最大/最小像素中。然而，嵌入容量和整体性能受到块数量的限制。虽然我们之前引入了一种通过块重叠来扩大嵌入容量的方法，但由于覆盖图像的二维结构和方法规则复杂，重叠率仍然有限。为了解决这些问题，在这项工作中，我们建议将封面图像转换为一维数组。利用特殊的一维特征，简化了获得重叠序列的步骤，提高了重叠率。此外，为了生成更好的分布式一维阵列，我们还提出了一种基于深度神经网络（DNN）的预测方法。与现有方法直接使用深度神经网络进行预测不同，我们使用深度神经网络来评估像素对不同经典预测器的适用性。然后确定两个阈值来对像素进行分类，允许自适应地使用预测器。实验表明，所提出的预测方法具有较高的预测精度，所提出的柔性条移动模式在整体嵌入性能上也优于现有方法。

{"title":"PVO-based reversible data hiding with flexible strip moving using classification-based adaptive prediction guided by CNN","authors":"Guojun Fan , Chen Zuo , Lei Lu , Zhihai Yang , Juan Zhao , Zhibin Pan","doi":"10.1016/j.jisa.2025.104368","DOIUrl":"10.1016/j.jisa.2025.104368","url":null,"abstract":"<div><div>Pixel-value-ordering (PVO) based reversible data hiding methods have been widely investigated by researchers because of their effective trade-off between embedding capacity and stego image fidelity. Conventional PVO-based methods divide the cover image into non-overlapped blocks and embed secret data into their maximum/minimum pixels. However, the embedding capacity and overall performance is limited by block amount. Although we previously introduced an approach that overlaps blocks to enlarge the embedding capacity, the overlapping rate is still limited because the two-dimensional structure of the cover image, and approach rules are complicated. To address these problems, in this work, we propose to convert the cover image into a one-dimensional array. With the special one-dimensional characteristics, the steps to obtain overlapped sequences are simplified and the overlapping rate is also increased. Moreover, to generate a better distributed one-dimensional array, we also propose a deep neural network (DNN) based prediction method. Different from directly using DNN for prediction in existing methods, we use DNN to evaluate the suitability of pixels for using different classical predictors. Two thresholds are then determined to classify the pixels, allowing predictors to be used adaptively. Experiments demonstrate that the proposed prediction method achieves high prediction accuracy, and the proposed flexible strip moving mode also outstands state-of-the-art methods in overall embedding performance.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"97 ","pages":"Article 104368"},"PeriodicalIF":3.7,"publicationDate":"2026-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145977327","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

V2G-RingChain: Blockchain-enabled linkable ring signature scheme for vehicle-to-grid security and privacy V2G-RingChain：支持区块链的可链接环签名方案，用于车辆到电网的安全和隐私

IF 3.7 2区计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

Journal of Information Security and Applications

Pub Date : 2026-01-10 DOI: 10.1016/j.jisa.2026.104371

Zhenqi Wang , Peng Yang , Dongmei Yang , Xiaoyan Liu , Hongmei Pei

Vehicle-to-Grid (V2G) technology enables electric vehicles to obtain power from the smart grid and supply electricity back during peak hours, and it is crucial for enhancing energy efficiency and reducing carbon emissions. However, attackers may steal sensitive information from electric vehicles through frequent charging and discharging transactions, or even forge such transactions to breach V2G security. Existing schemes mainly adopt ring signatures to achieve forgery resistance and privacy preservation for charging and discharging transactions, and extend them into multi-layer ring signature structures to support multi-input and multi-output transactions. Nevertheless, such schemes either cause the signature size and verification complexity to grow with the transaction scale, or rely on logarithmic compression proofs that introduce substantial system overhead, thereby limiting their practical applicability. To address this issue, we propose an efficient blockchain-enabled linkable ring signature scheme named V2G-RingChain. Specifically, we design an innovative multi-layer linkable ring signature protocol, which reconstructs the key images structure to reduce the computation time required for signing and combines Sum Arguments of Knowledge to control the signature size at a logarithmic level. Moreover, we construct a blockchain-enabled ring transaction mechanism to decouple anonymous electricity payments, blockchain verification, and bill extraction, which relies on Pedersen Commitments and Back-Maxwell RangeProof for hidden account amounts and non-negative judgment. Finally, we conduct a comprehensive security analysis demonstrating that our scheme ensures security and privacy. We conducted extensive experiments, and the results show that V2G-RingChain significantly reduces signature generation cost, verification cost, and communication cost compared with state-of-the-art schemes.

车辆到电网（V2G）技术使电动汽车能够从智能电网获取电力，并在高峰时段供电，对于提高能源效率和减少碳排放至关重要。然而，攻击者可能会通过频繁的充放电交易窃取电动汽车的敏感信息，甚至伪造此类交易，从而破坏V2G安全。现有方案主要采用环签名实现充放电交易的防伪造和隐私保护，并将其扩展为多层环签名结构，支持多输入多输出交易。然而，这些方案要么导致签名大小和验证复杂性随着交易规模的增长而增长，要么依赖于引入大量系统开销的对数压缩证明，从而限制了它们的实际适用性。为了解决这个问题，我们提出了一个高效的支持区块链的可链接环签名方案，名为V2G-RingChain。具体而言，我们设计了一种创新的多层可链接环签名协议，该协议通过重构密钥图像结构来减少签名所需的计算时间，并结合知识参数总和在对数水平上控制签名大小。此外，我们构建了一个支持区块链的环交易机制，以解耦匿名电力支付、区块链验证和账单提取，该机制依赖于Pedersen承诺和Back-Maxwell RangeProof来隐藏账户金额和非负面判断。最后，我们进行了全面的安全性分析，证明我们的方案保证了安全性和隐私性。我们进行了大量的实验，结果表明，与最先进的方案相比，V2G-RingChain显著降低了签名生成成本、验证成本和通信成本。

{"title":"V2G-RingChain: Blockchain-enabled linkable ring signature scheme for vehicle-to-grid security and privacy","authors":"Zhenqi Wang , Peng Yang , Dongmei Yang , Xiaoyan Liu , Hongmei Pei","doi":"10.1016/j.jisa.2026.104371","DOIUrl":"10.1016/j.jisa.2026.104371","url":null,"abstract":"<div><div>Vehicle-to-Grid (V2G) technology enables electric vehicles to obtain power from the smart grid and supply electricity back during peak hours, and it is crucial for enhancing energy efficiency and reducing carbon emissions. However, attackers may steal sensitive information from electric vehicles through frequent charging and discharging transactions, or even forge such transactions to breach V2G security. Existing schemes mainly adopt ring signatures to achieve forgery resistance and privacy preservation for charging and discharging transactions, and extend them into multi-layer ring signature structures to support multi-input and multi-output transactions. Nevertheless, such schemes either cause the signature size and verification complexity to grow with the transaction scale, or rely on logarithmic compression proofs that introduce substantial system overhead, thereby limiting their practical applicability. To address this issue, we propose an efficient blockchain-enabled linkable ring signature scheme named V2G-RingChain. Specifically, we design an innovative multi-layer linkable ring signature protocol, which reconstructs the key images structure to reduce the computation time required for signing and combines Sum Arguments of Knowledge to control the signature size at a logarithmic level. Moreover, we construct a blockchain-enabled ring transaction mechanism to decouple anonymous electricity payments, blockchain verification, and bill extraction, which relies on Pedersen Commitments and Back-Maxwell RangeProof for hidden account amounts and non-negative judgment. Finally, we conduct a comprehensive security analysis demonstrating that our scheme ensures security and privacy. We conducted extensive experiments, and the results show that V2G-RingChain significantly reduces signature generation cost, verification cost, and communication cost compared with state-of-the-art schemes.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"97 ","pages":"Article 104371"},"PeriodicalIF":3.7,"publicationDate":"2026-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145926038","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区计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

Journal of Information Security and Applications

Pub Date : 2026-01-09 DOI: 10.1016/j.jisa.2025.104360

Ferhat Arat , Aykut Karakaya , Sedat Akleylek

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.

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.

本文介绍了一篇全面的系统文献综述（SLR），重点介绍了基于图的物联网系统安全和风险评估方法，采用了全面的分类法。除了阐明物联网的基本原理和原则外，我们还提供了一个广泛的框架，特别强调图形物联网安全概念，有助于系统地组织信息。与现有的评论不同，我们的重点明确地指向使用图论进行安全评估。此外，除了其他理论和应用技术外，没有系统的文献综述专门使用图方法分析物联网系统的安全评估方法。目的是从各种研究问题的角度描述、综合和比较物联网的安全发展。据我们所知，这篇论文代表了第一个专注于基于图的风险和脆弱性评估的单反。SLR的主要目标是为研究人员提供一个全面的概述，以确定攻击图或基于攻击树的方法。我们从安全的角度描述了物联网范式，重点介绍了基于图形的技术检测到的各种类型的攻击。此外，我们在各种指标（如程序性能、运行时间、复杂性和其他算法开销）下，对为物联网设计的现有基于图的安全评估机制进行了比较分析。最后，我们揭示了在现有研究中尚未考虑和解决的开放性问题的问题和挑战。

{"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-01-09","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

MIE-SMC: Multiple images encryption scheme based on secure multiple-party computation MIE-SMC：基于安全多方计算的多图像加密方案

IF 3.7 2区计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

Journal of Information Security and Applications

Pub Date : 2026-01-09 DOI: 10.1016/j.jisa.2025.104366

Meng Li , Haojie Li , Xiaozeng Xu , Huanhuan Wang

The protection of privacy for images uploaded to the Internet platform has attracted increasing public concern. As a popular protection technology, multiple-images encryption (MIE) has been widely explored in academic and practical applications. However, existing schemes rarely consider secure key management and selective image decryption. To this end, we propose a multi-user-oriented MIE framework, which achieves selective decryption and enhances key security management. Firstly, we design a novel computing protocol (PCP-UI) based on secure multiple-party computation (SMC). All users obtain the share key without relying on network transmission. Based on PCP-UI, we propose a multiple-stages encryption scheme including pre-encryption, joint encryption, and exclusive encryption. The pre-encrypted results are confused into the joint ciphertext, which is served as the public key to re-encrypt the images. Compared with many other MIE schemes, our scheme achieves permission control for each image and prevents privacy leakage caused by a single key. In addition, the shared key can be obtained via PCP-UI, thus avoiding leakage risk of keys caused by network transmission. To test the encryption performance, various classic attacks analysis and experiments are conducted to demonstrate the effectiveness of our scheme.

上传到互联网平台的图片的隐私保护已经引起了越来越多的公众关注。作为一种流行的保护技术，多图像加密技术在学术和实际应用中得到了广泛的探索。然而，现有方案很少考虑安全密钥管理和选择性图像解密。为此，我们提出了一个面向多用户的MIE框架，实现了选择性解密，增强了密钥安全管理。首先，我们设计了一种基于安全多方计算（SMC）的新型计算协议（PCP-UI）。所有用户获得共享密钥，不依赖网络传输。基于PCP-UI，提出了一种多级加密方案，包括预加密、联合加密和独占加密。将预加密的结果混合成联合密文，作为对图像进行重新加密的公钥。与许多其他MIE方案相比，我们的方案实现了对每个图像的权限控制，防止了单个密钥导致的隐私泄露。另外，共享密钥可以通过PCP-UI获取，避免了网络传输导致密钥泄露的风险。为了测试加密性能，对各种经典攻击进行了分析和实验，以验证该方案的有效性。

{"title":"MIE-SMC: Multiple images encryption scheme based on secure multiple-party computation","authors":"Meng Li , Haojie Li , Xiaozeng Xu , Huanhuan Wang","doi":"10.1016/j.jisa.2025.104366","DOIUrl":"10.1016/j.jisa.2025.104366","url":null,"abstract":"<div><div>The protection of privacy for images uploaded to the Internet platform has attracted increasing public concern. As a popular protection technology, multiple-images encryption (MIE) has been widely explored in academic and practical applications. However, existing schemes rarely consider secure key management and selective image decryption. To this end, we propose a multi-user-oriented MIE framework, which achieves selective decryption and enhances key security management. Firstly, we design a novel computing protocol (PCP-UI) based on secure multiple-party computation (SMC). All users obtain the share key without relying on network transmission. Based on PCP-UI, we propose a multiple-stages encryption scheme including pre-encryption, joint encryption, and exclusive encryption. The pre-encrypted results are confused into the joint ciphertext, which is served as the public key to re-encrypt the images. Compared with many other MIE schemes, our scheme achieves permission control for each image and prevents privacy leakage caused by a single key. In addition, the shared key can be obtained via PCP-UI, thus avoiding leakage risk of keys caused by network transmission. To test the encryption performance, various classic attacks analysis and experiments are conducted to demonstrate the effectiveness of our scheme.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"97 ","pages":"Article 104366"},"PeriodicalIF":3.7,"publicationDate":"2026-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145926055","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