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

Provably Secure Efficient Key-Exchange Protocol for Intelligent Supply Line Surveillance in Smart Grids

IEEE Internet of Things Journal 2025年第12期12卷 21784-21792页

作者： Ayub, Muhammad Faizan Li, Xiong Mahmood, Khalid Alenazi, Mohammed J.F. Das, Ashok Kumar Wang, Guijuan University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu12599 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan Department of Computer Engineering Riyadh11451 Saudi Arabia International Institute of Information Technology Center for Security Theory and Algorithmic Research Hyderabad500 032 India Korea University College of Informatics Department of Computer Science and Engineering Anam-ro Seoul145 Korea Republic of Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences 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 Jinan 250353 China

Intelligent supply line surveillance is critical for modern smart grids. Smart sensors and gateway nodes are strategically deployed along supply lines to achieve intelligent surveillance. They collect data continuously and transmit it to the control centre in real-time. It enables real-time monitoring, fault detection, and efficient energy management across distribution networks. This advanced surveillance system ensures continuous monitoring of supply lines, detecting anomalies, and optimizing operations to maintain the stability and reliability of the smart grid. However, the reliance of all participating nodes on public communication channels to transmit supply line surveillance data exposes these systems to critical cyber attacks. These cyber attacks include impersonation, physical tampering, ephemeral secret leakage, and desynchronization attacks. To address these issues, existing key-exchange protocols often fail to ensure robust security while imposing high computation and communication overheads, limiting their practicality for resource-constrained environments. Therefore, we propose a secure and efficient key exchange and tamper-resistant authentication protocol using Elliptic Curve Cryptography (ECC) and Physical Unclonable Functions (PUFs). The PUF mechanism provides robust resistance against physical tampering and cloning attacks, ensuring enhanced physical security for supply line devices. We validate the security robustness of the devised protocol using the Random or Real (ROR) model. Furthermore, informal security analysis demonstrates the protocol's robustness in rigorously resisting various attacks, including physical tampering, impersonation, ephemeral secret leakage and desynchronization. Moreover, we determine the performance evaluation that reveals the protocol's superior efficiency compared to competing protocols, achieving significant reductions of 28.64% in computation overhead and 9.96% in communication overhead. © 2014 IEEE.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

Analysis of the gluon distribution with next-to-leading order splitting function at small-x^(*)

引用

Chinese Physics C 2024年第6期48卷 38-44页

作者：陈京萱王晓鹏蔡燕兵陈旭荣王倩 Key Laboratory of Atomic and Subatomic Structure and Quantum Control(MOE) Guangdong Basic Research Center of Excellence for Structure and Fundamental Interactions of MatterInstitute of Quantum MatterSouth China Normal UniversityGuangzhou 510006China Guangdong-Hong Kong Joint Laboratory of Quantum Matter Guangdong Provincial Key Laboratory of Nuclear ScienceSouthern Nuclear Science Computing CenterSouth China Normal UniversityGuangzhou 510006China Institute of Modern Physics Chinese Academy of SciencesLanzhou 730000China University of Chinese Academy of Sciences Beijing 100049China Lanzhou University Lanzhou 730000China School of Nuclear Science and Technology University of Chinese Academy of SciencesBeijing 100049China Guizhou Key Laboratory in Physics and Related Areas Guizhou University of Finance and EconomicsGuiyang 550025China Southern Center for Nuclear-Science Theory(SCNT) Institute of Modern PhysicsChinese Academy of SciencesHuizhou 516000China

An approximated solution for the gluon distribution from DGLAP evolution equations with the NLO splitting function in the small-x limit is *** first obtain simplified forms of the LO and NLO splitting functions in the small-x *** these approximated splitting functions,we obtain the analytical gluon distribution using the Mellin *** free parameters in the boundary conditions are obtained by fitting the CJ15 gluon distribution *** find that the asymptotic behavior of the gluon distribution is consistent with the CJ15 data;however,the NLO results considering the"ladder"structure of gluon emission are slightly better than the LO *** results indicate that the corrections from NLO have a significant influence on the behavior of the gluon distribution in the small-x *** addition,we investigate the DGLAP evolution of the proton structure function using the analytical solution of the gluon *** differential structure function reveals that our results have a similar tendency to the CJ15 data at small-x.

关键词： DGLAP equation gluon distribution small-x structure function

来源：评论

学校读者我要写书评

暂无评论

Lattice-based group encryptions with only one trapdoor

引用

Science China(Information Sciences) 2022年第5期65卷 205-222页

作者： Jing PAN Jiang ZHANG Fangguo ZHANG Xiaofeng CHEN Willy SUSILO State Key Laboratory of Integrated Service Networks(ISN) Xidian University State Key Laboratory of Cryptology School of Computer Science and Engineering Sun Yat-sen University Guangdong Key Laboratory of Information Security Institute of Cybersecurity and Cryptology School of Computing and Information TechnologyUniversity of Wollongong

Group encryption(GE), the encryption analog of group signatures, is a fundamental primitive that offers a privacy-preserving service for a specific receiver concealed within a group of certified *** other cryptographic primitives, GE constructions are always considered relative to the potential danger of quantum computations. The only existing lattice-based variant appeared in the work of Libert et al.(Asiacrypt'16). Despite its non-trivial achievement, the construction suffers in terms of efficiency due to the extensive use of lattice trapdoors. In this paper, we develop an integrated zero-knowledge argument system that is friendly to both accumulated values and hidden matrices and supports efficient designs from *** on this system, we propose efficiency enhancing GE where only group users are required to possess the lattice trapdoors and the other parties are not. In particular, we utilize lattice-based cryptographic accumulators to confirm prospective group members and use the dual Regev encryption scheme to provide privacy for ciphertext recipients. These modifications significantly increase GE efficiency. In addition, under the intractability assumptions of the standard lattice problems, we prove the security of the proposed scheme in the standard model(assuming interaction during the proof phase), which retains the strongest level of security as the only currently available candidate.

关键词： lattice cryptography group encryptions lattice trapdoors accumulators zero-knowledge

来源：评论

学校读者我要写书评

暂无评论

Using Experience Classification for Training Non-Markovian Tasks

SSRN

引用

SSRN 2023年

作者： Miao, Ruixuan Lu, Xu Tian, Cong Yu, Bin Cui, Jin Duan, Zhenhua Institute of Computing Theory and Technology State Key Laboratory of Integrated Services Networks Xidian University China School of Computer Science Xi’an Shiyou University China

Unlike the standard Reinforcement Learning (RL) model, many real-world tasks are non-Markovian, whose rewards are predicated on state history rather than solely on the current state. Solving a non-Markovian task, frequently applied in practical applications such as autonomous driving, financial trading, and medical diagnosis, can be quite challenging. We propose a novel RL approach to achieve non-Markovian rewards expressed in temporal logic LTLf (Linear Temporal Logic over Finite Traces). To this end, an encoding of linear complexity from LTLf into MDPs (Markov Decision Processes) is introduced to take advantage of advanced RL algorithms. Then, a prioritized experience replay technique based on the automata structure (semantics equivalent to LTLf specification) is utilized to improve the training process. We empirically evaluate several benchmark problems augmented with non-Markovian tasks to demonstrate the feasibility and effectiveness of our approach. © 2023, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Single-cell technologies: current and near future

引用

Science China(Life Sciences) 2025年第1期68卷 1-4页

作者： Chenfei Wang Qi Liu Xiaohui Fan Tieliu Shi KeyLaboratory of Spine and Spinal CordInjury Repairand Regeneration Ministry of EducationOrthopedics DepartmentTongji HospitalBioinformatics DepartmentSchoolofLifeSciencesandTechnologyTongji UniversityShanghai 200082China Frontier Science Center for Stem Cells School of Life Sciences and TechnologyTongji UniversityShanghai 200092China Translational Medical Center for Stem Cell Therapy and Institute for Regenerative Medicine Shanghai East HospitalBioinformatics DepartmentSchool of Life Sciences and TechnologyTongji UniversityShanghai 200082China Research Institute of Intelligent Computing Zhejiang LabHangzhou 311121China Pharmaceutical Informatics Institute College of Pharmaceutical SciencesZhejiang UniversityHangzhou 310058China National Key Laboratory of Chinese Medicine Modernization Innovation Center of Yangtze River DeltaZhejiang UniversityJiaxing 314103China Center for Bioinformatics and Computational Biology Shanghai Key Laboratory of Regulatory Biologythe Institute of Biomedical Sciences and School of Life SciencesEast China Normal UniversityShanghai 200241China Key Laboratory of Advanced Theory and Application in Statistics and Data Science(MOE) School of StatisticsEast China Normal UniversityShanghai 200062China

Single-cell technologies enable the indepth exploration of multiple biological hierarchies at the scale of individual cells,which have deepened our knowledge of cellular diversity,tissue organization,and overall organism function(Sun et al.,2024).In 2009,single-cell RNA sequencing(scRNA-seq)was first developed as a powerful tool to dissect gene expression and uncover transcriptional *** the rapid advancement of technology,single-cell approaches have expanded to encompass other omics,such as genomics,epigenomics,proteomics,and ***,multimodal technologies including spatially resolved transcriptomics and clustered regularly interspaced short palindromic repeats(CRISPR)screening at the single-cell level further advanced our ability to comprehensively understand cellular ***-cell methods provide deeper insights into disease mechanisms across various conditions,including cancer,developmental disorders,and aging-associated *** this issue,we focus on topics related to single-cell methods,covering the following four aspects:(i)single-cell multi-omic sequencing technology;(ii)single-cell spatial technology;(iii)singlecell CRISPR screening technology;(iv)applications of single-cell technology.

关键词： expanded enable insight

来源：评论

学校读者我要写书评

暂无评论

Deconfined classical criticality in the anisotropic quantum spin-12 XY model on the square lattice

引用

Physical Review B 2025年第10期111卷 104402-104402页

作者： Christopher Mudry Ömer M. Aksoy Claudio Chamon Akira Furusaki Condensed Matter Theory Group PSI Center for Scientific Computing Theory and Data 5232 Villigen PSI Switzerland Institut de Physique EPF Lausanne CH-1015 Lausanne Switzerland Department of Physics Massachusetts Institute of Technology Cambridge Massachusetts 02139 USA Department of Physics Boston University Boston Massachusetts 02215 USA RIKEN Center for Emergent Matter Science Wako Saitama 351-0198 Japan Condensed Matter Theory Laboratory RIKEN Wako Saitama 351-0198 Japan

The anisotropic quantum spin-12 XY model on a linear chain was solved by Lieb, Schultz, and Mattis [Ann. Phys. 16, 407 (1961)] and shown to display a continuous quantum phase transition at the O(2) symmetric point separating two gapped phases with competing Ising long-range order. For the square lattice, the following is known. The two competing Ising ordered phases extend to finite temperatures, up to a boundary where a transition to the paramagnetic phase occurs, and meet at the O(2) symmetric critical line along the temperature axis that ends at a tricritical point at the Berezinskii-Kosterlitz-Thouless transition temperature where the two competing phases meet the paramagnetic phase. We show that the first-order zero-temperature (quantum) phase transition that separates the competing phases as a function of the anisotropy parameter is smoothed by thermal fluctuations into deconfined classical criticality.

关键词： Paramagnetism

来源：评论

学校读者我要写书评

暂无评论

Preparing a commercial quantum key distribution system for certification against implementation loopholes

引用

Physical Review Applied 2024年第4期22卷 044076页

作者： Vadim Makarov Alexey Abrikosov Poompong Chaiwongkhot Aleksey K. Fedorov Anqi Huang Evgeny Kiktenko Mikhail Petrov Anastasiya Ponosova Daria Ruzhitskaya Andrey Tayduganov Daniil Trefilov Konstantin Zaitsev Skolkovo Moscow 121205 Russia Vigo Quantum Communication Center NTI Center for Quantum Communications Department of Physics Faculty of Science Institute for Quantum Computing Department of Physics and Astronomy Quantum technology foundation (Thailand) Bangkok 10110 Thailand QRate Skolkovo Moscow 143026 Russia Institute for Quantum Information & State Key Laboratory of High Performance Computing College of Computer Science and Technology Moscow 119991 Russia atlanTTic Research Center School of Telecommunication Engineering Department of Signal Theory and Communications Moscow 101000 Russia

A commercial quantum key distribution (QKD) system needs to be formally certified to enable its wide deployment. The certification should include the system’s robustness against known implementation loopholes and attacks that exploit them. Here we ready a fiber-optic QKD system for this procedure. The system has a prepare-and-measure scheme with decoy-state BB84 protocol, polarization encoding, a qubit source rate of 312.5 MHz, and is manufactured by QRate. We detail its hardware and postprocessing. We analyze the hardware for known implementation loopholes, search for possible new loopholes, and discuss countermeasures. We then amend the system design to address the highest-risk loopholes identified. We also work out technical requirements on the certification lab and outline its possible structure.

关键词： Quantum communication Quantum cryptography Quantum protocols

来源：评论

学校读者我要写书评

暂无评论

BPVFL: A Bidirectional Privacy-Preserving Verifiable Federated Learning Framework with Homomorphic Encryption

BPVFL: A Bidirectional Privacy-Preserving Verifiable Federat...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Jingwei Liu Sijing Chen Junrong Zhu Rong Sun Xiaojiang Du Mohsen Guizani Shaanxi Key Laboratory of Blockchain and Secure Computing Xidian University Xi’an China State Key Laboratory of ISN Xidian University Xi’an China Department of Electrical and Computer Engineering Stevens Institute of Technology Hoboken USA Department of Machine Learning Mohamed Bin Zayed University of Artificial Intelligence (MBZUAI) Abu Dhabi UAE

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

Federated learning, while advancing data privacy, faces risks of sensitive information leakage through parameter updates, making it susceptible to inference and data reconstruction attacks. Fraudulent behaviors by central servers or clients can undermine the integrity of model training, thereby reducing accuracy and affecting decision-making quality. This paper introduces a bidirectional, privacy-preserving verifiable federated learning framework(BPVFL) built on homomorphic encryption and a novel three-party zero-knowledge protocol. This framework guarantees the integrity of server aggregation and the credibility of the information uploaded by clients. Experimental results demonstrate that BPVFL effectively protects client privacy, prevents fraud by servers and certain clients, and efficiently handles numerous client disconnections with minimal overhead.

关键词： Training Privacy Protocols Federated learning Computational modeling Sampling methods Information leakage Robustness Servers Homomorphic encryption

来源：评论

学校读者我要写书评

暂无评论

On the Exploitation of Control Knowledge for Enhancing Automated Planning

SSRN

引用

SSRN 2023年

作者： Lu, Xu Yu, Bin Chen, Chu Tian, Cong Duan, Zhenhua Institute of Computing Theory and Technology State Key Laboratory of Integrated Services Networks Xidian University Xi’an710071 China School of Computer Science Qufu Normal University Qufu273165 China

Heuristic search provides an efficient way to automatically explore the state space in planning, while Control Knowledge (CK) also has the potential to significantly increase the performance of planners. Currently, most of the state-of-the-art planners primarily rely on sophisticated heuristic mechanisms. However, these planners fail to scale up and to provide (high-quality) solutions in a range of problems. Appropriate CK may be capable of making hard problems easy to solve, thus leading planners to achieve much higher efficiency. In this paper, we propose a planning approach by incorporating CK with heuristic search in order to leverage the advantages of both. To achieve this, we encode CK specified by a novel variant of Linear Temporal Logic (LTL), referred to as LTL$_{\mathcal{P}}$, into standard planning models. Consequently, we can directly use existing heuristic planners to solve the augmented problem, and avoid tailoring the planners in order to deal with CK implicitly. Experiments demonstrate that our approach shows highly competitive results versus heuristic search and other techniques on many intractable benchmark problems, benefiting in improving the coverage and quality of plans. © 2023, The Authors. All rights reserved.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

The ESPRIT algorithm under high noise: Optimal error scaling and noisy super-resolution

arXiv

引用

arXiv 2024年

作者： Ding, Zhiyan Epperly, Ethan N. Lin, Lin Zhang, Ruizhe Department of Mathematics University of California Berkeley United States Department of Computing and Mathematical Sciences California Institute of Technology PasadenaCA United States Applied Mathematics and Computational Research Division Lawrence Berkeley National Laboratory United States Challenge Institute for Quantum Computation University of California Berkeley United States Simons Institute for the Theory of Computing United States

Subspace-based signal processing techniques, such as the Estimation of Signal Parameters via Rotational Invariant Techniques (ESPRIT) algorithm, are popular methods for spectral estimation. These algorithms can achieve the so-called super-resolution scaling under low noise conditions, surpassing the well-known Nyquist limit. However, the performance of these algorithms under high-noise conditions is not as well understood. Existing state-of-the-art analysis indicates that ESPRIT and related algorithms can be resilient even for signals where each observation is corrupted by statistically independent, mean-zero noise of size O(1), but these analyses only show that the error ∊ decays at a slow rate ∊ = O͂(n−1/2) with respect to the cutoff frequency n (i.e., the maximum frequency of the measurements). In this work, we prove that under certain assumptions, the ESPRIT algorithm can attain a significantly improved error scaling ∊ = O͂(n−3/2), exhibiting noisy super-resolution scaling beyond the Nyquist limit ∊ = O(n−1) given by the Nyquist-–Shannon sampling theorem. We further establish a theoretical lower bound and show that this scaling is optimal. Our analysis introduces novel matrix perturbation results, which could be of independent interest. © 2024, CC BY.

关键词： Cutoff frequency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：