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

Witness encryption with updatable ciphertexts

Science China(information Sciences) 2025年第3期68卷 181-196页

作者： Yuzhu WANG Mingwu ZHANG School of Computer Science and Information Security Guilin University of Electronic Technology School of Computer Science Hubei University of Technology

Witness encryption(WE) is a novel type of cryptographic primitive that enables a message to be encrypted via an NP instance. Anyone who possesses a solution to this instance(i.e., a witness) can then recover the message from the *** introduce a variant of WE that allows ciphertext updates, referred to as ciphertext updateable WE(CUWE). With CUWE,a user can encrypt a message using an instance x and a tag t, and those who possess a valid witness w for x and match the access policy defined by tag t can decrypt the message. Furthermore, CUWE allows for the use of an update token to change the tag t of ciphertext to a different tag. This feature enables fine-grained access control, even after the ciphertext has been created, thereby significantly increasing the usefulness of the WE scheme. We demonstrate that such a WE framework with an updatable ciphertext scheme can be constructed using our puncturable instance-based deterministic encryption(PIDE) and indistinguishability obfuscation(iO). We also propose an instantiation of PIDE utilizing puncturable pseudorandom functions(PRFs) that provide(selectively) indistinguishable security. Finally, we expand our CUWE to ciphertext-updatable functional WE(CUFWE), which offers enhanced data access control.

关键词： witness encryption NP relation updatable ciphertext access control indistinguishable obfuscation

来源：评论

学校读者我要写书评

暂无评论

Deep learning-based software engineering: progress,challenges, and opportunities

引用

Science China(information Sciences) 2025年第1期68卷 57-144页

作者： Xiangping CHEN Xing HU Yuan HUANG He JIANG Weixing JI Yanjie JIANG Yanyan JIANG Bo LIU Hui LIU Xiaochen LI Xiaoli LIAN Guozhu MENG Xin PENG Hailong SUN Lin SHI Bo WANG Chong WANG Jiayi WANG Tiantian WANG Jifeng XUAN Xin XIA Yibiao YANG Yixin YANG Li ZHANG Yuming ZHOU Lu ZHANG School of Journalism and Communication Sun Yat-sen University School of Software Technology Zhejiang University School of Software Engineering Sun Yat-sen University School of Software Dalian University of Technology School of Computer Science and Technology Beijing Institute of Technology Key Laboratory of High Confidence Software Technologies (Peking University) Ministry of EducationSchool of Computer Science Peking University State Key Laboratory for Novel Software Technology Nanjing University School of Computer Science and Engineering Beihang University Institute of Information Engineering Chinese Academy of Sciences School of Computer Science Fudan University State Key Laboratory of Complex & Critical Software Environment (CCSE) School of Software Beihang University School of Computer and Information Technology Beijing Jiaotong University School of Computer Science and Technology Harbin Institute of Technology School of Computer Science Wuhan University Huawei Technologies

Researchers have recently achieved significant advances in deep learning techniques, which in turn has substantially advanced other research disciplines, such as natural language processing, image processing, speech recognition, and software engineering. Various deep learning techniques have been successfully employed to facilitate software engineering tasks, including code generation, software refactoring, and fault localization. Many studies have also been presented in top conferences and journals, demonstrating the applications of deep learning techniques in resolving various software engineering tasks. However,although several surveys have provided overall pictures of the application of deep learning techniques in software engineering,they focus more on learning techniques, that is, what kind of deep learning techniques are employed and how deep models are trained or fine-tuned for software engineering tasks. We still lack surveys explaining the advances of subareas in software engineering driven by deep learning techniques, as well as challenges and opportunities in each subarea. To this end, in this study, we present the first task-oriented survey on deep learning-based software engineering. It covers twelve major software engineering subareas significantly impacted by deep learning techniques. Such subareas spread out through the whole lifecycle of software development and maintenance, including requirements engineering, software development, testing, maintenance, and developer collaboration. As we believe that deep learning may provide an opportunity to revolutionize the whole discipline of software engineering, providing one survey covering as many subareas as possible in software engineering can help future research push forward the frontier of deep learning-based software engineering more systematically. For each of the selected subareas,we highlight the major advances achieved by applying deep learning techniques with pointers to the available datasets i

关键词： deep learning software engineering software benchmark software artifact representation survey

来源：评论

学校读者我要写书评

暂无评论

Multi-label, Classification-based Prediction of Breast Cancer Metastasis Directions

IAENG International Journal of Computer Science

引用

IAENG International Journal of computer Science 2025年第1期52卷 1-10页

作者： Wang, Tingting Fan, Qi Tan, Liang Zhang, Beier School of Computer and Software Engineering Anhui Institute of Information Technology China School of Computer Science and Technology Huaibei Normal University China School of Computer and Software Engineering Anhui Institute of Information Technology China School of Computer Science and Technology Huaibei Normal University China

Predicting the metastatic direction of primary breast cancer (BC), thus assisting physicians in precise treatment, strict follow-up, and effectively improving the prognosis. The clinical data of 293,946 patients with primary BC diagnosed between 2010 and 2015 were collected from the Surveillance, Epidemiology, and End Results database. Multiple interpolations and Multi-label Synthetic Minority Over-sampling Technique methods were used for data analysis, and machine learning model was established for multi-label classification. Finally, Surgical information, lymph node status, distant metastasis, tumor size, chemotherapy, histological type, and radiotherapy had significant influence as inputs. Compared with the k-nearest neighbor model, average accuracies of the decision tree and random forest (RF) models increased from 88.84% to 93.59% and 94.14%, respectively. Their average precision, recall rate, F1 score, area under the receiver operating characteristic curve and weighted-F1 increased from 87.24% to 95.85% and 94.74%, 87.73% to 90.40% and 91.76%, 87.07% to 92.16% and 93.45%, 97.11% to 99.53% and 99.95%, 82.13% to 89.44% and 90.48%, respectively. In conclusion, the RF model, which showed the best performance, can be used in multi-label prediction of BC metastasis directions, and can assist physicians in diagnosing and treating patients with primary BC. © (2025), (International Association of Engineers). All rights reserved.

关键词： Lung cancer

来源：评论

学校读者我要写书评

暂无评论

DIEONet:Domain-Invariant information Extraction and Optimization Network for Visual Place Recognition

引用

computers, Materials & Continua 2025年第3期82卷 5019-5033页

作者： Shaoqi Hou Zebang Qin Chenyu Wu Guangqiang Yin Xinzhong Wang Zhiguo Wang School of Computer Science and Technology Xinjiang UniversityUrumqi830046China School of Information and Software Engineering University of Electronic Science and Technology ofChinaChengdu611731China Institute of Public Security Kash Institute of Electronics and Information IndustryKashi844000China

Visual Place Recognition(VPR)technology aims to use visual information to judge the location of agents,which plays an irreplaceable role in tasks such as loop closure detection and *** is well known that previous VPR algorithms emphasize the extraction and integration of general image features,while ignoring the mining of salient features that play a key role in the discrimination of VPR *** this end,this paper proposes a Domain-invariant information Extraction and Optimization Network(DIEONet)for *** core of the algorithm is a newly designed Domain-invariant information Mining Module(DIMM)and a Multi-sample Joint Triplet Loss(MJT Loss).Specifically,DIMM incorporates the interdependence between different spatial regions of the feature map in the cascaded convolutional unit group,which enhances the model’s attention to the domain-invariant static object *** Loss introduces the“joint processing of multiple samples”mechanism into the original triplet loss,and adds a new distance constraint term for“positive and negative”samples,so that the model can avoid falling into local optimum during *** demonstrate the effectiveness of our algorithm by conducting extensive experiments on several authoritative *** particular,the proposed method achieves the best performance on the TokyoTM dataset with a Recall@1 metric of 92.89%.

关键词： Visual place recognition domain-invariant information mining module multi-sample joint triplet loss

来源：评论

学校读者我要写书评

暂无评论

FedCLCC:A personalized federated learning algorithm for edge cloud collaboration based on contrastive learning and conditional computing

引用

Defence Technology(防务技术) 2025年第1期43卷 80-93页

作者： Kangning Yin Xinhui Ji Yan Wang Zhiguo Wang School of Information and Software Engineering University of Electronic Science and Technology of ChinaChengdu611731China Institute of Public Security Kash Institute of Electronics and Information IndustryKashi844000China

Federated learning(FL)is a distributed machine learning paradigm for edge cloud *** can facilitate data-driven decision-making in tactical scenarios,effectively addressing both data volume and infrastructure challenges in edge ***,the diversity of clients in edge cloud computing presents significant challenges for *** federated learning(pFL)received considerable attention in recent *** example of pFL involves exploiting the global and local information in the local *** pFL algorithms experience limitations such as slow convergence speed,catastrophic forgetting,and poor performance in complex tasks,which still have significant shortcomings compared to the centralized *** achieve high pFL performance,we propose FedCLCC:Federated Contrastive Learning and Conditional *** core of FedCLCC is the use of contrastive learning and conditional *** learning determines the feature representation similarity to adjust the local *** computing separates the global and local information and feeds it to their corresponding heads for global and local *** comprehensive experiments demonstrate that FedCLCC outperforms other state-of-the-art FL algorithms.

关键词： Federated learning Statistical heterogeneity Personalized model Conditional computing Contrastive learning

来源：评论

学校读者我要写书评

暂无评论

Weighted Attribute Based Conditional Proxy Re-Encryption in the Cloud

引用

computers, Materials & Continua 2025年第4期83卷 1399-1414页

作者： Xixi Yan Jing Zhang Pengyu Cheng Henan Key Laboratory of Network Cryptography Technology Network Information Security and Cryptography LaboratorySchool of SoftwareHenan Polytechnic UniversityJiaozuo454003China School of Computer Science and Technology Henan Polytechnic UniversityJiaozuo454000China

Conditional proxy re-encryption(CPRE)is an effective cryptographic primitive language that enhances the access control mechanism and makes the delegation of decryption permissions more granular,but most of the attribute-based conditional proxy re-encryption(AB-CPRE)schemes proposed so far do not take into account the importance of user attributes.A weighted attribute-based conditional proxy re-encryption(WAB-CPRE)scheme is thus designed to provide more precise decryption rights *** introducing the concept of weight attributes,the quantity of system attributes managed by the server is reduced *** the same time,a weighted tree structure is constructed to simplify the expression of access structure *** conditional proxy re-encryption,large amounts of data and complex computations are outsourced to cloud servers,so the data owner(DO)can revoke the user’s decryption rights directly with minimal *** scheme proposed achieves security against chosen plaintext attacks(CPA).Experimental simulation results demonstrated that the decryption time is within 6–9 ms,and it has a significant reduction in communication and computation cost on the user side with better functionality compared to other related schemes,which enables users to access cloud data on devices with limited resources.

关键词： Cloud service conditional proxy re-encryption user revocation weighted attribute

来源：评论

学校读者我要写书评

暂无评论

Extractable Witness Encryption for Arithmetic Circuit Satisfiability Problem

引用

IEEE Internet of Things Journal 2025年第11期12卷 18137-18148页

作者： Wang, Yuzhu Zhang, Mingwu Guilin University of Electronic Technology School of Computer Science and Information Security Guilin541004 China Hubei University of Technology School of Computer Science Wuhan430068 China

Witness encryption (WE) (Garg et al, STOC 2013) allows a message to be encrypted using a description of a difficult problem (an NP instance), while anyone who knows a solution to the problem (a witness) can decrypt the ciphertext. The extreme power of this primitive comes at the cost of its elusiveness: a construction from established cryptographic assumptions is currently out of reach (Campanelli et al, PKC 2024). The question we address in this article is how to construct extractable witness encryption from well-studied assumptions. Our first contribution is to propose a novel witness encryption scheme, namely a WE scheme for the NP-complete arithmetic satisfiability problem from well-studied assumptions (based on bilinear pairings), whose correctness is such that anyone who knows a witness to the arithmetic satisfiability problem can decrypt the ciphertext. As our second contribution, we propose an extractable witness key encapsulation mechanism (WKEM), which is the basic component of our WE scheme. Roughly speaking, we first encode the arithmetic circuit satisfiability problem as an arithmetic quadratic program, and then generate a key and a ciphertext based on an NP instance of the arithmetic quadratic program. Anyone with the corresponding witness can decrypt the ciphertext to obtain the key. Finally, the extractability of our extractable witness encryption relies on the extractability of WKEM and the EAV-security of the symmetric encryption scheme. At the same time, we formally prove the extractability of WKEM based on the NP-complete circuit satisfiability problem under the AGM standard assumption d-DLOG. © 2014 IEEE.

关键词： Ciphertext

来源：评论

学校读者我要写书评

暂无评论

ICCG:low-cost and efficient consistency with adaptive synchronization for metadata replication

引用

Frontiers of computer Science 2025年第1期19卷 53-70页

作者： Chenhao ZHANG Liang WANG Jing SHANG Zhiwen XIAO Limin XIAO Meng HAN Bing WEI Runnan SHEN Jinquan WANG State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China School of Cyberspace Security Hainan UniversityHaikou 570228China China Mobile Information Technology Center Beijing 100033China

The rapid growth in the storage scale of wide-area distributed file systems (DFS) calls for fast and scalable metadata management. Metadata replication is the widely used technique for improving the performance and scalability of metadata management. Because of the POSIX requirement of file systems, many existing metadata management techniques utilize a costly design for the sake of metadata consistency, leading to unacceptable performance overhead. We propose a new metadata consistency maintenance method (ICCG), which includes an incremental consistency guaranteed directory tree synchronization (ICGDT) and a causal consistency guaranteed replica index synchronization (CCGRI), to ensure system performance without sacrificing metadata consistency. ICGDT uses a flexible consistency scheme based on the state of files and directories maintained through the conflict state tree to provide an incremental consistency for metadata, which satisfies both metadata consistency and performance requirements. CCGRI ensures low latency and consistent access to data by establishing a causal consistency for replica indexes through multi-version extent trees and logical time. Experimental results demonstrate the effectiveness of our methods. Compared with the strong consistency policies widely used in modern DFSes, our methods significantly improve the system performance. For example, in file creation, ICCG can improve the performance of directory tree operations by at least 36.4 times.

关键词： metadata management metadata replication consistency directory tree replica index

来源：评论

学校读者我要写书评

暂无评论

Efficient Quantum Secure Vector Dominance and Its Applications in Computational Geometry

引用

IEEE Transactions on computers 2025年第6期74卷 2129-2143页

作者： Liu, Wenjie Su, Bingmei Sun, Feiyang Nanjing University of Information Science and Technology School of Software Nanjing210044 China Nanjing University of Information Science and Technology School of Computer Science Nanjing210044 China

Secure vector dominance is a key cryptographic primitive in secure computational geometry (SCG), determining the dominance relationship of vectors between two participants without revealing their private information. However, the security of traditional SVD protocols is compromised by the formidable computational power of quantum computing, and their efficiency needs further improvement. To address these challenges, an efficient quantum secure vector dominance (QSVD) protocol is proposed. Specifically, we first introduce a quantum private permutation (QPP) subprotocol to shuffle the elements of each participant's private input vector. To further facilitate secure data comparison, we propose an enhanced quantum millionaire subprotocol with equality determination functionality, building upon Jia's original protocol. Based on the above two subprotocols, we propose a QSVD protocol with polynomial complexity, deriving vector dominance in a single interaction with a semi-honest third party. Performance analyses confirm that QSVD protocol is correct, resilient against malicious attacks, and retains polynomial computational complexity, ensuring both security and efficiency. To demonstrate the scalability of the QSVD protocol, we illustrate its applications in several geometric computation problems, such as point-line inclusion determination, line-line intersect determination, and point-in-polygon determination. Finally, we validate the feasibility of our protocol by conducting comprehensive simulations on IBM's Qiskit platform, demonstrating its practical applicability and effectiveness in real quantum computing environments. © 1968-2012 IEEE.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

Robust copy-move detection and localization of digital audio based CFCC feature

引用

Multimedia Tools and Applications 2025年第11期84卷 9573-9589页

作者： Wang, Dongyu Li, Xiaojie Shi, Canghong Niu, Xianhua Xiong, Ling Wu, Hanzhou Qian, Qing Qi, Chao School of Computer and Software Engineering Xihua University Chengdu610039 China The College of Computer Science Chengdu University of Information Technology Chengdu610225 China School of Information Shanghai University Shanghai200444 China School of Information Guizhou University of Finance and Economics Guiyang550000 China

Copy-move forgery is a common audio tampering technique in which users copy the contents of one speech and paste them into another region of the same speech signal, thus achieving the effect of tampering with the semantics. To verify the authenticity of the audio, this paper proposes a method to detect and localize audio copy-move forgery based on the cochlear filter of cochlear filter cepstral coefficients (CFCC) feature. The pitch tracking algorithm is used to distinguish the voiced and unvoiced segments in the audio, and then the CFCC coefficients are extracted for each voiced segment. The CFCC feature simulates the entire transmission process of signals in the cochlear basilar membrane using wavelet transformation. Finally, we use Pearson correlation coefficients (PCCs) and dynamic time warping (DTW) in combination to compare the similarity of voiced segments, accurately determining the tampered locations in the audio through threshold judgment. Through extensive experiments on relevant datasets, this algorithm achieves a precision rate of 98.39% and a recall rate of 98.00% in detecting audio without post-processing. Even when detecting audio that has undergone different post-processing, the precision and recall rates remain above 90%. Compared to existing methods, this approach not only achieves precise localization of replicated segments but also demonstrates superior experimental results. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：