Cybersecurity最新文献_第5页

A survey on lattice-based digital signature 基于网格的数字签名调查

IF 3.1 4区计算机科学

Cybersecurity Pub Date : 2024-04-01 DOI: 10.1186/s42400-023-00198-1

Fengxia Liu, Zhiyong Zheng, Zixian Gong, Kun Tian, Yi Zhang, Zhe Hu, Jia Li, Qun Xu

引用次数: 0

Shorter ZK-SNARKs from square span programs over ideal lattices 来自理想网格上平方跨度程序的更短 ZK-SNARKs

IF 3.1 4区计算机科学

Cybersecurity Pub Date : 2024-03-19 DOI: 10.1186/s42400-024-00215-x

Xi Lin, Heyang Cao, Feng-Hao Liu, Zhedong Wang, Mingsheng Wang

{"title":"Shorter ZK-SNARKs from square span programs over ideal lattices","authors":"Xi Lin, Heyang Cao, Feng-Hao Liu, Zhedong Wang, Mingsheng Wang","doi":"10.1186/s42400-024-00215-x","DOIUrl":"https://doi.org/10.1186/s42400-024-00215-x","url":null,"abstract":"Zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) are cryptographic protocols that offer efficient and privacy-preserving means of verifying NP language relations and have drawn considerable attention for their appealing applications, e.g., verifiable computation and anonymous payment protocol. Compared with the pre-quantum case, the practicability of this primitive in the post-quantum setting is still unsatisfactory, especially for the space complexity. To tackle this issue, this work seeks to enhance the efficiency and compactness of lattice-based zk-SNARKs, including proof length and common reference string (CRS) length. In this paper, we develop the framework of square span program-based SNARKs and design new zk-SNARKs over cyclotomic rings. Compared with previous works, our construction is without parallel repetition and achieves shorter proof and CRS lengths than previous lattice-based zk-SNARK schemes. Particularly, the proof length of our scheme is around (23.3%) smaller than the recent shortest lattice-based zk-SNARKs by Ishai et al. (in: Proceedings of the 2021 ACM SIGSAC conference on computer and communications security, pp 212–234, 2021), and the CRS length is (3.6times) smaller. Our constructions follow the framework of Gennaro et al. (in: Proceedings of the 2018 ACM SIGSAC conference on computer and communications security, pp 556–573, 2018), and adapt it to the ring setting by slightly modifying the knowledge assumptions. We develop concretely small constructions by using module-switching and key-switching procedures in a novel way.","PeriodicalId":36402,"journal":{"name":"Cybersecurity","volume":"117 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140169953","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Revocable and verifiable weighted attribute-based encryption with collaborative access for electronic health record in cloud 可撤销和可验证的基于加权属性的加密与云端电子健康记录的协作访问

IF 3.1 4区计算机科学

Cybersecurity Pub Date : 2024-03-03 DOI: 10.1186/s42400-024-00211-1

Ximing Li, Hao Wang, Sha Ma, Meiyan Xiao, Qiong Huang

{"title":"Revocable and verifiable weighted attribute-based encryption with collaborative access for electronic health record in cloud","authors":"Ximing Li, Hao Wang, Sha Ma, Meiyan Xiao, Qiong Huang","doi":"10.1186/s42400-024-00211-1","DOIUrl":"https://doi.org/10.1186/s42400-024-00211-1","url":null,"abstract":"The encryption of user data is crucial when employing electronic health record services to guarantee the security of the data stored on cloud servers. Attribute-based encryption (ABE) scheme is considered a powerful encryption technique that offers flexible and fine-grained access control capabilities. Further, the multi-user collaborative access ABE scheme additionally supports users to acquire access authorization through collaborative works. However, the existing multi-user collaborative access ABE schemes do not consider the different weights of collaboration users. Therefore, using these schemes for weighted multi-user collaborative access results in redundant attributes, which inevitably reduces the efficiency of the ABE scheme. This paper proposes a revocable and verifiable weighted attribute-based encryption with collaborative access scheme (RVWABE-CA), which can provide efficient weighted multi-user collaborative access, user revocation, and data integrity verification, as the fundamental cornerstone for establishing a robust framework to facilitate secure sharing of electronic health records in a public cloud environment. In detail, this scheme employs a novel weighted access tree to eliminate redundant attributes, utilizes encryption version information to control user revocation, and establishes Merkle Hash Tree for data integrity verification. We prove that our scheme is resistant against chosen plaintext attack. The experimental results demonstrate that our scheme has significant computational efficiency advantages compared to related works, without increasing storage or communication overhead. Therefore, the RVWABE-CA scheme can provide an efficient and flexible weighted collaborative access control and user revocation mechanism as well as data integrity verification for electronic health record systems.","PeriodicalId":36402,"journal":{"name":"Cybersecurity","volume":"268 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140037723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Maxwell’s Demon in MLP-Mixer: towards transferable adversarial attacks MLP-Mixer 中的麦克斯韦恶魔：实现可转移的对抗性攻击

IF 3.1 4区计算机科学

Cybersecurity Pub Date : 2024-03-02 DOI: 10.1186/s42400-023-00196-3

Haoran Lyu, Yajie Wang, Yu-an Tan, Huipeng Zhou, Yuhang Zhao, Quanxin Zhang

{"title":"Maxwell’s Demon in MLP-Mixer: towards transferable adversarial attacks","authors":"Haoran Lyu, Yajie Wang, Yu-an Tan, Huipeng Zhou, Yuhang Zhao, Quanxin Zhang","doi":"10.1186/s42400-023-00196-3","DOIUrl":"https://doi.org/10.1186/s42400-023-00196-3","url":null,"abstract":"Models based on MLP-Mixer architecture are becoming popular, but they still suffer from adversarial examples. Although it has been shown that MLP-Mixer is more robust to adversarial attacks compared to convolutional neural networks (CNNs), there has been no research on adversarial attacks tailored to its architecture. In this paper, we fill this gap. We propose a dedicated attack framework called Maxwell’s demon Attack (MA). Specifically, we break the channel-mixing and token-mixing mechanisms of the MLP-Mixer by perturbing inputs of each Mixer layer to achieve high transferability. We demonstrate that disrupting the MLP-Mixer’s capture of the main information of images by masking its inputs can generate adversarial examples with cross-architectural transferability. Extensive evaluations show the effectiveness and superior performance of MA. Perturbations generated based on masked inputs obtain a higher success rate of black-box attacks than existing transfer attacks. Moreover, our approach can be easily combined with existing methods to improve the transferability both within MLP-Mixer based models and to models with different architectures. We achieve up to 55.9% attack performance improvement. Our work exploits the true generalization potential of the MLP-Mixer adversarial space and helps make it more robust for future deployments.","PeriodicalId":36402,"journal":{"name":"Cybersecurity","volume":"50 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140019184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Practical solutions in fully homomorphic encryption: a survey analyzing existing acceleration methods 全同态加密的实用解决方案：现有加速方法调查分析

IF 3.1 4区计算机科学

Cybersecurity Pub Date : 2024-03-01 DOI: 10.1186/s42400-023-00187-4

Yanwei Gong, Xiaolin Chang, Jelena Mišić, Vojislav B. Mišić, Jianhua Wang, Haoran Zhu

{"title":"Practical solutions in fully homomorphic encryption: a survey analyzing existing acceleration methods","authors":"Yanwei Gong, Xiaolin Chang, Jelena Mišić, Vojislav B. Mišić, Jianhua Wang, Haoran Zhu","doi":"10.1186/s42400-023-00187-4","DOIUrl":"https://doi.org/10.1186/s42400-023-00187-4","url":null,"abstract":"Fully homomorphic encryption (FHE) has experienced significant development and continuous breakthroughs in theory, enabling its widespread application in various fields, like outsourcing computation and secure multi-party computing, in order to preserve privacy. Nonetheless, the application of FHE is constrained by its substantial computing overhead and storage cost. Researchers have proposed practical acceleration solutions to address these issues. This paper aims to provide a comprehensive survey for systematically comparing and analyzing the strengths and weaknesses of FHE acceleration schemes, which is currently lacking in the literature. The relevant researches conducted between 2019 and 2022 are investigated. We first provide a comprehensive summary of the latest research findings on accelerating FHE, aiming to offer valuable insights for researchers interested in FHE acceleration. Secondly, we classify existing acceleration schemes from algorithmic and hardware perspectives. We also propose evaluation metrics and conduct a detailed comparison of various methods. Finally, our study presents the future research directions of FHE acceleration, and also offers both guidance and support for practical application and theoretical research in this field.","PeriodicalId":36402,"journal":{"name":"Cybersecurity","volume":"29 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140019153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A circuit area optimization of MK-3 S-box 优化 MK-3 S-box 的电路面积

IF 3.1 4区计算机科学

Cybersecurity Pub Date : 2024-02-03 DOI: 10.1186/s42400-024-00207-x

Yanjun Li, Weiguo Zhang, Yiping Lin, Jian Zou, Jian Liu

{"title":"A circuit area optimization of MK-3 S-box","authors":"Yanjun Li, Weiguo Zhang, Yiping Lin, Jian Zou, Jian Liu","doi":"10.1186/s42400-024-00207-x","DOIUrl":"https://doi.org/10.1186/s42400-024-00207-x","url":null,"abstract":"In MILCOM 2015, Kelly et al. proposed the authentication encryption algorithm MK-3, which applied the 16-bit S-box. This paper aims to implement the 16-bit S-box with less circuit area. First, we classified the irreducible polynomials over (mathbb {F}_{2^n}) into three kinds. Then we compared the logic gates required for multiplication over the finite field constructed by the three types of irreducible polynomials. According to the comparison result, we constructed the composite fields, (mathbb {F}_{(2^4)^2}) and (mathbb {F}_{(2^8)^2}). Based on the isomorphism of finite fields, the operations over (mathbb {F}_{2^{16}}) can be conducted over (mathbb {F}_{(2^8)^2}). Similarly, elements over (mathbb {F}_{2^8}) can be mapped to the corresponding elements over (mathbb {F}_{(2^4)^2}). Next, the SAT solver was used to optimize the operations over smaller field (mathbb {F}_{2^4}). At last, the architecture of the optimized MK-3 S-box was worked out. Compared with the implementation proposed by the original designer, the circuit area of the MK-3 S-box in this paper is reduced by at least 55.9%.","PeriodicalId":36402,"journal":{"name":"Cybersecurity","volume":"18 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139677911","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Intrusion detection system for controller area network 控制器区域网络入侵检测系统

IF 3.1 4区计算机科学

Cybersecurity Pub Date : 2024-02-02 DOI: 10.1186/s42400-023-00195-4

Vinayak Tanksale

{"title":"Intrusion detection system for controller area network","authors":"Vinayak Tanksale","doi":"10.1186/s42400-023-00195-4","DOIUrl":"https://doi.org/10.1186/s42400-023-00195-4","url":null,"abstract":"The rapid expansion of intra-vehicle networks has increased the number of threats to such networks. Most modern vehicles implement various physical and data-link layer technologies. Vehicles are becoming increasingly autonomous and connected. Controller area network (CAN) is a serial bus system that is used to connect sensors and controllers (electronic control units—ECUs) within a vehicle. ECUs vary widely in processing power, storage, memory, and connectivity. The goal of this research is to design, implement, and test an efficient and effective intrusion detection system for intra-vehicle CANs. Classic cryptographic approaches are resource-intensive and increase processing delay, thereby not meeting CAN latency requirements. There is a need for a system that is capable of detecting intrusions in almost real-time with minimal resources. Our research proposes a long short-term memory (LSTM) network to detect anomalies and a decision engine to detect intrusions by using multiple contextual parameters. We have tested our anomaly detection algorithm and our decision engine using data from real automobiles. We present the results of our experiments and analyze our findings. After detailed evaluation of our system, we believe that we have designed a vehicle security solution that meets all the outlined requirements and goals.","PeriodicalId":36402,"journal":{"name":"Cybersecurity","volume":"21 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139666058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

CT-GCN+: a high-performance cryptocurrency transaction graph convolutional model for phishing node classification CT-GCN+：用于网络钓鱼节点分类的高性能加密货币交易图卷积模型

IF 3.1 4区计算机科学

Cybersecurity Pub Date : 2024-02-01 DOI: 10.1186/s42400-023-00194-5

Bingxue Fu, Yixuan Wang, Tao Feng

{"title":"CT-GCN+: a high-performance cryptocurrency transaction graph convolutional model for phishing node classification","authors":"Bingxue Fu, Yixuan Wang, Tao Feng","doi":"10.1186/s42400-023-00194-5","DOIUrl":"https://doi.org/10.1186/s42400-023-00194-5","url":null,"abstract":"Due to the anonymous and contract transfer nature of blockchain cryptocurrencies, they are susceptible to fraudulent incidents such as phishing. This poses a threat to the property security of users and hinders the healthy development of the entire blockchain community. While numerous studies have been conducted on identifying cryptocurrency phishing users, there is a lack of research that integrates class imbalance and transaction time characteristics. This paper introduces a novel graph neural network-based account identification model called CT-GCN+, which utilizes blockchain cryptocurrency phishing data. It incorporates an imbalanced data processing module for graphs to consider cryptocurrency transaction time. The model initially extracts time characteristics from the transaction graph using LSTM and Attention mechanisms. These time characteristics are then fused with underlying features, which are subsequently inputted into a combined SMOTE and GCN model for phishing user classification. Experimental results demonstrate that the CT-GCN+ model achieves a phishing user identification accuracy of 97.22% and a phishing user identification area under the curve of 96.67%. This paper presents a valuable approach to phishing detection research within the blockchain and cryptocurrency ecosystems.","PeriodicalId":36402,"journal":{"name":"Cybersecurity","volume":"22 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139666184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Enhanced detection of obfuscated malware in memory dumps: a machine learning approach for advanced cybersecurity 增强对内存转储中混淆恶意软件的检测：先进网络安全的机器学习方法

IF 3.1 4区计算机科学

Cybersecurity Pub Date : 2024-01-25 DOI: 10.1186/s42400-024-00205-z

Md. Alamgir Hossain, Md. Saiful Islam

{"title":"Enhanced detection of obfuscated malware in memory dumps: a machine learning approach for advanced cybersecurity","authors":"Md. Alamgir Hossain, Md. Saiful Islam","doi":"10.1186/s42400-024-00205-z","DOIUrl":"https://doi.org/10.1186/s42400-024-00205-z","url":null,"abstract":"In the realm of cybersecurity, the detection and analysis of obfuscated malware remain a critical challenge, especially in the context of memory dumps. This research paper presents a novel machine learning-based framework designed to enhance the detection and analytical capabilities against such elusive threats for binary and multi type’s malware. Our approach leverages a comprehensive dataset comprising benign and malicious memory dumps, encompassing a wide array of obfuscated malware types including Spyware, Ransomware, and Trojan Horses with their sub-categories. We begin by employing rigorous data preprocessing methods, including the normalization of memory dumps and encoding of categorical data. To tackle the issue of class imbalance, a Synthetic Minority Over-sampling Technique is utilized, ensuring a balanced representation of various malware types. Feature selection is meticulously conducted through Chi-Square tests, mutual information, and correlation analyses, refining the model’s focus on the most indicative attributes of obfuscated malware. The heart of our framework lies in the deployment of an Ensemble-based Classifier, chosen for its robustness and effectiveness in handling complex data structures. The model’s performance is rigorously evaluated using a suite of metrics, including accuracy, precision, recall, F1-score, and the area under the ROC curve (AUC) with other evaluation metrics to assess the model’s efficiency. The proposed model demonstrates a detection accuracy exceeding 99% across all cases, surpassing the performance of all existing models in the realm of malware detection.","PeriodicalId":36402,"journal":{"name":"Cybersecurity","volume":"16 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139558367","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

BRITD: behavior rhythm insider threat detection with time awareness and user adaptation BRITD：具有时间感知和用户适应性的行为节奏内部威胁检测

IF 3.1 4区计算机科学

Cybersecurity Pub Date : 2024-01-02 DOI: 10.1186/s42400-023-00190-9

{"title":"BRITD: behavior rhythm insider threat detection with time awareness and user adaptation","authors":"","doi":"10.1186/s42400-023-00190-9","DOIUrl":"https://doi.org/10.1186/s42400-023-00190-9","url":null,"abstract":"<h3>Abstract</h3> Researchers usually detect insider threats by analyzing user behavior. The time information of user behavior is an important concern in internal threat detection. Existing works on insider threat detection fail to make full use of the time information, which leads to their poor detection performance. In this paper, we propose a novel behavioral feature extraction scheme: we implicitly encode absolute time information in the behavioral feature sequences and use a feature sequence construction method taking covariance into account to make our scheme adaptive to users. We select Stacked Bidirectional LSTM and Feedforward Neural Network to build a deep learning-based insider threat detection model: Behavior Rhythm Insider Threat Detection (BRITD). BRITD is universally applicable to various insider threat scenarios, and it has good insider threat detection performance: it achieves an AUC of 0.9730 and a precision of 0.8072 with the CMU CERT dataset, which exceeds all baselines. <h3>Graphical Abstract</h3> <img alt=\"\" src=\"https://static-content.springer.com/image/MediaObjects/42400_2023_190_Figa_HTML.png\"/> ","PeriodicalId":36402,"journal":{"name":"Cybersecurity","volume":"52 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139079846","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0