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

Anonymity-Enhanced Sequential Multi-Signer Ring Signature for Secure Medical Data Sharing in IoMT

IEEE Transactions on information Forensics and security 2025年 20卷 5647-5662页

作者： Gang Xu Xinyu Fan Shiyuan Xu Yibo Cao Xiu-Bo Chen Tao Shang Shui Yu School of Artificial Intelligence and Computer Science North China University of Technology Beijing China Information Security Center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Department of Computer Science The University of Hong Kong Pokfulam Hong Kong School of Cyber Science and Technology Beihang University Beijing China School of Computer Science University of Technology Sydney Sydney NSW Australia

Internet of Medical Things (IoMT) has garnered significant research attention from both academic and medical institutions. However, the sensitive medical data involved in IoMT raises security and privacy concerns. To mitigate these, ring signature has surfaced as a proper solution, which offers unforgeability and anonymity. Unfortunately, most multi-signer ring signature schemes require a predetermined number of signers and are difficult to adjust dynamically. Additionally, traditional ring signatures have limited adaptability for IoMT due to their reliance on a single entity. It is challenging to effectively define different signature permissions for users of various entities, such as patients and doctors. Therefore, research focusing on constructing a dynamic multi-signer ring signature for multi-party participation remains a critical and ongoing challenge. In this paper, we present ASMR, an anonymity-enhanced sequential multi-signer ring signature scheme for secure medical data sharing in IoMT. ASMR contains two different rings, PR and DR, for patients and doctors, respectively. It allows patients in PR to anonymously sign their electronic healthcare record (EHR) owned by doctors in DR, overcoming the reliance on a single entity in existing approaches while enhancing the anonymity of the signature. Meanwhile, ASMR introduces the concept of signature chaining, allowing multiple users in DR to co-sign information in sequence. In addition, it ensures that each generated signature is traceable, offering a transparent system. We also formally prove the security of ASMR in the random oracle model. Comprehensive performance evaluations indicate that ASMR excels in both computational and storage overhead. In the best case, computational overhead is reduced by approximately $4.7\times $ - $61.7\times $ , while storage overhead is reduced by approximately $26.7\times $ - $212.8\times $ compared to prior arts.

关键词： Medical services security Data privacy Elliptic curves Blockchains Protocols Structural rings Public key Protection Transmitters

来源：评论

学校读者我要写书评

暂无评论

Fw-fuzz: A code coverage-guided fuzzing framework for network protocols on firmware

Fw-fuzz: A code coverage-guided fuzzing framework for networ...

引用

作者： Gao, Zicong Dong, Weiyu Chang, Rui Wang, Yisen Cyberspace Security Department State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China College of Computer Science and Technology Zhejiang University Hangzhou China

Fuzzing is an effective approach to detect software vulnerabilities utilizing changeable generated inputs. However, fuzzing the network protocol on the firmware of IoT devices is limited by inefficiency of test case generation, cross-architecture instrumentation, and fault detection. In this article, we propose the Fw-fuzz, a coverage-guided and crossplatform framework for fuzzing network services running in the context of firmware on embedded architectures, which can generate more valuable test cases by introspecting program runtime information and using a genetic algorithm model. Specifically, we propose novel dynamic instrumentation in Fw-fuzz to collect the running state of the firmware program. Then Fw-fuzz adopts a genetic algorithm model to guide the generation of inputs with high code coverage. We fully implement the prototype system of Fw-fuzz and conduct evaluations on network service programs of various architectures in MIPS, ARM, and PPC. By comparing with the protocol fuzzers Boofuzz and Peach in metrics of edge coverage, our prototype system achieves an average growth of 33.7% and 38.4%, respectively. We further verify six known vulnerabilities and discover 5 0-day vulnerabilities with the Fw-fuzz, which prove the validity and utility of our framework. The overhead of our system expressed as an additional 5% of memory growth. © 2020 John Wiley & Sons, Ltd.

关键词： Firmware

来源：评论

学校读者我要写书评

暂无评论

Delay-Minimized Resource Allocation in Relay-Assisted NOMA-WPT Industrial IoT Networks

IEEE Transactions on Green Communications and Networking

引用

IEEE Transactions on Green Communications and Networking 2024年

作者： Wang, Qianru Qian, Li Ping Li, Mingqing Jiang, Wei Wu, Yuan Zhejiang University of Technology Institute of Cyberspace Security Hangzhou310023 China University of Macau State Key Laboratory of Internet of Things for Smart City China University of Macau Department of Computer and Information Science China

The Industrial Internet of Things (IIoT) is a key application of 5th Generation Mobile Communication technology (5G), with latency-sensitive data transmission forming the foundation of IIoT. In this paper, we study the latency-sensitive data transmission in IIoT with the assistance of relay nodes based on the Non-Orthogonal Multiple Access-Wireless Power Transfer (NOMA-WPT) technology. Specifically, we aim at minimizing the transmission delay by jointly optimizing the uplink transmit power of IIoT devices and relays, the downlink charge power and the uplink bandwidth allocated of relays, the charging time fraction, the IIoT device-to-relay transmission time fraction, and the IIoT device-relay grouping factor, while guaranteeing the amount of data transmitted. To solve the formulated non-convex problem, we equivalently transform it into the problem of maximizing the minimum data transmission across IIoT devices in the framework of bisection searching. That is, the minimum transmission delay can be obtained by alternatively maximizing the minimum data transmission across IIoT devices during the time durations derived by the bisection searching. For the maximization of minimum data transmission, the Karush-Kuhn-Tucker (KKT) condition and Lagrangian function are first used to obtain the optimal solutions to uplink transmit power of IIoT devices and relays, downlink charge power and uplink bandwidth allocated of relays, charging time fraction, and IIoT device-to-relay transmission time fraction. The cross-entropy (CE) algorithm is then used to get the optimal solution of the IIoT device-relay grouping. Simulation results show that the proposed solution reduces the transmission delay by 30.77% compared to using dual-layer Frequency Division Multiple Access (FDMA) in the system. © 2017 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

A Fully Collusion Resistant Public key Trace and Revoke Scheme with Dynamic Registration and Revocation

引用

Chinese Journal of Electronics 2023年第2期18卷 347-354页

作者： Shengli Liu Jian Weng Kefei Chen Xiangxue Li Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai China State Key Laboratory of Information Security Chinese Academy of Sciences Beijing China Department of Computer Science Jinan University Guangzhou China School of Information Security Engineering Shanghai Jiaotong University Shanghai China

We present a new public key trace and revoke scheme, which is suitable for scenarios where users need to join or leave the system frequently. The proposed scheme supports public traceability and dynamic registration and revocation. It is also fully collusion resistant against adaptive chosen ciphertext attack, and its provable security is tightly reduced to the Decisional Diffie-Hellman (DDH) assumption in the standard model. No master key is needed in our scheme, and it allows users to generate public/private keys themselves and then submit the public keys to the system. This means that the setup phase only involves an authentic channel instead of a secure one. Therefore, our scheme can take advantage of Public key infrastructure (PKI) with Certificate authority (CA) playing the role of the system center.

关键词： Resistance Adaptation models Costs Public key Standards

来源：评论

学校读者我要写书评

暂无评论

From Entanglement Purification Scheduling to Fidelity-Constrained Entanglement Routing

From Entanglement Purification Scheduling to Fidelity-Constr...

引用

International Conference on Network Protocols

作者： Ziyue Jia Lin Chen School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Guangdong Provincial Key Laboratory of Information Security Technology Guangzhou China

ISBN: (数字)9798350351712

ISBN: (纸本)9798350351729

Recently emerged as a disruptive networking paradigm, quantum networks rely on the mysterious quantum entanglement to teleport qubits without physically transferring quantum particles. However, the state of quantum systems is extremely fragile due to environment noise. A promising technique to combat against quantum decoherence is entanglement purification. To fully exploit its benefit, two fundamental research questions need to be answered: (1) given an entanglement path, what is the optimal entanglement purification schedule? (2) how to compute min-cost end-to-end entanglement paths subject to fidelity constraint? In this paper, we give algorithmic solutions to both questions. For the first question, we develop an optimal entanglement purification scheduling algorithm for the singlehop case and analyze the PURIFY-AND-SWAP strategy in the multi-hop case by establishing the closed-form condition for its optimality. For the second question, we design a polynomialtime algorithm constructing an $\epsilon$ -optimal fidelity-constrained path. The effectiveness of our algorithms are also numerically demonstrated by extensive simulations.

关键词： Schedules Quantum system Protocols Purification Quantum entanglement Scheduling algorithms Qubit Routing Quantum decoherence Quantum networks

来源：评论

学校读者我要写书评

暂无评论

Analysis of Eavesdropping Region in Hybrid mmWave-Microwave Wireless systems

引用

Wireless Communications and Mobile Computing 2023年第1期2023卷

作者： Qu, Qianyue Zhang, Yuanyu Kasahara, Shoji Graduate School of Information Science Nara Institute of Science and Technology Ikoma Japan School of Computer Science and Technology Xidian University Xi’an China Shannxi Key Laboratory of Network and System Security Beijing Sunwise Information Technology Ltd Beijing China

Hybrid communication systems, where millimeter-wave (mmWave) links coexist with microwave links, have been an essential component in the fifth-generation (5G) wireless networks. Nevertheless, the open feature of the wireless medium makes hybrid systems vulnerable to eavesdropping attacks. Eavesdroppers in hybrid communication systems can enhance their attack performance by opportunistically eavesdropping on mmWave or microwave links. This paper, therefore, aims to answer a natural question: in which region do eavesdroppers prefer the mmWave links? To this end, we first formulate this question as an eavesdropping region characterization problem from the physical layer security perspective, where eavesdroppers select the link to eavesdrop based on the ratio between the security performances of the mmWave and microwave links. To model the security performances of both the mmWave and microwave links, we derive closed-form expressions for the secrecy outage probabilities and lower bounds/exact expressions for the secrecy rates of both links. Finally, we provide numerical results to validate our theoretical analysis and also illustrate the mmWave eavesdropping region under various network parameter settings. Copyright © 2023 Qianyue Qu et al.

关键词： Millimeter waves

来源：评论

学校读者我要写书评

暂无评论

Quantum K-Means Model based on Optimization Framework

Quantum K-Means Model based on Optimization Framework

引用

Image Processing, Electronics and computers (IPEC), Asia-Pacific Conference on

作者： Zexiang Shao Shibin Zhang Sachin Kumar School of Cyberspace Security Chengdu University of Information Technology Chengdu China Sichuan Key Laboratory of Advanced Cryptography and System Security Chengdu China Department of Computer Science and Engineering Ajay Kumar Garg Engineering College India

The Quantum K-means clustering algorithm offers the advantage of quantum parallel computing, but suffers from issues related to cluster center initialization and sensitivity to noisy data due to its similarity with the K-means clustering algorithm. To address these challenges, we propose a quantum K-means model based on an optimization framework. Specifi-cally, we use a quantum genetic algorithm with pin optimization to adjust the fitness function for the Quantum K-means clustering algorithm. The optimally adapted quantum genetic algorithm reduces the sensitivity of cluster center initialization and improves the noise robustness of the Quantum K-means clus-tering algorithm using a noise reduction self-encoder. As a result, the proposed model achieves better clustering performance even in the presence of noise. Experimental results demonstrate that our proposed quantum K-means model has fewer clustering iterations, lower probability of falling into local optima, and improved noise robustness after optimizing the clustering cen-ters. The model's effectiveness in clustering is also demon-strated experimentally.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards Privacy-Preserving Cloud Storage:A Blockchain Approach

引用

computers, Materials & Continua 2021年第12期69卷 2903-2916页

作者： Jia-Shun Zhang Gang Xu Xiu-Bo Chen Haseeb Ahmad Xin Liu Wen Liu Information Security Center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and TelecommunicationsBeijing100876China School of Information Science and Technology North China University of TechnologyBeijing100144China Department of Computer Science National Textile UniversityFaisalabad37610Pakistan Inner Mongolia University of Science&Technology School of Information EngineeringBaotou014010China State Key Laboratory of Media Convergence and Communication Communication University of China School of Computer Science and Cybersecurity Communication University of China Key Laboratory of Convergent Media and Intelligent Technology Communication University of China Ministry of EducationBeijing102204China

With the rapid development of cloud computing technology,cloud services have now become a new business model for information *** cloud server provides the IT resources required by customers in a selfservice manner through the network,realizing business expansion and rapid ***,due to the insufficient protection of data privacy,the problem of data privacy leakage in cloud storage is threatening cloud *** address the problem,we propose BC-PECK,a data protection scheme based on blockchain and public key searchable ***,all the data is protected by the encryption *** privacy data is encrypted and stored in a cloud server,while the ciphertext index is established by a public key searchable encryption scheme and stored on the ***,based on the characteristics of trusted execution of smart contract technology,a control mechanism for data accessing and sharing is *** transaction is automatically recorded on the blockchain,which is fairer under the premise of ensuring the privacy and security of the data sharing ***,we analyzed the security and fairness of the current *** the comparison with similar schemes,we have shown the advantages of the proposed scheme.

关键词： Blockchain privacy protection smart contract public encryption keyword search

来源：评论

学校读者我要写书评

暂无评论

Optimized Design of a Haptic Unit for Vibrotactile Amplitude Modulation

Optimized Design of a Haptic Unit for Vibrotactile Amplitude...

引用

2024 IEEE International Conference on Robotics and Biomimetics, ROBIO 2024

作者： Huang, Jingchen Fang, Yun Guo, Weichao Qiao, Zhijian Sheng, Xinjun School of Mechanical Engineering Meta Robotics Institute Shanghai Jiao Tong University State Key Laboratory of Mechanical System and Vibration Shanghai200240 China Hong Kong University of Science and Technology Department of Electronic and Computer Engineering Hong Kong Hong Kong

ISBN: (纸本)9781665481090

Communicating information to users is a crucial aspect of human-machine interaction. Vibrotactile feedback encodes information into spatiotemporal vibrations, enabling users to perceive tactile sensations. It offers advantages such as lightweight, wearability, and high stability, with broad applications in sensory substitution, virtual reality, education, and healthcare. However, existing haptic unit designs lack amplitude modulation capabilities, which limits their applications. This paper proposed an optimized design of the haptic unit from the perspective of vibration amplitude modulation. A modified elastic model was developed to describe the propagation and attenuation mechanisms of vibration in the skin. Based on the model, two types of hierarchical architectural design were proposed. The design incorporated various materials arranged in multiple layers to amplify or attenuate the vibration amplitude as it traveled through the structure. An experimental platform was built to evaluate the performance of the optimized design. © 2024 IEEE.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Age of information Analysis for CR-NOMA Aided Uplink systems with Randomly Arrived Packets

引用

IEEE Transactions on Communications 2024年

作者： Sun, Yanshi Ye, Yanglin Ding, Zhiguo Zhou, Momiao Liu, Lei Hefei University of Technology School of Computer Science and Information Engineering Hefei230009 China Khalifa University Department of Computer and Information Engineering Abu Dhabi United Arab Emirates Xi'an University of Posts and Telecommunications Shaanxi Key Laboratory of Information Communication Network and Security Xi'an710121 China

This paper studies the application of cognitive radio inspired non-orthogonal multiple access (CR-NOMA) to reduce age of information (AoI) for uplink transmission. In particular, a time division multiple access (TDMA) based legacy network is considered, where each user is allocated with a dedicated time slot to transmit its status update information. The CR-NOMA is implemented as an add-on to the TDMA legacy network, which enables each user to have more opportunities to transmit by sharing other user's time slots. A rigorous analytical framework is developed to obtain the expressions for AoIs achieved by CR-NOMA with and without re-transmission, by taking the randomness of the status update generating process into consideration. Numerical results are presented to verify the accuracy of the developed analysis. It is shown that the AoI can be significantly reduced by applying CR-NOMA compared to TDMA. Moreover, the use of re-transmission is helpful to reduce AoI, especially when the status arrival rate is low. © 1972-2012 IEEE.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：