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

Characterization and Properties of Bent-Negabent Functions

Chinese Journal of Electronics 2022年第4期31卷 786-792页

作者： JIANG Niu ZHAO Min YANG Zhiyao ZHUO Zepeng CHEN Guolong School of Mathematical Sciences Huaibei Normal University Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal University School of Cyber Science University of Science and Technology of China School of Computer Engineering Bengbu University

A further characterization of the bentnegabent functions is presented. Based on the concept of complete mapping polynomial, we provide a necessary and sufficient condition for a class of quadratic Boolean functions to be bent-negabent. A new characterization of negabent functions can be described by using the parity of Hamming weight. We further generalize the classical convolution theorem and give the nega-Hadamard transform of the composition of a Boolean function and a vectorial Boolean function. The nega-Hadamard transform of a generalized indirect sum is calculated by this composition method.

关键词： Boolean function Bent-negabent function Walsh-Hadamard transform Nega-Hadamard transform

来源：评论

学校读者我要写书评

暂无评论

Intermittent Fault Diagnosis of Split-Star networks and its Applications

引用

IEEE Transactions on Parallel and Distributed Systems 2023年第4期34卷 1253-1264页

作者： Song, Jiankang Lin, Limei Huang, Yanze Hsieh, Sun-Yuan Fujian Normal University College of Computer and Cyber Security Key Laboratory of Network Security and Cryptology Fuzhou Fujian350117 China Fujian University of Technology School of Computer Science and Mathematics Fuzhou Fujian350118 China National Cheng Kung University Department of Computer Science and Information Engineering Tainan701 Taiwan

With the rapid increase of the number of processors in multiprocessor systems and the fast expansion of interconnection networks, the reliability of interconnection network is facing severe challenges, where the fast recognition of fault processors is crucial. In practice, most of the processor failures are intermittent faults. In this article, we first determine the intermittent fault diagnosability t I PMC(S n 2) tIPMC(Sn2) of n-dimensional split-star network Sn2 under the PMC model. In addition, we propose a fast intermittent fault probabilistic diagnosis algorithm FIFPDPMC to identify the nodes with intermittent fault in the n-dimensional split-star network Sn2 under the PMC model, and we calculated the time complexity of the algorithm FIFPDPMC. Then we implement the algorithm FIFPDPMC in the IoT-based wireless sensor network (IoTWSN) and a randomly generated network (RGN) under different number of nodes with intermittent fault, and we evaluate the performance and efficiency of the algorithm FIFPDPMC in terms of accuracy, precision, recall (TPR), F1, G-mean, FPR, TNR and FNR. Experimental results show that, as the number of stages of executing the algorithm FIFPDPMC increases, the number of nodes with intermittent fault being diagnosed by the algorithm FIFPDPMC increases, which implies that the algorithm FIFPDPMC has good performance and efficiency in both IoTWSN and RGN. © 1990-2012 IEEE.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Ramp Scheme Based on CRT for Polynomial Ring over Finite Field

引用

Journal of Systems science & Complexity 2023年第1期36卷 129-150页

作者： DING Jian KE Pinhui LIN Changlu WANG Huaxiong College of Computer and Cyber Security Fujian Normal UniversityFuzhou 350007China School of Mathematics and Big Data Chaohu UniveristyHefei 238024China School of Mathematics and Statistics and Fujian Provincial Key Lab of Network Security and CryptologyFujian Normal UniversityFuzhou 350007China School of Physical and Mathematical Sciences Nanyang Technological UniversitySingapore 639798Singapore

Chinese Reminder Theorem(CRT)for integers has been widely used to construct secret sharing schemes for different scenarios,but these schemes have lower information rates than that of Lagrange interpolation-based *** ASIACRYPT 2018,Ning,et *** a perfect(r,n)-threshold scheme based on CRT for polynomial ring over finite field,and the corresponding information rate is one which is the greatest case for a(r,n)-threshold ***,for many practical purposes,the information rate of Ning,et *** is low and perfect security is too much *** this work,the authors generalize the Ning,et al.(r,n)-threshold scheme to a(t,r,n)-ramp scheme based on CRT for polynomial ring over finite field,which attains the greatest information rate(r−t)for a(t,r,n)-ramp ***,for any given 2≤r_(1)

关键词： Chinese Reminder Theorem polynomial ring ramp scheme threshold changeable secret sharing

来源：评论

学校读者我要写书评

暂无评论

Achieving reliable and anti-collusive outsourcing computation and verification based on blockchain in 5G-enabled IoT

引用

Digital Communications and networks 2022年第5期8卷 644-653页

作者： Linjie Wang Youliang Tian Jinbo Xiong School of Data Science Tongren UniversityTongren554300China State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou UniversityGuiyang550025China Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber SecurityFujian Normal UniversityFuzhou350117China

Widespread applications of 5G technology have prompted the outsourcing of computation dominated by the Internet of Things(IoT)cloud to improve transmission efficiency,which has created a novel paradigm for improving the speed of common connected objects in ***,although it makes it easier for ubiquitous resource-constrained equipment that outsources computing tasks to achieve high-speed transmission services,security concerns,such as a lack of reliability and collusion attacks,still exist in the outsourcing *** this paper,we propose a reliable,anti-collusion outsourcing computation and verification protocol,which uses distributed storage solutions in response to the issue of centralized storage,leverages homomorphic encryption to deal with outsourcing computation and ensures data ***,we embed outsourcing computation results and a novel polynomial factorization algorithm into the smart contract of Ethereum,which not only enables the verification of the outsourcing result without a trusted third party but also resists collusion *** results of the theoretical analysis and experimental performance evaluation demonstrate that the proposed protocol is secure,reliable,and more effective compared with state-of-the-art approaches.

关键词： Outsourcing computation Ethereum Smart contract Public verification Homomorphic encryption

来源：评论

学校读者我要写书评

暂无评论

THL: Fast Targeted High Utility Itemset Mining within Length Consideration

Journal of Network Intelligence

引用

Journal of network Intelligence 2025年第1期10卷 541-558页

作者： Xu, Peiming Jiang, Yixin Kuang, Xiaoyun Luo, Yu Chen, Jiahui Guangdong Provincial Key Laboratory of Power System Network Security CSG Guangzhou510000 China School of Computer Science and Technology Guangdong University of Technology Guangzhou510006 China

High utility itemset mining is a research topic of the pattern mining domain, which has been widely applied in reality during the past decade. Although most high utility itemset mining algorithms show significant execution performance regarding runtime and memory usage, numerous results are useless for users. Targeted high utility itemset mining can reduce the number of high utility itemsets and improve the efficiency of pattern analysis. However, the targeted high utility itemset mining task aims to find targeted high utility itemsets with as many items as possible. Users are not that interested in long results in actual scenarios. Therefore, in this article, we first formulate the problem and then address this issue by proposing a new algorithm named THL for mining targeted high utility itemset within length constraints, based on utility list structure. Furthermore, to improve the performance of the novel algorithm, THL adopts several efficiency pruning strategies, including length and utility aspects. Finally, we conduct an extensive experimental evaluation to compare the SOTA algorithms with THL on several datasets. © 2025, Taiwan Ubiquitous Information CO LTD. All rights reserved.

关键词： data mining high utility itemset length constraint targeted items

来源：评论

学校读者我要写书评

暂无评论

Regularization Mixup Adversarial Training: A Defense Strategy for Membership Privacy with Model Availability Assurance 2

Regularization Mixup Adversarial Training: A Defense Strateg...

引用

2nd International Conference on Big Data and Privacy Computing, BDPC 2024

作者： Ding, Zehua Tian, Youliang Wang, Guorong Xiong, Jinbo College of Computer Science and Technology Guizhou University State Key Laboratory of Public Big Data Guiyang China College of Computer and Cyber Security Fujian Normal University Fujian Provincial Key Laboratory of Network Security and Cryptology Fuzhou China

ISBN: (纸本)9798350307597

Neural network models face two highly destructive threats in real-world applications: membership inference attacks (MIAs) and adversarial attacks (AAs). One compromises the model's confidentiality, leading to membership privacy breaches, while the other disrupts the model's availability, rendering it dysfunctional. Recent work has shown that adversarial examples can pose dual threats to neural network models, both MIAs and AAs, so that these two different types of attacks have a certain degree of intersection. However, existing defense methods typically focus on defending against one of the two attacks and cannot simultaneously address both. To address the above issues, we propose a defense method called regularization mixup adversarial training (RMAT), aiming to protect model membership privacy while ensuring model availability. The core idea of RMAT is to use a continuous augmentation strategy during training to generate mixup adversarial examples, weakening attackers' understanding of membership data, and updating the model with a new membership-weighted loss strategy to improve its generalization ability for handling unknown samples. This approach can further protect the model's membership privacy and ensure model availability. Experimental results demonstrate that compared to single defense strategies, RMAT can simultaneously protect the model's membership privacy and availability. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Access Control Model for E-Medical Systems 2

Privacy-Preserving Access Control Model for E-Medical System...

引用

2nd International Conference on Big Data and Privacy Computing, BDPC 2024

作者： Cai, Rongsheng Chen, Lanxiang Zhu, Yizhao City University of Macau Faculty of Data Science 999078 China College of Computer and Cyber Security Fujian Normal University Fujian Provincial Key Laboratory of Network Security and Cryptology Fuzhou China

ISBN: (纸本)9798350307597

With the high speed development of information technology, the healthcare system increasingly relies on cloud servers for data storage and complex computation, patient data privacy issues stem from healthcare systems' vulnerability to breaches, despite data encryption emphasis, insufficient focus on preventing unauthorized access risks compromises patient information confidentiality. Consequently, the need to protect privacy within the healthcare system has gained significant attentions. However, existing research primarily concentrates on data encryption processes, but there is comparatively less attention given to addressing potential privacy leaks concerning data visitors. In this paper, we propose a privacy-preserving access control model for healthcare cloud data visitors. Our model combines the RBAC (Role-Based Access Control) model with the PSI (Private Set Intersection) technique to ensure the privacy and security of data visitors. The performance analysis of our proposed solution demonstrates its relative efficiency and practicality when applied to E-medical systems. © 2024 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Responsible Gaming Systems 2

Privacy-Preserving Responsible Gaming Systems

引用

2nd International Conference on Big Data and Privacy Computing, BDPC 2024

作者： Zhu, Yizhao Chen, Lanxiang City University of Macau Faculty of Data Science 999078 China College of Computer and Cyber Security Fujian Normal University Fujian Provincial Key Laboratory of Network Security and Cryptology Fuzhou China

ISBN: (纸本)9798350307597

Responsible gaming aims at maintaining the integrity and sustainability of the gaming industry. However, The exchange of sensitive data, such as player and gaming related information, among different parties raises significant privacy concerns, and safeguarding privacy becomes a top priority consideration throughout the design and implementation of responsible gaming systems. In this paper, we introduce an innovative scheme that utilizes Oblivious Transfer (OT) and Private Set Intersection (PSI) protocols to address privacy concerns of responsible gaming systems. Our scheme proposes a system model that addresses privacy concerns related to player global limits and banned player list query and response, without requiring infrastructure changes, unlike blockchain-based solutions;Our proposed scheme not only addresses privacy concerns between the query user and the centralized database server but also mitigates privacy concerns between the query user and certificate authority (CA) by incorporating blind RSA signature scheme;Our proposed scheme achieves linear complexity in computation and communication, while remaining resilient against malicious adversaries under the random oracle model. © 2024 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Online Queue-Aware Service Migration and Resource Allocation in Mobile Edge Computing

引用

IEEE Transactions on Vehicular Technology 2025年第5期74卷 8063-8078页

作者： Du, An Jia, Jie Chen, Jian Wang, Xingwei Huang, Ming Northeastern University School of Computer Science and Engineering Engineering Research Center of Security Technology of Complex Network System Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang110819 China Northeastern University School of Computer Science and Engineering Shenyang110819 China

Mobile edge computing (MEC) integrated with network Functions Virtualization (NFV) helps run a wide range of services implemented by Virtual network Functions (VNFs) deployed at MEC networks. This emerging paradigm offers flexible edge resource management for Internet Service Providers (ISPs) and improves service satisfaction of diverse applications. However, a critical challenge lies in processing extremely unpredictable and bursty traffic flow, especially in event-trigger sensing tasks. In this paper, we study queue-aware service migration and resource allocation in an MEC network, where different devices with different arrival patterns request different network services. To this end, we first formulate a novel long-term operation cost minimization problem subject to the stability of multiple queues by adopting a simultaneous migration scheme and determining resource allocation dynamically. To address the problem efficiently, we propose an online control framework to make decisions without any prior system information. We first adopt the Lyapunov optimization technique to decompose the long-term optimization problem into multi-per-slot subproblems. Then, we adopt a decoupled optimization algorithm based on the coordinate descent method and augmented Lagrangian method to solve the offline mixed integer non-linear programming (MINLP) subproblems. Extensive results reveal that the proposed online optimization framework can efficiently balance queue stability and cost consumption. © 1967-2012 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Based Data Acquisition with Privacy Protection in UAV Cluster network

引用

computer Modeling in Engineering & sciences 2023年第10期137卷 879-902页

作者： Lemei Da Hai Liang Yong Ding Yujue Wang Changsong Yang Huiyong Wang Guangxi Key Laboratory of Cryptography and Information Security School of Computer Science and Information SecurityGuilin University of Electronic TechnologyGuilin541004China Cyberspace Security Research Center Pengcheng LaboratoryShenzhen518055China School of Mathematics and Computing Science Guilin University of Electronic TechnologyGuilin541004China

The unmanned aerial vehicle(UAV)self-organizing network is composed of multiple UAVs with autonomous capabilities according to a certain structure and scale,which can quickly and accurately complete complex tasks such as path planning,situational awareness,and information *** to the openness of the network,the UAV cluster is more vulnerable to passive eavesdropping,active interference,and other attacks,which makes the system face serious security *** paper proposes a Blockchain-Based Data Acquisition(BDA)scheme with privacy protection to address the data privacy and identity authentication problems in the UAV-assisted data acquisition *** UAV cluster has an aggregate unmanned aerial vehicle(AGV)that can batch-verify the acquisition reports within its administrative *** successful verification,AGV adds its signcrypted ciphertext to the aggregation and uploads it to the blockchain for *** are two chains in the blockchain that store the public key information of registered entities and the aggregated reports,*** security analysis shows that theBDAconstruction can protect the privacy and authenticity of acquisition data,and effectively resist a malicious key generation center and the public-key substitution *** also provides unforgeability to acquisition reports under the Elliptic Curve Discrete Logarithm Problem(ECDLP)*** performance analysis demonstrates that compared with other schemes,the proposed BDA construction has lower computational complexity and is more suitable for the UAV cluster network with limited computing power and storage capacity.

关键词： Unmanned aerial vehicle cluster network certificateless signcryption certificateless signature batch verification source authentication data privacy blockchain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：