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

25th IEEE International Conference on computer Supported Cooperative Work in Design, CSCWD 2022

作者： Zhai, Haibin Wang, Yong Zou, Xueqiang Wu, Yihan Chen, Songyue Wu, Hongwei Zheng, Yanqin National Computer Network Emergency Response Technical Team Coordination Center of China Beijing China Institute of Information Engineering Chinese Academy of Science Beijing China School of Cybersecurity University of Chinese Academy of Science Beijing China National Engineering Laboratory of Information Security Technologies Beijing China

ISBN: (纸本)9781665405270

Masquerade detection has always been a vital detection capacity in intrusion detection, and shell command detection plays an important role in masquerade detection. Shell command detection is used to detect the system commands and judge whether the commands are from the masquerader or not to protect the safety of the whole system. However, it is challenging to classify the masquerader commands because of the difference between common text classification and shell command detection. The paper presents a machine learning model to masquerade detection using a Temporal Convolutional network, a deep learning neural network for temporal anomaly detection. We believe masquerader commands are highly related to the time series. We prove that our model has a better effect on the SEA dataset than the deep neural network, convolutional neural network, and LSTM in various model metrics. © 2022 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Efficient Registered Attribute Based Access Control with Same Sub-policies in Mobile Cloud Computing

引用

IEEE Transactions on Mobile Computing 2025年

作者： Weng, Wuwei Li, Jiguo Zhang, Yichen Lu, Yang Shen, Jian Han, Jinguang Fujian Normal University College of Computer and Cyber Security Fuzhou350117 China Fujian Fuzhou350117 China Fujian Provincial Key Laboratory of Network Security and Cryptology Fuzhou350117 China Nanjing Normal University School of Computer and Electronic Information Nanjing210023 China Zhejiang Sci-Tech University School of Information Science and Engineering Hangzhou310018 China Southeast University School of Cyber Science and Engineering Nanjing210096 China

Ciphertext-policy attribute-based encryption (CP-ABE) has long been considered as a promising access control technology for cloud storage. However, CP-ABE depends on a central trusted authority to generate and distribute decryption keys, resulting in the key escrow issue. Most existing solutions only mitigate this problem but fail to resolve it entirely. Registered attribute-based encryption (RABE), a new cryptographic primitive, fundamentally addresses the key escrow problem by modifying the trust model, but its high computational overhead limits its practical application. Inspired by this challenge, we present an efficient registered attribute-based access control scheme designed for data encrypted with access policies containing the same sub-policy. In our scheme, users generate their own keys, while a key manager, who does not hold keys, replaces the central authority in managing users. Additionally, for data encrypted with the same sub-policy, the user's initial decryption stores the relevant parameters, which can be used for subsequent decryptions to reduce computational overhead. The proposed scheme is proven to achieve semantic security. Performance analysis demonstrates that our scheme enhances decryption efficiency by roughly 41.4% compared to existing RABE scheme, with a minimal storage trade-off, making it more practical for cloud storage application. © 2002-2012 IEEE.

关键词： Ciphertext

来源：评论

学校读者我要写书评

暂无评论

Formal Modeling and Defense Methods for 5G network Endpoint Access Denial of Service Attacks

Formal Modeling and Defense Methods for 5G Network Endpoint ...

引用

International Conference on networking and network Applications (NaNA)

作者： Tong Zhang Wei Wei Yichuan Wang Xi Deng Lei Zhu Wenjiang Ji School of Computer Science and Engineering Xi'an University of Technology Xi'an China Shaanxi Key Laboratory for Network Computing and Security Technolog Xi'an China School of Computer Science Xi'an Shiyou University Xi'an China

5G terminal access denial-of-service attack is one of the more common types of 5G signaling network attacks. It manifests itself as a large number of abnormal access requests occupying core network resources. Normal requests cannot obtain resources, resulting in unstable network services, and users will be unable to connect or drop connections, eventually leading to frequent terminal takeoffs and landings. This paper proposes a formal modeling scheme for a 5G terminal access denial-of-service attack. The attack principle is analyzed, a defense scheme is designed and modeled, and analyzed, and then quantitative experiments are conducted, and the experimental results show the effectiveness of the defense scheme.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Covert Communication in Satellite-Terrestrial Systems with a Full-Duplex Receiver

Covert Communication in Satellite-Terrestrial Systems with a...

引用

2024 International Conference on Satellite Internet, SAT-NET 2024

作者： Guo, Zewei Sun, Ranran He, Ji Shen, Yulong Jiang, Xiaohong Future University Hakodate School of Systems Information Science Hakodate041-8655 Japan Hangzhou Institute of Technology Xidian University Hangzhou311200 China Xidian University School of Computer Science and Technology Xi'an710071 China Institute of Systems General Academy of Systems Engineering Academy of Military Sciences Beijing100101 China Xidian University Shaanxi Key Laboratory of Network and System Security Xi'an710071 China

ISBN: (纸本)9798350375176

This paper investigates the covert communication in a satellite-terrestrial system, including a satellite transmitter Alice, a terrestrial full-duplex receiver Bob and a terrestrial warden Willie. To help the covert transmission from Alice, the full-duplex Bob transmits the jamming signal to confuse Willie and also receives the signal from Alice simultaneously. To explore the fundamental covertness in such a system, we first provide theoretical modelings for satellite-terrestrial downlink, and the detection error probability of Willie. Based on these models, we then study the transmit power optimization for covert rate maximization. Finally, we present extensive numerical results to validate our theoretical analysis and to illustrate the impact of various system parameters on the maximum covert rate. © 2024 IEEE.

关键词： Satellite communication systems

来源：评论

学校读者我要写书评

暂无评论

Establishing Multi-Party Trust Architecture for DRM by Using Game-Theoretic Analysis of security Policies

引用

Chinese Journal of Electronics 2023年第3期18卷 519-524页

作者： Zhiyong Zhang Qingqi Pei Jianfeng Ma Lin Yang Ministry of Education Key Laboratory of Computer Network and Information Security Xidian University Xi'an China Electronic and Information Engineering College Henan University of Science and Technology Luoyang China The Research Institute China Electronic Equipment and Systems Engineering Corporation Beijing China

A successful transaction of digital contents is primarily dependent on security policies, trust mechanisms and benefits balances, as well as the simple adoption of the combination of enhanced security policies would not effectively establish a trust relationship among various stakeholders in the DRM (Digital rights management)-enabling contents value chain. With respect to a generic DRM ecosystem, the hierarchy analyses of the multi-participant trust architecture were proposed based on the game-theoretic adoptions of security policies. By using formalized definitions of security components and services' utilities, we presented the choice of policies with the external relativity, in the contents acquisition scenario, as a multi-player simultaneous-move game referred to contents provider, digital services/rights provider and consumer. Also, in term of security policies combinations' utilities and benefit effects on participants, we further gained the game's Nash Equilibrium, which is a stable profile of security policies achieving the optimal balance of the security and utilities, thus establishing and strengthening the multi-party trust. The analytic conclusions show that enhanced security policies profile does not necessarily achieve optimal benefits balance in the one-stage game, for a small quantity of digital contents transactions. Whereas, the profile could transform into Nash Equilibrium with the increase of transaction sessions, meanwhile being Pareto Optimality.

关键词： Ecosystems Games computer architecture Transforms Copyright protection Nash equilibrium security

来源：评论

学校读者我要写书评

暂无评论

Provably Secure Authenticated Key-Management Mechanism for e-Healthcare Environment

引用

IEEE Internet of Things Journal 2025年

作者： Saleem, Muhammad Asad Li, Xiong Mahmood, Khalid Ghaffar, Zahid Xie, Yong Wang, Guijuan University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan National Yunlin University of Science and Technology Graduate School of Engineering Science and Technology Douliu64002 Taiwan Qinghai Institute of Technology School of Computer and Information Science China Qinghai Provincial Laboratory for Intelligent Computing and Application China Key Laboratory of Computing Power Network and Information Security Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security China Shandong Fundamental Research Center for Computer Science Jinan250353 China

The Internet of Things (IoT) is rapidly permeating all aspects of human life, involving a network of devices that share sensitive data. A notable application is the e-healthcare systems, which employ connected sensors, medical servers, and wearable devices. However, the public nature of communication in e-healthcare systems poses challenges such as security, privacy, and authentication of participating entities. Recently, many authentication protocols have been introduced to address these challenges. However, most of these protocols remain vulnerable to various security attacks, including device or medical server impersonation, denial of service, physical or cloning, and de-synchronization attacks. Therefore, we introduce an authenticated key-management protocol utilizing hash functions and Cipher-Block Chaining-Advanced Encryption Standard encryption (CBC-AES) encryption. The proposed protocol also employs the Physical Unclonable Function (PUF), which makes it more robust and efficient in resisting physical or cloning attacks. Additionally, the proposed scheme resists various security threats, including impersonation, session key leakage, ephemeral secret leakage, and de-synchronization attacks. We analyze the scheme’s security and reliability through formal and informal analysis. The informal analysis demonstrates that the scheme encompasses crucial security features, while the formal analysis substantiates. Moreover, performance analysis of the proposed protocol with various competing results indicates that our protocol achieves an average reduction in communication and computation overheads by 36.03.% and 41.79%, respectively. © 2014 IEEE.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

Signature Scheme Based on The SM2 Algorithm in Fabric

Signature Scheme Based on The SM2 Algorithm in Fabric

引用

2021 International Conference on networking and network Applications, NaNA 2021

作者： Zhang, Yaling Wang, Hongyun Wang, Yichuan Ji, Wenjiang Zhu, Lei Xi'an University of technology School of computer science and engineering Xi'an China Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an University of technology Xi'an China

ISBN: (纸本)9781665441582

Based on the analysis and research of the widely used Hyperledger Fabric alliance chain structure, this paper proposes a digital signature scheme based on the national cryptographic algorithm SM2 which can be applied to Hyperledger Fabric. Firstly, two elliptic curve public-key cryptography algorithms are analyzed, and the feasibility of the SM2 in Fabric system is studied. Secondly, the Fabric system using the SM2 algorithm is designed and implemented, and the generation process of the Fabric chain address using the SM2 algorithm is given. Finally, experimental verification of the availability and performance of the Fabric system after the replacement of national cryptography algorithms is carried out. The experimental results show that the SM2 interface of the new Fabric alliance chain has good usability, and the average latency is reduced by 51.8%, and the transaction throughput is increased by 33.1%. © 2021 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

A Revocable Pairing-Free Certificateless Signature Scheme Based on RSA Accumulator

A Revocable Pairing-Free Certificateless Signature Scheme Ba...

引用

IEEE International Conference on Trust, security and Privacy in Computing and Communications (TrustCom)

作者： Zhuowei Shen Xiao Kou Taiyao Yang Haoqin Xu Dongbin Wang Shaobo Niu School of Cyber Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Intergration Minster of Education Nanjing China School of Cyberspace Security Beijing University of Post and Telecommunications Beijing China Engineering Research Center of Blockchain and Network Convergence Technology Ministry of Education Beijing China

ISBN: (数字)9798331506209

ISBN: (纸本)9798331506216

Certificateless public key cryptography (CL-PKC) has garnered significant attention in recent years due to its ability to address the complex certificate management requirements inherent in public key infrastructure (PKI) systems and the key escrow issue associated with identity-based cryptography (IBC). However, the efficient revocation of illegitimate users in authentication schemes based on CL-PKC remains a challenge. Moreover, certain schemes still exhibit security vulnerabilities, such as susceptibility to key replacement attacks, and also require performance enhancements. In this article, we propose a novel certificateless signature scheme that incorporates the RSA accumulator. By leveraging the witness in the RSA accumulator to produce the public keys of users, the authenticity of the public key can be efficiently verified, thereby eliminating key replacement attacks. Additionally, by removing specific elements from the RSA accumulator and broadcasting the update credential to legitimate users via a public channel, our proposed scheme allows the effective revocation of malicious users. security analysis and performance evaluations indicate that our scheme provides comprehensive security and achieves high performance in terms of computational and communication costs in both signingverification and revocation processes.

关键词： Performance evaluation Privacy Costs Identity-based encryption Authentication Broadcasting Forgery Encryption security Digital signatures

来源：评论

学校读者我要写书评

暂无评论

$k$k-TEVS: A $ k$k-Times E-Voting Scheme on Blockchain With Supervision

引用

IEEE Transactions on Dependable and Secure Computing 2024年第3期22卷 2326-2337页

作者： Yang Liu Debiao He Min Luo Lianhai Wang Cong Peng School of Cyber Science and Engineering Wuhan University Wuhan China Institute of Information Technology Shenzhen Institute of Information Technology Shenzhen China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shanghai Technology Innovation Centre of Distributed Privacy-Preserving Artificial Intelligence Matrix Elements Technologies Shanghai China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

The e-vote is regarded as a way to express the opinion that the voters ask for. Actually, the e-vote could be applied wildly like questionnaire, survey and feedback. Moreover, the coexistences of efficiency and security as well as transparency and privacy could be considered as building blocks in the e-vote system. The blockchain could provide a public access board to reduce the storage costs for the field consisted of the vote group manager (GM) with its vote assistants (VA). Particularly the $k$ -times anonymous authentication ( $k$ -TAA) could also be a practical approach to preserve voters’ privacy and reduce the computation costs during the vote process. However, the e-vote scheme with pure $k$ -TAA strategy could damage either the supervision of voting or the efficiency and consistency of authentication process. What’s more, the impacts of dishonest voters couldn’t be stopped until the vote end. To tackle these problems, we apply the accumulator technology to add or revoke the voters at any time and extend the framework of $k$ -TAA with the update process for the e-vote on blockchain for supervision ( $ k$ -TEVS). In our scheme, the voter updates his membership witness and proves the fact that he is still a valid member with respective VA under the latest accumulator value. What’s more, this witness update operation is not contained in the authentication process, which means that the authentication process is still constant and efficient. Moreover, our add or delete update process with signature of knowledge needs only one pairing operation. For the security, we prove that the relaxed anonymity still holds in the $ k$ -TEVS framework. Finally, We implement $ k$ -TEVS scheme, the Emura’s work [1] and the Huang’s work [2] for comparison. Then we make time cost and communication cost experiments, which present the feasibility and practicality of this scheme.

关键词： Blockchains Authentication Costs Protocols security Privacy Surveys Electronic voting computer science Information security

来源：评论

学校读者我要写书评

暂无评论

DHD: Double Hard Decision Decoding Scheme for NAND Flash Memory

DHD: Double Hard Decision Decoding Scheme for NAND Flash Mem...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Lanlan Cui Yichuan Wang Renzhi Xiao Miao Li Xiaoxue Liu Xinhong Hei School of Computer Science and Engineering XI'AN University of Technology Xi'an China Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an China School of Software Engineering Jiangxi University of Science and Technology Nanchang China School of Information Engineering Zhongnan University of Economics and Law Wuhan China

ISBN: (数字)9783982674100

ISBN: (纸本)9798331534646

With the advancement of NAND flash technology, the increased storage density leads to intensified interference, which in turn raises the error rate during data retrieval. To ensure data reliability, low-density parity-check (LDPC) codes are extensively employed for error correction in NAND flash memory. Although LDPC soft decision decoding offers high error correction capability, it comes with a significant latency. Conversely, hard-decision decoding, although faster, lacks sufficient error correction strength. Consequently, flash memory typically initiates with hard-decision decoding and resorts to multiple soft decision decoding upon failure. To minimize decoding latency, this paper proposes a decoding mechanism based on the double hard decision, called DHD. This DHD scheme improves the Log-Likelihood Ratio (LLR) in the hard decision process. After the first hard decision fails, the read reference voltage (RRV) is adjusted to perform the second hard decision decoding. If the second hard decision also fails, soft decision decoding is then employed. Experimental results demonstrate that when the Raw Bit Error Rate (RBER) is $8.5 \times 10^{-3}$ , DHD reduces the Frame Error Rate (FER) by 86.4% compared to the traditional method.

关键词： Lead acid batteries Europe Voltage Interference Decoding Error correction Error correction codes Reliability Flash memories Iterative decoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：