期刊文献+
共找到519篇文章
< 1 2 26 >
每页显示 20 50 100
Performance Evaluation of TLS1.3 Based on Post-Quantum Cryptography
1
作者 SONG Zhen-Yu ZHENG Jie-Yu ZHAO Yun-Lei 《密码学报(中英文)》 北大核心 2026年第1期199-218,共20页
Post-quantum transport layer security(PQ-TLS)is capable of effectively defending against quantum threats to current network communications,whereas its larger public key and certificate sizes as well as higher computat... Post-quantum transport layer security(PQ-TLS)is capable of effectively defending against quantum threats to current network communications,whereas its larger public key and certificate sizes as well as higher computational overhead may result in a significant performance reduction compared with conventional TLS.In this paper,we present a systematic evaluation of PQ-TLS performance across diverse deployment scenarios to address the following critical research questions.(1)What is the performance behavior of PQ-TLS across different TLS modes?(2)How does PQ-TLS perform across varying client scales?(3)Which network topology is most suitable for PQ-TLS?(4)How does PQ-TLS perform on personal computers(PCs)compared to embedded IoT devices?To the best of our knowledge,this is the first work to comprehensively address these issues,offering implementers some insights into PQ-TLS performance and guidance for optimizing it across diverse scenarios. 展开更多
关键词 quantum security post-quantum cryptography transport layer security network emulation Internet measurement
在线阅读 下载PDF
Quantum Secure Multiparty Computation:Bridging Privacy,Security,and Scalability in the Post-Quantum Era
2
作者 Sghaier Guizani Tehseen Mazhar Habib Hamam 《Computers, Materials & Continua》 2026年第4期1-25,共25页
The advent of quantum computing poses a significant challenge to traditional cryptographic protocols,particularly those used in SecureMultiparty Computation(MPC),a fundamental cryptographic primitive for privacypreser... The advent of quantum computing poses a significant challenge to traditional cryptographic protocols,particularly those used in SecureMultiparty Computation(MPC),a fundamental cryptographic primitive for privacypreserving computation.Classical MPC relies on cryptographic techniques such as homomorphic encryption,secret sharing,and oblivious transfer,which may become vulnerable in the post-quantum era due to the computational power of quantum adversaries.This study presents a review of 140 peer-reviewed articles published between 2000 and 2025 that used different databases like MDPI,IEEE Explore,Springer,and Elsevier,examining the applications,types,and security issues with the solution of Quantum computing in different fields.This review explores the impact of quantum computing on MPC security,assesses emerging quantum-resistant MPC protocols,and examines hybrid classicalquantum approaches aimed at mitigating quantum threats.We analyze the role of Quantum Key Distribution(QKD),post-quantum cryptography(PQC),and quantum homomorphic encryption in securing multiparty computations.Additionally,we discuss the challenges of scalability,computational efficiency,and practical deployment of quantumsecure MPC frameworks in real-world applications such as privacy-preserving AI,secure blockchain transactions,and confidential data analysis.This review provides insights into the future research directions and open challenges in ensuring secure,scalable,and quantum-resistant multiparty computation. 展开更多
关键词 Quantum computing secure multiparty computation(MPC) post-quantum cryptography(PQC) quantum key distribution(QKD) privacy-preserving computation quantum homomorphic encryption quantum network security federated learning blockchain security quantum cryptography
在线阅读 下载PDF
Lightweight Hash-Based Post-Quantum Signature Scheme for Industrial Internet of Things
3
作者 Chia-Hui Liu 《Computers, Materials & Continua》 2026年第2期1041-1058,共18页
TheIndustrial Internet of Things(IIoT)has emerged as a cornerstone of Industry 4.0,enabling large-scale automation and data-driven decision-making across factories,supply chains,and critical infrastructures.However,th... TheIndustrial Internet of Things(IIoT)has emerged as a cornerstone of Industry 4.0,enabling large-scale automation and data-driven decision-making across factories,supply chains,and critical infrastructures.However,the massive interconnection of resource-constrained devices also amplifies the risks of eavesdropping,data tampering,and device impersonation.While digital signatures are indispensable for ensuring authenticity and non-repudiation,conventional schemes such as RSA and ECCare vulnerable to quantumalgorithms,jeopardizing long-termtrust in IIoT deployments.This study proposes a lightweight,stateless,hash-based signature scheme that achieves post-quantum security while addressing the stringent efficiency demands of IIoT.The design introduces two key optimizations:(1)Forest ofRandomSubsets(FORS)onDemand,where subset secret keys are generated dynamically via a PseudoRandom Function(PRF),thereby minimizing storage overhead and eliminating key-reuse risks;and(2)Winternitz One-Time Signature Plus(WOTS+)partial hash-chain caching,which precomputes intermediate hash values at edge gateways,reducing device-side computations,latency,and energy consumption.The architecture integrates a multi-layerMerkle authentication tree(Merkle tree)and role-based delegation across sensors,gateways,and a Signature Authority Center(SAC),supporting scalable cross-site deployment and key rotation.Froma theoretical perspective,we establish a formal(Existential Unforgeability under Chosen Message Attack)EUF-CMA security proof using a game-based reduction framework.The proof demonstrates that any successful forgerymust reduce to breaking the underlying assumptions of PRF indistinguishability,(second)preimage resistance,or collision resistance,thus quantifying adversarial advantage and ensuring unforgeability.On the implementation side,our design achieves a balanced trade-off between postquantum security and lightweight performance,offering concrete deployment guidelines for real-time industrial systems.In summary,the proposed method contributes both practical system design and formal security guarantees,providing IIoT with a deployable signature substrate that enhances resilience against quantum-era threats and supports future extensions such as device attestation,group signatures,and anomaly detection. 展开更多
关键词 Industrial Internet of Things(IIoT) post-quantum cryptography hash-based signatures SPHINCS+
在线阅读 下载PDF
Comparative Evaluation of Elliptic Curve Cryptography Based Homomorphic Encryption Schemes for a Novel Secure Multiparty Computation 被引量:1
4
作者 Sankita J. Patel Ankit Chouhan Devesh C. Jinwala 《Journal of Information Security》 2014年第1期12-18,共7页
In this paper, we focus on Elliptic Curve Cryptography based approach for Secure Multiparty Computation (SMC) problem. Widespread proliferation of data and the growth of communication technologies have enabled collabo... In this paper, we focus on Elliptic Curve Cryptography based approach for Secure Multiparty Computation (SMC) problem. Widespread proliferation of data and the growth of communication technologies have enabled collaborative computations among parties in distributed scenario. Preserving privacy of data owned by parties is crucial in such scenarios. Classical approach to SMC is to perform computation using Trusted Third Party (TTP). However, in practical scenario, TTPs are hard to achieve and it is imperative to eliminate TTP in SMC. In addition, existing solutions proposed for SMC use classical homomorphic encryption schemes such as RSA and Paillier. Due to the higher cost incurred by such cryptosystems, the resultant SMC protocols are not scalable. We propose Elliptic Curve Cryptography (ECC) based approach for SMC that is scalable in terms of computational and communication cost and avoids TTP. In literature, there do exist various ECC based homomorphic schemes and it is imperative to investigate and analyze these schemes in order to select the suitable for a given application. In this paper, we empirically analyze various ECC based homomorphic encryption schemes based on performance metrics such as computational cost and communication cost. We recommend an efficient algorithm amongst several selected ones, that offers security with lesser overheads and can be applied in any application demanding privacy. 展开更多
关键词 ELLIPTIC CURVE cryptography PRIVACY PRESERVATION Secure MULTIPARTY computation
在线阅读 下载PDF
Secured Data Storage Using Deduplication in Cloud Computing Based on Elliptic Curve Cryptography 被引量:1
5
作者 N.Niyaz Ahamed N.Duraipandian 《Computer Systems Science & Engineering》 SCIE EI 2022年第4期83-94,共12页
The tremendous development of cloud computing with related technol-ogies is an unexpected one.However,centralized cloud storage faces few chal-lenges such as latency,storage,and packet drop in the network.Cloud storag... The tremendous development of cloud computing with related technol-ogies is an unexpected one.However,centralized cloud storage faces few chal-lenges such as latency,storage,and packet drop in the network.Cloud storage gets more attention due to its huge data storage and ensures the security of secret information.Most of the developments in cloud storage have been positive except better cost model and effectiveness,but still data leakage in security are billion-dollar questions to consumers.Traditional data security techniques are usually based on cryptographic methods,but these approaches may not be able to with-stand an attack from the cloud server's interior.So,we suggest a model called multi-layer storage(MLS)based on security using elliptical curve cryptography(ECC).The suggested model focuses on the significance of cloud storage along with data protection and removing duplicates at the initial level.Based on divide and combine methodologies,the data are divided into three parts.Here,thefirst two portions of data are stored in the local system and fog nodes to secure the data using the encoding and decoding technique.The other part of the encrypted data is saved in the cloud.The viability of our model has been tested by research in terms of safety measures and test evaluation,and it is truly a powerful comple-ment to existing methods in cloud storage. 展开更多
关键词 Cloud storage DEDUPLICATION fog computing and elliptic curve cryptography
在线阅读 下载PDF
Towards Post-Quantum Cryptography Using Thermal Noise Theory and True Random Numbers Generation 被引量:1
6
作者 Protais Ndagijimana Fulgence Nahayo +2 位作者 Marc Kokou Assogba Adoté François-Xavier Ametepe Juma Shabani 《Journal of Information Security》 2020年第3期149-160,共12页
The advent of quantum computers and algorithms challenges the semantic security of symmetric and asymmetric cryptosystems. Thus, the implementation of new cryptographic primitives is essential. They must follow the br... The advent of quantum computers and algorithms challenges the semantic security of symmetric and asymmetric cryptosystems. Thus, the implementation of new cryptographic primitives is essential. They must follow the breakthroughs and properties of quantum calculators which make vulnerable existing cryptosystems. In this paper, we propose a random number generation model based on evaluation of the thermal noise power of the volume elements of an electronic system with a volume of 58.83 cm<sup>3</sup>. We prove through the sampling of the temperature of each volume element that it is difficult for an attacker to carry out an exploit. In 12 seconds, we generate for 7 volume elements, a stream of randomly generated keys of 187 digits that will be transmitted from source to destination through the properties of quantum cryptography. 展开更多
关键词 Thermal Noise True Random Numbers ALGORITHM post-quantum cryptography
暂未订购
DCCS:A General-Purpose Distributed Cryptographic Computing System
7
作者 JIANG Zhonghua LIN Dongdai +1 位作者 XU Lin LIN Lei 《Wuhan University Journal of Natural Sciences》 CAS 2007年第1期46-50,共5页
Distributed cryptographic computing system plays an important role since cryptographic computing is extremely computation sensitive. However, no general cryptographic computing system is available. Grid technology can... Distributed cryptographic computing system plays an important role since cryptographic computing is extremely computation sensitive. However, no general cryptographic computing system is available. Grid technology can give an efficient computational support for cryptographic applications. Therefore, a general-purpose grid-based distributed computing system called DCCS is put forward in this paper. The architecture of DCCS is simply described at first. The policy of task division adapted in DCCS is then presented. The method to manage subtask is further discussed in detail. Furthermore, the building and execution process of a computing job is revealed. Finally, the details of DCCS implementation under Globus Toolkit 4 are illustrated. 展开更多
关键词 cryptography distributed computing execution plan computational grid
在线阅读 下载PDF
Survey on Public Key Cryptography Scheme for Securing Data in Cloud Computing
8
作者 J. Athena V. Sumathy 《Circuits and Systems》 2017年第3期77-92,共16页
Numerous advancements in the Information Technology (IT) require the proper security policy for the data storage and transfer among the cloud. With the increase in size of the data, the time required to handle the hug... Numerous advancements in the Information Technology (IT) require the proper security policy for the data storage and transfer among the cloud. With the increase in size of the data, the time required to handle the huge-size data is more. An assurance of security in cloud computing suffers various issues. The evolution of cryptographic approaches addresses these limitations and provides the solution to the data preserving. There are two issues in security assurance such as geographical distribution and the multi-tenancy of the cloud server. This paper surveys about the various cryptographic techniques with their key sizes, time required for key/signature generation and verification constraints. The survey discusses the architecture for secure data transmissions among the devices, challenges raised during the transmission and attacks. This paper presents the brief review of major cryptographic techniques such as Rivest, Shamir Adleman (RSA), Dffie Hellman and the Elliptic Curve Cryptography (ECC) associated key sizes. This paper investigates the general impact of digital signature generation techniques on cloud security with the advantages and disadvantages. The results and discussion section existing in this paper investigate the time consumption for key/signature generation and verification with the key size variations effectively. The initialization of random prime numbers and the key computation based on the points on the elliptic curve assures the high-security compared to the existing schemes with the minimum time consumption and sizes in cloud-based applications. 展开更多
关键词 Cloud computing cryptography RSA Diffie Hellman ELLIPTIC CURVE cryptography Digital SIGNATURE
在线阅读 下载PDF
AN ACCURATE PREDICTION MODEL FOR COMPUTATIONAL OVERHEADS OF SECURITY MECHANISMS IN WIRELESS SENSOR NETWORKS
9
作者 Liu Wei Luo Rong Yang Huazhong 《Journal of Electronics(China)》 2009年第5期699-705,共7页
In Wireless Sensor Networks (WSNs), it is necessary to predict computational overheads of security mechanisms without final implementations to provide guidelines for system design. This paper presents an accurate and ... In Wireless Sensor Networks (WSNs), it is necessary to predict computational overheads of security mechanisms without final implementations to provide guidelines for system design. This paper presents an accurate and flexible model to predict overheads of these mechanisms. This model is based on overheads of basic operations frequently used in cryptography algorithms, which are essential elements of security mechanisms. Several popular cryptography algorithms and security mechanisms are evaluated using this model. According to simulation results, relative prediction errors are less than 7% for most cryptography algorithms and security mechanisms. 展开更多
关键词 Wireless Sensor Network (WSN) cryptography algorithm Security mechanism computational overhead
在线阅读 下载PDF
Edge-Fog Enhanced Post-Quantum Network Security: Applications, Challenges and Solutions
10
作者 Seo Yeon Moon Byung Hyun Jo +2 位作者 Abir El Azzaoui Sushil Kumar Singh Jong Hyuk Park 《Computers, Materials & Continua》 2025年第7期25-55,共31页
With the rapid advancement of ICT and IoT technologies,the integration of Edge and Fog Computing has become essential to meet the increasing demands for real-time data processing and network efficiency.However,these t... With the rapid advancement of ICT and IoT technologies,the integration of Edge and Fog Computing has become essential to meet the increasing demands for real-time data processing and network efficiency.However,these technologies face critical security challenges,exacerbated by the emergence of quantum computing,which threatens traditional encryption methods.The rise in cyber-attacks targeting IoT and Edge/Fog networks underscores the need for robust,quantum-resistant security solutions.To address these challenges,researchers are focusing on Quantum Key Distribution and Post-Quantum Cryptography,which utilize quantum-resistant algorithms and the principles of quantum mechanics to ensure data confidentiality and integrity.This paper reviews the current security practices in IoT and Edge/Fog environments,explores the latest advancements in QKD and PQC technologies,and discusses their integration into distributed computing systems.Additionally,this paper proposes an enhanced QKD protocol combining the Cascade protocol and Kyber algorithm to address existing limitations.Finally,we highlight future research directions aimed at improving the scalability,efficiency,and practicality of QKD and PQC for securing IoT and Edge/Fog networks against evolving quantum threats. 展开更多
关键词 Edge computing fog computing quantum key distribution security post-quantum cryptography cascade protocol
在线阅读 下载PDF
From portfolio optimization to quantum blockchain and security: a systematic review of quantum computing in finance
11
作者 Abha Satyavan Naik Esra Yeniaras +2 位作者 Gerhard Hellstern Grishma Prasad Sanjay Kumar Lalta Prasad Vishwakarma 《Financial Innovation》 2025年第1期2536-2602,共67页
The rapid advancement of quantum computing has sparked a considerable increase in research attention to quantum technologies.These advances span fundamental theoretical inquiries into quantum information and the explo... The rapid advancement of quantum computing has sparked a considerable increase in research attention to quantum technologies.These advances span fundamental theoretical inquiries into quantum information and the exploration of diverse applications arising from this evolving quantum computing paradigm.The scope of the related research is notably diverse.This paper consolidates and presents quantum computing research related to the financial sector.The finance applications considered in this study include portfolio optimization,fraud detection,and Monte Carlo methods for derivative pricing and risk calculation.In addition,we provide a comprehensive analysis of quantum computing’s applications and effects on blockchain technologies,particularly in relation to cryptocurrencies,which are central to financial technology research.As discussed in this study,quantum computing applications in finance are based on fundamental quantum physics principles and key quantum algorithms.This review aims to bridge the research gap between quantum computing and finance.We adopt a two-fold methodology,involving an analysis of quantum algorithms,followed by a discussion of their applications in specific financial contexts.Our study is based on an extensive review of online academic databases,search tools,online journal repositories,and whitepapers from 1952 to 2023,including CiteSeerX,DBLP,Research-Gate,Semantic Scholar,and scientific conference publications.We present state-of-theart findings at the intersection of finance and quantum technology and highlight open research questions that will be valuable for industry practitioners and academicians as they shape future research agendas. 展开更多
关键词 Portfolio optimization Fraud detection Derivative pricing Risk calculation Monte carlo Quantum blockchain Quantum-resistant blockchain Digital signature algorithms post-quantum cryptography SECURITY Privacy-preserving blockchain Quantum computing
在线阅读 下载PDF
On Privacy-Preserved Machine Learning Using Secure Multi-Party Computing:Techniques and Trends
12
作者 Oshan Mudannayake Amila Indika +2 位作者 Upul Jayasinghe Gyu MyoungLee Janaka Alawatugoda 《Computers, Materials & Continua》 2025年第11期2527-2578,共52页
The rapid adoption of machine learning in sensitive domains,such as healthcare,finance,and government services,has heightened the need for robust,privacy-preserving techniques.Traditional machine learning approaches l... The rapid adoption of machine learning in sensitive domains,such as healthcare,finance,and government services,has heightened the need for robust,privacy-preserving techniques.Traditional machine learning approaches lack built-in privacy mechanisms,exposing sensitive data to risks,which motivates the development of Privacy-Preserving Machine Learning(PPML)methods.Despite significant advances in PPML,a comprehensive and focused exploration of Secure Multi-Party Computing(SMPC)within this context remains underdeveloped.This review aims to bridge this knowledge gap by systematically analyzing the role of SMPC in PPML,offering a structured overviewof current techniques,challenges,and future directions.Using a semi-systematicmapping studymethodology,this paper surveys recent literature spanning SMPC protocols,PPML frameworks,implementation approaches,threat models,and performance metrics.Emphasis is placed on identifying trends,technical limitations,and comparative strengths of leading SMPC-based methods.Our findings reveal thatwhile SMPCoffers strong cryptographic guarantees for privacy,challenges such as computational overhead,communication costs,and scalability persist.The paper also discusses critical vulnerabilities,practical deployment issues,and variations in protocol efficiency across use cases. 展开更多
关键词 cryptography data privacy machine learning multi-party computation PRIVACY SMPC PPML
在线阅读 下载PDF
Quantum-Resistant Cryptographic Primitives Using Modular Hash Learning Algorithms for Enhanced SCADA System Security
13
作者 Sunil K.Singh Sudhakar Kumar +5 位作者 Manraj Singh Savita Gupta Razaz Waheeb Attar Varsha Arya Ahmed Alhomoud Brij B.Gupta 《Computers, Materials & Continua》 2025年第8期3927-3941,共15页
As quantum computing continues to advance,traditional cryptographic methods are increasingly challenged,particularly when it comes to securing critical systems like Supervisory Control andData Acquisition(SCADA)system... As quantum computing continues to advance,traditional cryptographic methods are increasingly challenged,particularly when it comes to securing critical systems like Supervisory Control andData Acquisition(SCADA)systems.These systems are essential for monitoring and controlling industrial operations,making their security paramount.A key threat arises from Shor’s algorithm,a powerful quantum computing tool that can compromise current hash functions,leading to significant concerns about data integrity and confidentiality.To tackle these issues,this article introduces a novel Quantum-Resistant Hash Algorithm(QRHA)known as the Modular Hash Learning Algorithm(MHLA).This algorithm is meticulously crafted to withstand potential quantum attacks by incorporating advanced mathematical and algorithmic techniques,enhancing its overall security framework.Our research delves into the effectiveness ofMHLA in defending against both traditional and quantum-based threats,with a particular emphasis on its resilience to Shor’s algorithm.The findings from our study demonstrate that MHLA significantly enhances the security of SCADA systems in the context of quantum technology.By ensuring that sensitive data remains protected and confidential,MHLA not only fortifies individual systems but also contributes to the broader efforts of safeguarding industrial and infrastructure control systems against future quantumthreats.Our evaluation demonstrates that MHLA improves security by 38%against quantumattack simulations compared to traditional hash functionswhilemaintaining a computational efficiency ofO(m⋅n⋅k+v+n).The algorithm achieved a 98%success rate in detecting data tampering during integrity testing.These findings underline MHLA’s effectiveness in enhancing SCADA system security amidst evolving quantum technologies.This research represents a crucial step toward developing more secure cryptographic systems that can adapt to the rapidly changing technological landscape,ultimately ensuring the reliability and integrity of critical infrastructure in an era where quantum computing poses a growing risk. 展开更多
关键词 Hash functions post-quantum cryptography quantum-resistant hash functions network security supervisory control and data acquisition(SCADA)
在线阅读 下载PDF
Phase-Level Analysis and Forecasting of System Resources in Edge Device Cryptographic Algorithms
14
作者 Ehan Sohn Sangmyung Lee +3 位作者 Sunggon Kim Kiwook Sohn Manish Kumar Yongseok Son 《Computer Modeling in Engineering & Sciences》 2025年第11期2761-2785,共25页
With the accelerated growth of the Internet of Things(IoT),real-time data processing on edge devices is increasingly important for reducing overhead and enhancing security by keeping sensitive data local.Since these d... With the accelerated growth of the Internet of Things(IoT),real-time data processing on edge devices is increasingly important for reducing overhead and enhancing security by keeping sensitive data local.Since these devices often handle personal information under limited resources,cryptographic algorithms must be executed efficiently.Their computational characteristics strongly affect system performance,making it necessary to analyze resource impact and predict usage under diverse configurations.In this paper,we analyze the phase-level resource usage of AES variants,ChaCha20,ECC,and RSA on an edge device and develop a prediction model.We apply these algorithms under varying parallelism levels and execution strategies across key generation,encryption,and decryption phases.Based on the analysis,we train a unified Random Forest model using execution context and temporal features,achieving R2 values up to 0.994 for power and 0.988 for temperature.Furthermore,the model maintains practical predictive performance even for cryptographic algorithms not included during training,demonstrating its ability to generalize across distinct computational characteristics.Our proposed approach reveals how execution characteristics and resource usage interacts,supporting proactive resource planning and efficient deployment of cryptographic workloads on edge devices.As our approach is grounded in phase-level computational characteristics rather than in any single algorithm,it provides generalizable insights that can be extended to a broader range of cryptographic algorithms that exhibit comparable phase-level execution patterns and to heterogeneous edge architectures. 展开更多
关键词 Internet of Things(IoT) cryptography power efficient computing performance modeling
在线阅读 下载PDF
Consensus⁃Based Cryptographic Framework for Side⁃Channel Attack Resilience in Cloud Environments
15
作者 I.Nasurulla K.Hemalatha +1 位作者 P.Ramachandran S.Parvathi 《Journal of Harbin Institute of Technology(New Series)》 2025年第2期90-104,共15页
Cloud environments are essential for modern computing,but are increasingly vulnerable to Side-Channel Attacks(SCAs),which exploit indirect information to compromise sensitive data.To address this critical challenge,we... Cloud environments are essential for modern computing,but are increasingly vulnerable to Side-Channel Attacks(SCAs),which exploit indirect information to compromise sensitive data.To address this critical challenge,we propose SecureCons Framework(SCF),a novel consensus-based cryptographic framework designed to enhance resilience against SCAs in cloud environments.SCF integrates a dual-layer approach combining lightweight cryptographic algorithms with a blockchain-inspired consensus mechanism to secure data exchanges and thwart potential side-channel exploits.The framework includes adaptive anomaly detection models,cryptographic obfuscation techniques,and real-time monitoring to identify and mitigate vulnerabilities proactively.Experimental evaluations demonstrate the framework's robustness,achieving over 95%resilience against advanced SCAs with minimal computational overhead.SCF provides a scalable,secure,and efficient solution,setting a new benchmark for side-channel attack mitigation in cloud ecosystems. 展开更多
关键词 Cloud computing side channel attacks HAVAL cryptographic hash Wilcoxon signed⁃rank test consensus mechanism improved schmidt⁃samoa cryptography
在线阅读 下载PDF
基于BGV密码的密文模式匹配协议
16
作者 郭琦 张猛 《信息技术》 2026年第1期15-21,共7页
字符串搜索有着较为广泛的应用场景,在当前云计算环境下,将检索计算外包给第三方服务器存在数据安全问题。因此,文中设计了两种密文模式匹配协议,在保护用户隐私的同时实现高效的密文计算。协议基于BGV同态密码构建加密环境,并利用SIMD... 字符串搜索有着较为广泛的应用场景,在当前云计算环境下,将检索计算外包给第三方服务器存在数据安全问题。因此,文中设计了两种密文模式匹配协议,在保护用户隐私的同时实现高效的密文计算。协议基于BGV同态密码构建加密环境,并利用SIMD技术加快同态操作。设计高效的密文判等函数,采用朴素密文字符串搜索方式完成密态模式匹配协议的实现。实验结果表明,所提出的两种协议在加密时仅需较小的加密参数,且在密文计算效率上优于同类工作。 展开更多
关键词 密码学 隐私计算 模式匹配
在线阅读 下载PDF
基于国产深度计算单元的SPHINCS^(+)-SM3高性能优化
17
作者 宁祎静 董建阔 +4 位作者 周思源 林璟锵 孙思维 郑昉昱 葛春鹏 《计算机研究与发展》 北大核心 2026年第2期405-418,共14页
数字签名在信息安全中扮演着至关重要的角色,但传统的数字签名算法在后量子时代面临失效的风险。SPHINCS^(+)作为一种能够抵抗量子计算攻击的数字签名框架,将在后量子时代发挥越来越重要的作用。然而,SPHINCS^(+)的计算速度较慢,难以满... 数字签名在信息安全中扮演着至关重要的角色,但传统的数字签名算法在后量子时代面临失效的风险。SPHINCS^(+)作为一种能够抵抗量子计算攻击的数字签名框架,将在后量子时代发挥越来越重要的作用。然而,SPHINCS^(+)的计算速度较慢,难以满足现代密码算法对于高吞吐量和低延时的需求,极大地限制了其实用性。提出了一种基于国产深度计算单元(deep computing unit,DCU)的高效优化方案,以加速由国产哈希算法SM3实例化的SPHINCS^(+)算法。通过提高内存拷贝效率、优化SM3、改进SPHINCS^(+)的计算流程以及采用最佳计算并行度,在DCU上实现了SPHINCS^(+)-SM3的128-f模式。实验结果表明,与传统CPU实现相比,DCU上的实现显著提高了签名生成和验证的吞吐量,分别达到了2603.87倍和1281.98倍的提升,极大地增强了SPHINCS^(+)的计算效率和实用性,并推进了后量子密码算法的国产化进程。在数据流量和大量签名请求的场景下,DCU实现展现出显著优于CPU实现的性能优势。 展开更多
关键词 SPHINCS^(+) SM3 后量子密码 并行计算 DCU加速
在线阅读 下载PDF
基于弹性秘密共享的多方部分洗牌协议
18
作者 张艳硕 满子琪 +2 位作者 周幸妤 杨亚涛 胡荣磊 《计算机工程与设计》 北大核心 2026年第2期452-458,共7页
为解决数据共享下隐私保护的问题,设计了一种基于弹性秘密共享的多方部分洗牌协议。针对现有研究效率低下及应用性不足等问题,将弹性秘密共享与洗牌协议相结合以增强协议的容错能力和抵抗合谋攻击的能力;同时设计了一种具备较高的效率... 为解决数据共享下隐私保护的问题,设计了一种基于弹性秘密共享的多方部分洗牌协议。针对现有研究效率低下及应用性不足等问题,将弹性秘密共享与洗牌协议相结合以增强协议的容错能力和抵抗合谋攻击的能力;同时设计了一种具备较高的效率和良好的适用性的部分洗牌协议。通过对该协议的正确性、安全性分析以及与现有文献的对比分析,该协议在满足安全性的前提下,展现出较优的运算效率和较低的资源消耗,为协议的推广应用提供了可行的途径。 展开更多
关键词 弹性秘密共享 洗牌协议 隐私保护 安全多方计算 秘密共享 密码学 安全协议
在线阅读 下载PDF
Survey on Key Technology Development and Application in Trusted Computing 被引量:7
19
作者 Juan Wang Yuan Shi +5 位作者 Guojun Peng Huanguo Zhang Bo Zhao Fei Yan Fajiang Yu Liqiang Zhang 《China Communications》 SCIE CSCD 2016年第11期70-90,共21页
Trusted computing,which can effectively increase the credibility of information system,has made great achievements and is in continuous development. For country who is going to strengthen network construction like Chi... Trusted computing,which can effectively increase the credibility of information system,has made great achievements and is in continuous development. For country who is going to strengthen network construction like China,it is an important fundamental supporting technology worth researching. China is in the international forefront in the field of trusted computing. This paper gives comprehensive introductions to the new development and application of key technologies in trusted computing,such as various trusted platform modules(TPM、TCM、TPCM),TCG Software Stack(TSS),trusted cloud server and Trusted Execution Environment(TEE). We illustrate the progressing and application extension of these technologies and also point out some key problems worth studying in the future. 展开更多
关键词 cyberspace security information security information system security cryptography trusted computing
在线阅读 下载PDF
A New Quantum Algorithm for Computing RSA Ciphertext Period 被引量:2
20
作者 WANG Yahui YAN Songyuan ZHANG Huanguo 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2017年第1期68-72,共5页
Shor proposed a quantum polynomial-time integer factorization algorithm to break the RSA public-key cryptosystem.In this paper,we propose a new quantum algorithm for breaking RSA by computing the order of the RSA ciph... Shor proposed a quantum polynomial-time integer factorization algorithm to break the RSA public-key cryptosystem.In this paper,we propose a new quantum algorithm for breaking RSA by computing the order of the RSA ciphertext C.The new algorithm has the following properties:1)recovering the RSA plaintext M from the ciphertext C without factoring n; 2)avoiding the even order of the element; 3)having higher success probability than Shor's; 4)having the same complexity as Shor's. 展开更多
关键词 information security CRYPTOLOGY RSA cryptography quantum computing
原文传递
上一页 1 2 26 下一页 到第
使用帮助 返回顶部