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

A survey on cryptographic techniques for protecting big data security: present and forthcoming

science China(Information sciences) 2022年第10期65卷 73-106页

作者： Siqi LU Jianhua ZHENG Zhenfu CAO Yongjuan WANG Chunxiang GU School of Cyberspace Security Information Engineering University Henan Key Laboratory of Network Cryptography Technology Institute of Security Technology Shanghai Key Laboratory of Trustworthy Computing East China Normal University Cyberspace Security Research Center Peng Cheng Laboratory Shanghai Institute of Intelligent Science and Technology Tongji University

Big data drive multidimensional convergence and profound innovations among industries and provide novel ways of exploring the world. As they significantly create economic and social value, big data meaningfully impact the implementation and management of information security and privacy *** technologies are used to protect the security and entire life cycle of big data. The demand for this technology is multiplied when the data are stored in the cloud. They are stored in the cloud in the form of ciphertext, and the driving requirement for data retrieval, sharing, and manipulation places the security of data at risk. The all-or-nothing approach of traditional cryptography systems cannot realize the release and processing of data information with flexible and increasingly fine granularity. Consequently, dealing with the relationship between privacy protection and data utilization, as well as navigating the blurry boundaries between subverting either plaintext or ciphertext, has become a research focus of the current cryptographic trend for protecting big data security. Presently, there are many studies designed to solve these ***, security requirements and source encryption mode for future big data systems and applications are elaborated. Then, focusing on the practical security and functionality of the big data life cycle, including storage, retrieval, sharing, calculation, statistical analysis, and utilization, the research being conducted based on those functions is reviewed. For each cryptographic technology that meets the requirement of each type of big data security or application, security and efficiency comments and sufficient comparison analyses of cryptography schemes or protocols are provided; moreover, the current general problems and development trends are expounded. Because the current innovative research on cryptographic technology was primarily based on the development or improvement of a single solution, the study on

关键词： big data security cryptographic techniques ciphertext-based data sharing and computing authenticated encryption functional encryption homomorphic encryption secure multi-party computing

来源：评论

学校读者我要写书评

暂无评论

Effective Entry-Wise Flow for Molecule Generation

Effective Entry-Wise Flow for Molecule Generation

引用

International Conference on data engineering

作者： Qifan Zhang Junjie Yao Yuquan Yang Yizhou Shi Wei Gao Xiaoling Wang School of Computer Science and Technology East China Normal University Software Engineering Institute East China Normal University Shanghai Key Laboratory of Trustworthy Computing Department of Chemistry University of Massachusetts Boston University of Michigan Ann Arbor.

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Molecule generation is a critical process in the fields of drug discovery and materials science. Recently, generative models based on normalizing flows have demonstrated significant potential in this domain. These models are particularly suited for handling the symmetrical and complex chemical structures often encountered in molecular datasets. Despite their promising nature, normalizing flow-based models for molecule generation face considerable challenges. The complexity of molecule representation, the rigorous demands of optimization, and the scarcity of training labels in molecular datasets contribute to these difficulties. Additionally, adequately and comprehensively learning the distribution of molecular datasets remains a formidable task. In this paper, we delve into the intricate entry-wise modules in vanilla flows, introducing an effective variation of flow-based models. Our proposed approach innovatively encapsulates affine coupling transformations within normalizing flows. Furthermore, we deconstruct existing invertible flow models, integrating them with newly developed entry-wise transformations. Our experimental studies demonstrate that these proposed entry-wise modules, when incorporated into standard flow-based models, surpass other generative models in performance on various representative datasets and generation tasks. Notably, in the context of low-resourced molecular graph generation, our model achieves remarkable performance compared to its counterparts.

关键词： Training Couplings Materials science and technology Interpolation data engineering Drug discovery Task analysis

来源：评论

学校读者我要写书评

暂无评论

III-V/Si hybrid external-cavity laser utilizing TM mode in the passive photonic circuit 27

III-V/Si hybrid external-cavity laser utilizing TM mode in t...

引用

27th OptoElectronics and Communications Conference/International Conference on Photonics in Switching and computing, OECC/PSC 2022

作者： Guo, Yuyao Li, Xinhang Jin, Minhui Lu, Liangjun Xie, Jingya Chen, Jianping Zhou, Linjie Shanghai Institute for Advanced Communication and Data Science State Key Laboratory of Advanced Optical Communication Systems and Networks Shanghai Jiao Tong University Department of Electronic Engineering Shanghai200240 China SJTU-Pinghu Institute of Intelligent Optoelectronics Pinghu314200 China Terahertz Technology Innovation Research Institute Terahertz Spectrum and Imaging Technology Cooperative Innovation Center University of Shanghai for Science and Technology Shanghai Key Lab of Modern Optical System Shanghai200093 China

We present a III-V/Si hybrid laser using the silicon waveguide TM mode to reduce the propagation loss, backscattering, and two-photon absorption. The TM-mode laser has superior performance than the TE-mode laser. ... 详细信息

ISBN: (数字)9784885523366

ISBN: (纸本)9784885523366

关键词： Photons

来源：评论

学校读者我要写书评

暂无评论

CHECKING CONTINUOUS STOCHASTIC LOGIC AGAINST QUANTUM CONTINUOUS-TIME MARKOV CHAINS

arXiv

引用

arXiv 2022年

作者： Mei, Jingyi Xu, Ming Guan, Ji Deng, Yuxin Yu, Nengkun Shanghai Key Lab of Trustworthy Computing East China Normal University China Shanghai Key Lab of Trustworthy Computing & MoE Engineering Research Center of Software/Hardware Co-design Technology and Application East China Normal University China State Key Lab of Computer Science Institute of Software Chinese Academy of Sciences China Department of Computer Science Stony Brook University United States

Verifying quantum systems has attracted a lot of interest in the last decades. In this paper, we study the quantitative model-checking of quantum continuous-time Markov chains (quantum CTMCs). The branching-time properties of quantum CTMCs are specified by continuous stochastic logic (CSL), which is famous for verifying real-time systems, including classical CTMCs. The core of checking the CSL formulas lies in tackling multiphase until formulas. We develop an algebraic method using proper projection, matrix exponentiation, and definite integration to symbolically calculate the probability measures of path formulas. Thus the decidability of CSL is established. To be efficient, numerical methods are incorporated to guarantee that the time complexity is polynomial in the encoding size of the input model and linear in the size of the input formula. A running example of Apollonian networks is further provided to demonstrate our method. © 2022, CC BY.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Towards Efficient Workflow Scheduling Over Yarn Cluster Using Deep Reinforcement Learning

Towards Efficient Workflow Scheduling Over Yarn Cluster Usin...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Jianguo Xue Ting Wang Puyu Cai MoE Engineering Research Center of Software/Hardware Co-design Technology and Application Shanghai Key Lab. of Trustworthy Computing East China Normal University China Department of Computer Science and Engineering Michigan State University USA

Hadoop Yarn is an open-source cluster manager responsible for resource management and job scheduling. However, data-driven applications are typically organized into workflows that consist of a series of jobs with dependencies. Yarn does not manage users' workflows and only considers the current job rather than the entire workflow when scheduling. In practice, multiple workflows share the same Yarn cluster and are pre-assigned separate Yarn resource queues to avoid mutual interference. However, this coarse-grained resource division can sometimes result in low resource utilization and increased pending time of jobs on the Yarn queue. For instance, one resource queue may have exhausted its quota while still having pending jobs, while other queues may have available resources but cannot begin executing any jobs due to unfulfilled data dependencies. To address this problem, we propose a deep reinforcement learning-based workflow scheduling scheme that takes into account job dependencies, job priorities, and dynamic resource usage. The proposed approach can intelligently identify and utilize free windows of different resource queues. Our simulation results demonstrate that the proposed DRL-based workflow scheduling scheme can significantly reduce the average job latency compared to existing approaches.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to "ABUS-Net: Graph convolutional network with multi-scale features for breast cancer diagnosis using automated breast ultrasound" [Expert Syst. Appl. (2025) 273 126978] (Expert Systems With Applications (2025) 273, (S0957417425006001), (10.1016/***.2025.126978))

引用

Expert Systems with Applications 2025年 280卷

作者： Wang, Changyan Guo, Yuqing Chen, Haobo Guo, Qihui He, Haihao Chen, Lin Zhang, Qi Lab School of Communication and Information Engineering Shanghai University Shanghai China Shanghai Institute of Advanced Communication and Data Science Key Laboratory of Specialty Fiber Optics and Optical Access Networks Shanghai University Shanghai China Department of Ultrasound Huadong Hospital Fudan University Shanghai China

The authors regret that the Acknowledgments information was incomplete. The correct statement of the Acknowledgments section should read: "This work was supported by the National Natural science Foundation of China [62071285], science and Technology Commission of shanghai Municipality [22Y11911600], the Eastern Scholars Program from shanghai Municipal Education Commission, and the shanghai Technical Service Center of science and engineering computing, shanghai University." The authors would like to apologise for any inconvenience caused. © 2025 Elsevier Ltd

关键词：

来源：评论

学校读者我要写书评

暂无评论

FedPHE: A Secure and Efficient Federated Learning via Packed Homomorphic Encryption

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Li, Yuqing Yan, Nan Chen, Jing Wang, Xiong Hong, Jianan He, Kun Wang, Wei Li, Bo Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan430072 China Wuhan University RiZhao Information Technology Institute Rizhao276800 China Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan430074 China Shanghai Jiao Tong University School of Cyber Science and Engineering Shanghai200240 China Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong

Cross-silo federated learning (FL) enables multiple institutions (clients) to collaboratively build a global model without sharing private data. To prevent privacy leakage during aggregation, homomorphic encryption (HE) is widely used to encrypt model updates, yet incurs high computation and communication overheads. To reduce these overheads, packed HE (PHE) has been proposed to encrypt multiple plaintexts into a single ciphertext. However, the original design of PHE assumes all clients share a single private key, making the system vulnerable to security threats of ciphertexts being intercepted and decrypted by honest-but-curious clients. Also, it does not consider the heterogeneity among different clients, resulting in undermined training efficiency with slow convergence and stragglers. To address these challenges, we propose FedPHE, a secure and efficient FL framework with PHE by jointly exploiting contribution-aware secure aggregation and straggler-resistant client selection. Using CKKS with sparsification and blinding, FedPHE achieves efficient secure aggregation that allows clients to only provide obscured encrypted updates while the server can perform aggregation by accounting for contributions of local updates. To mitigate the straggler effect, we devise a perturbed sketch-based selection to cherry-pick representative clients with heterogeneous models and computing capabilities in a communication-efficient and privacy-preserving manner. We show, through rigorous security analysis and extensive experiments, that FedPHE can efficiently safeguard clients' privacy, achieve 2.45-6.56× training speedup, cut the communication overhead by 1.32-24.85×, and reduce straggler effects by 1.89-2.78×. © 2004-2012 IEEE.

关键词： Privacy by design

来源：评论

学校读者我要写书评

暂无评论

A Decentralized Vehicle-to-Vehicle Energy Trading System Based on Efficient Sharding Services

A Decentralized Vehicle-to-Vehicle Energy Trading System Bas...

引用

IEEE International Conference on Big data and Cloud computing (BdCloud)

作者： Kun Meng Lijun Sun Xiao Chen Haiqin Wu Shuaiyong Li College of Information Science and Technology Qingdao University of Science and Technology Shandong China School of Computing and Mathematical Sciences University of Leicester Leicester UK Software Engineering Institute (Shanghai Key Laboratory of Trustworthy Computing) East China Normal University Shanghai China Key Laboratory of Industrial Internet of Things and Networked Control Ministry of Education Chongqing China

Vehicle-to-vehicle (V2V) energy trading stands as a significant technology, allowing electric vehicles (EVs) to share energy. This balances energy demand and supply, reducing pressure on the power grid. However, two substantial challenges require attention: 1) Creating a standardized protocol universally adoptable by EV manufacturers and energy trading participants to establish a common secure and reliable platform for real-time energy trading between EVs. 2) Determining a fair and transparent pricing and transaction management mechanism, accounting for factors such as energy demand and supply, location, and user preferences. To tackle these hurdles, this paper proposes a decentralized V2V energy trading system (VETS) based on a novel high-performance sharding blockchain framework. VETS incorporates a standard energy trading management protocol, achieving trustless and transparent transaction processing. It employs a blockchain sharding and parallel architecture for high transaction throughput, catering to a large number of EVs. Furthermore, an efficient consensus algorithm is developed to minimize service delays and adapt to real-time transaction demands. A practical testbed operationalizes VETS, facilitating experimental analysis within a real-world cloud environment.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Satellite Federated Fine-Tuning for Foundation Models in Space computing Power Networks

arXiv

引用

arXiv 2025年

作者： Zhu, Yan Zhu, Jingyang Wang, Ting Shi, Yuanming Jiang, Chunxiao Letaief, Khaled Ben MoE Engineering Research-Center of Software/Hardware Co-design Technology and Application The Shanghai Key Lab. of Trustworthy Computing East China Normal University Shanghai200062 China School of Information Science and Technology ShanghaiTech University Shanghai201210 China Beijing National Research Center for Information Science and Technology Tsinghua University Beijing100084 China Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology Hong Kong

Advancements in artificial intelligence (AI) and low-earth orbit (LEO) satellites have promoted the application of large remote sensing foundation models for various downstream tasks. However, direct downloading of these models for fine-tuning on the ground is impeded by privacy concerns and limited bandwidth. Satellite federated learning (FL) offers a solution by enabling model fine-tuning directly on-board satellites and aggregating model updates without data downloading. Nevertheless, for large foundation models, the computational capacity of satellites is insufficient to support effective on-board fine-tuning in traditional satellite FL frameworks. To address these challenges, we propose a satellite-ground collaborative federated fine-tuning framework. The key of the framework lies in how to reasonably decompose and allocate model components to alleviate insufficient on-board computation capabilities. During fine-tuning, satellites exchange intermediate results with ground stations or other satellites for forward propagation and back propagation, which brings communication challenges due to the special communication topology of space transmission networks, such as intermittent satellite-ground communication, short duration of satellite-ground communication windows, and unstable inter-orbit inter-satellite links (ISLs). To reduce transmission delays, we further introduce tailored communication strategies that integrate both communication and computing resources. Specifically, we propose a parallel intra-orbit communication strategy, a topology-aware satellite-ground communication strategy, and a latency-minimalization inter-orbit communication strategy to reduce space communication costs. Simulation results demonstrate significant reductions in training time with improvements of approximately 33%. Copyright © 2025, The Authors. All rights reserved.

关键词： Satellite communication systems

来源：评论

学校读者我要写书评

暂无评论

Online Container Scheduling for Low-Latency IoT Services in Edge Cluster Upgrade: A Reinforcement Learning Approach

Online Container Scheduling for Low-Latency IoT Services in ...

引用

2023 IEEE/CIC International Conference on Communications in China, ICCC 2023

作者： Cui, Hanshuai Tang, Zhiqing Lou, Jiong Jia, Weijia Beijing Normal University Institute of Artificial Intelligence and Future Networks Zhuhai519087 China Beijing Normal University School of Artificial Intelligence Beijing100875 China Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai200240 China BNU-HKBU United International College Guangdong Key Lab of Ai and Multi-Modal Data Processing Zhuhai519087 China

ISBN: (纸本)9798350345384

In Mobile Edge computing (MEC), Internet of Things (IoT) devices offload computationally-intensive tasks to edge nodes, where they are executed within containers, reducing the reliance on centralized cloud infrastructure. Frequent up-grades are essential to maintain the efficient and secure operation of edge clusters. However, traditional cloud cluster upgrade strategies are ill-suited for edge clusters due to their geographically distributed nature and resource limitations. Therefore, it is crucial to properly schedule containers and upgrade edge clusters to minimize the impact on running tasks. In this paper, we propose a low-latency container scheduling algorithm for edge cluster upgrades. Specifically: 1) We formulate the online container scheduling problem for edge cluster upgrade to minimize the total task latency. 2) We propose a policy gradient-based reinforcement learning algorithm to address this problem, considering the unique characteristics of MEC. 3) Experimental results demonstrate that our algorithm reduces total task latency by approximately 27% compared to baseline algorithms. © 2023 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：