期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到42篇文章
< 1 2 3 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
A Computational Modeling Framework for Verifiable Computation Offloading in Resource-Constrained IoT Smart Contract Systems Using Zero-Knowledge and Fuzzy Logic 认领 引用
1
作者 Hong Min Yousef Ibrahim Daradkeh +2 位作者 Jung Taek Seo Mohd Anjum Sana Shahab 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第6期1488-1520,共33页
This study presents a computational modeling framework for efficient and secure computation offloading in Internet of Things(IoT)-enabled smart contract systems.The integration of IoT,edge computing,and blockchain int... This study presents a computational modeling framework for efficient and secure computation offloading in Internet of Things(IoT)-enabled smart contract systems.The integration of IoT,edge computing,and blockchain introduces significant challenges,including limited device capacity,high verification cost,and scalability constraints.Existing blockchain verification approaches depend on computationally intensive cryptographic operations that are inefficient for resource-constrained IoT devices,resulting in increased latency,energy consumption,and transaction costs.To address these issues,this study proposes the Zero-Knowledge Fuzzy Logic Offloading and Rollup(Z-FLOR)framework,an adaptive and energy-efficient model designed to enable secure and verifiable computation in IoT-based smart contract systems.The proposed framework integrates three key components.First,a zero-knowledge proof-based verification model using the Grothl6 zkSNARK module generates compact and privacy-preserving proofs that enable fast and reliable verification.Second,a Fuzzy Logic-Driven Energy-Aware Offloading module dynamically allocates computational tasks between IoT devices,edge servers,and cloud platforms based on energy availability,network delay,and device reliability.Third,an Optimistic Rollup Verification module aggregates proofs off-chain and submits them in batches to reduce gas costs and enhance scalability.Extensive simulation and experimental evaluation across diverse IoT scenarios demonstrate the effectiveness of the proposed computational framework.Results indicate that Z-FLOR achieves 99.7%verification accuracy and 98.9%proof compression efficiency,while gas cost analysis indicates gas cost reductions in the range of 80%-98%.Z-FLOR additionally achieves a 44.0%reduction in latency,5l.0%savings in gas costs,and 38.0%energy consumption compared to baseline approaches.These findings highlight the capability of the proposed approach to serve as a scalable and energy-efficient modeling solution for secure IoT smart contract execution in decentralized environments. 展开更多
关键词 Zero-knowledge proofs zkSNARK IoT smart contracts verifiable computation blockchain scalability edge computing rollup architecture
暂未订购 下载PDF
Precise Zero-Knowledge Arguments with Poly-logarithmic Efficiency 认领 引用
2
作者 丁宁 谷大武 《Journal of Shanghai Jiaotong university(Science)》 EI 2009年第5期584-589,共6页
Precise zero-knowledge was introduced by Micali and Pass in STOC06. This notion captures the idea that the view of a verifier can be reconstructed in almost same time. Following the notion, they constructed some preci... Precise zero-knowledge was introduced by Micali and Pass in STOC06. This notion captures the idea that the view of a verifier can be reconstructed in almost same time. Following the notion, they constructed some precise zero-knowledge proofs and arguments, in which the communicated messages are polynomial bits. In this paper, we employ the new simulation technique introduced by them to provide a precise simulator for a modified Kilian＇s zero-knowledge arguments with poly-logarithmic efficiency （this modification addressed by Rosen）, and as a result we show this protocol is a precise zero-knowledge argument with poly-logaxithmic efficiency. We also present an alternative construction of the desired protocols. 展开更多
关键词 cryptography zero-knowledge precise zero-knowledge
暂未订购 下载PDF
On Sequential Composition of Precise Zero-Knowledge 认领 引用
3
作者 丁宁 谷大武 《Journal of Shanghai Jiaotong university(Science)》 EI 2010年第1期43-48,共6页
Precise zero-knowledge was introduced by Micali and Pass in STOC'06.This notion captures the idea that the view of any verifier in interaction can be reconstructed in almost time.Pass also obtained a sequential co... Precise zero-knowledge was introduced by Micali and Pass in STOC'06.This notion captures the idea that the view of any verifier in interaction can be reconstructed in almost time.Pass also obtained a sequential composition lemma for precise zero-knowledge protocols.However,this lemma doesn't provide tight precisions for composed protocols.In this paper we further obtain a sequential composition lemma for a subclass of precise zero-knowledge protocols,which all satisfy a property:their simulators use the code of verifier in almost the black-box way.We call such subclass emulated black-box zero-knowledge protocols.Our lemma provides better precisions for sequential composition of such protocols. 展开更多
关键词 cryptography zero-knowledge precise zero-knowledge
暂未订购 下载PDF
Group Signature Based on Non-interactive Zero-Knowledge Proofs 认领 引用 被引量：2
4
作者 周福才 徐剑 +1 位作者 李慧 王兰兰 《China Communications》 SCIE CSCD 2011年第2期34-41,共8页
Non-Interactive Zero-Knowledge(NIZK for short) proofs are fascinating and extremely useful in many security protocols. In this paper,a new group signature scheme,decisional linear assumption group signature(DLAGS for ... Non-Interactive Zero-Knowledge(NIZK for short) proofs are fascinating and extremely useful in many security protocols. In this paper,a new group signature scheme,decisional linear assumption group signature(DLAGS for short) with NIZK proofs is proposed which can prove and sign the multiple values rather than individual bits based on DLIN assumption. DLAGS does not need to interact between the verifier and issuer,which can decrease the communication times and storage cost compared with the existing interactive group signature schemes. We prove and sign the blocks of messages instead of limiting the proved message to only one bit(0 or 1) in the conventional non-interactive zero-knowledge proof system,and we also prove that our scheme satisfy the property of anonymity,unlinkability and traceability. Finally,our scheme is compared with the other scheme(Benoitt's scheme) which is also based on the NIZK proofs system and the DLIN assumption,and the results show that our scheme requires fewer members of groups and computational times. 展开更多
关键词 group signature non-interactive zero-knowledge proofs commitment scheme groth-sahai proofs system
暂未订购 下载PDF
Block Verification Mechanism Based on Zero-Knowledge Proof in Blockchain 认领 引用 被引量：1
5
作者 Jin Wang Wei Ou +3 位作者 Osama Alfarraj Amr Tolba Gwang-Jun Kim Yongjun Ren 《Computer Systems Science & Engineering》 SCIE EI 2023年第5期1805-1819,共15页
Since transactions in blockchain are based on public ledger verification,this raises security concerns about privacy protection.And it will cause the accumulation of data on the chain and resulting in the low efficien... Since transactions in blockchain are based on public ledger verification,this raises security concerns about privacy protection.And it will cause the accumulation of data on the chain and resulting in the low efficiency of block verification,when the whole transaction on the chain is verified.In order to improve the efficiency and privacy protection of block data verification,this paper proposes an efficient block verification mechanism with privacy protection based on zeroknowledge proof(ZKP),which not only protects the privacy of users but also improves the speed of data block verification.There is no need to put the whole transaction on the chain when verifying block data.It just needs to generate the ZKP and root hash with the transaction information,then save them to the smart contract for verification.Moreover,the ZKP verification in smart contract is carried out to realize the privacy protection of the transaction and efficient verification of the block.When the data is validated,the buffer accepts the complete transaction,updates the transaction status in the cloud database,and packages up the chain.So,the ZKP strengthens the privacy protection ability of blockchain,and the smart contracts save the time cost of block verification. 展开更多
关键词 Blockchain privacy protection zero-knowledge proof smart contract
暂未订购 下载PDF
Blockchain-based continuous data integrity checking protocol with zero-knowledge privacy protection 认领 引用 被引量：4
6
作者 Yiting Huang Yong Yua +2 位作者 Huilin Li Yannan Li Aikui Tian 《Digital Communications and Networks》 SCIE CSCD 2022年第5期604-613,共10页
The cloud computing technology has emerged,developed,and matured in recent years,consequently commercializing remote outsourcing storage services.An increasing number of companies and individuals have chosen the cloud... The cloud computing technology has emerged,developed,and matured in recent years,consequently commercializing remote outsourcing storage services.An increasing number of companies and individuals have chosen the cloud to store their data.However,accidents,such as cloud server downtime,cloud data loss,and accidental deletion,are serious issues for some applications that need to run around the clock.For some mission and business-critical applications,the continuous availability of outsourcing storage services is also necessary to protect users'outsourced data during downtime.Nevertheless,ensuring the continuous availability of data in public cloud data integrity auditing protocols leads to data privacy issues because auditors can obtain the data content of users by a sufficient number of storage proofs.Therefore,protecting data privacy is a burning issue.In addition,existing data integrity auditing schemes that rely on semi-trusted third-party auditors have several security problems,including single points of failure and performance bottlenecks.To deal with these issues,we propose herein a blockchain-based continuous data integrity checking protocol with zero-knowledge privacy protection.We realize a concrete construction by using a verifiable delay function with high efficiency and proof of retrievability,and prove the security of the proposal in a random oracle model.The proposed construction supports dynamic updates for the outsourced data.We also design smart contracts to ensure fairness among the parties involved.Finally,we implement the protocols,and the experimental results demonstrate the efficiency of the proposed protocol. 展开更多
关键词 Continuous availability Verifiable delay function Zero-knowledge privacy Blockchain
暂未订购 下载PDF
Privacy-preserving analytics for the securitization market: a zero-knowledge distributed ledger technology application 认领 引用 被引量：2
7
作者 Sophie Meralli 《Financial Innovation》 2020年第1期129-148,共20页
A zero-knowledge proof or protocol is a cryptographic technique for verifying private data without revealing it in its clear form.In this paper,we evaluate the potential for zero-knowledge distributed ledger technolog... A zero-knowledge proof or protocol is a cryptographic technique for verifying private data without revealing it in its clear form.In this paper,we evaluate the potential for zero-knowledge distributed ledger technology to alleviate asymmetry of information in the asset-backed securitization market.To frame this inquiry,we conducted market data analyses,a review of prior literature,stakeholder interviews with investors,originators and security issuers and collaboration with blockchain engineers and researchers.We introduce a new system which could enable all market participants in the securitization lifecycle(e.g.investors,rating agencies,regulators and security issuers)to interact on a unique decentralized platform while maintaining the privacy of loan-level data,therefore providing the industry with timely analytics and performance data.Our platform is powered by zkLedger(Narula et al.2018),a zero-knowledge protocol developed by the MIT Media Lab and the first system that enables participants of a distributed ledger to run publicly verifiable analytics on masked data. 展开更多
关键词 Structured finance Securitization Blockchain Zero-knowledge proofs Distributed ledger technology Privacy Data analytics
暂未订购 下载PDF
BMSC:A Novel Anonymous Trading Scheme Based on Zero-Knowledge Proof in Ethereum 认领 引用
8
作者 Yang Li Yinyun Zhang +2 位作者 Mengmeng Wang Jianming Zhu Xiuli Wang 《国际计算机前沿大会会议论文集》 2022年第2期59-77,共19页
Blockchains are widely used because of their openness,transparency,nontampering and decentralization.However,there is a high risk of information leakage when trading on blockchain,and the existing anonymous trading sc... Blockchains are widely used because of their openness,transparency,nontampering and decentralization.However,there is a high risk of information leakage when trading on blockchain,and the existing anonymous trading schemes still have some problems.To meet the high requirement of anonymity,the cost of proof submitted by the user is too large,which does not apply to blockchain storage.Meanwhile,transaction verification takes too long to ensure the legitimacy of the transaction.To solve these problems,this paper presents a novel anonymous trading scheme named Block Maze Smart Contract(BMSC)based on the zeroknowledge proof system zk-SNARKs to propose efficiency.This scheme can hide account balances,transaction amounts,and the transfer relationships between transaction parties while preventing overspending attacks and double-spending attacks.Compared with other anonymous schemes,this scheme has less cost of proof and takes less time for transaction verification while meeting the high requirements of anonymity and security. 展开更多
关键词 Zero-knowledge proof Ethereum Account-model Anonymous trading
Concurrent non-malleable zero-knowledge and simultaneous resettable non-malleable zero-knowledge in constant rounds 认领 引用
9
作者 Zhenbin Yan Yi Deng Yiru Sun 《Cybersecurity》 EI 2018年第1期230-244,共15页
Concurrent non-malleable zero-knowledge(CNMZK)considers the concurrent execution of zero-knowledge protocols in a setting even when adversaries can simultaneously corrupt multiple provers and verifiers.As far as we kn... Concurrent non-malleable zero-knowledge(CNMZK)considers the concurrent execution of zero-knowledge protocols in a setting even when adversaries can simultaneously corrupt multiple provers and verifiers.As far as we know,the round complexity of all the constructions of CNMZK arguments for NP is at least ω(log n).In this paper,we provide the first construction of a constant-round concurrent non-malleable zero-knowledge argument for every language in NP.Our protocol relies on the existence of families of collision-resistant hash functions,one-way permutations and indistinguishability obfuscators.As an additional contribution,we study the composition of two central notions in zero knowledge,the simultaneously resettable zero-knowledge and non-malleable zero-knowledge,which seemingly have stronger proved security guarantees.We give the first construction of a constant-round simultaneously-resettable non-malleable zero-knowledge.To the best of our knowledge,this is the first study to combine the two security concepts described above together in the zero-knowledge protocols. 展开更多
关键词 Zero-knowledge Concurrent non-malleable zero-knowledge Simultaneously resettable zero-knowledge Concurrent security computation
Existence of 3-round zero-knowledge proof systems for NP 认领 引用 被引量：2
10
作者 LI HongDat LI Bao 《Science in China(Series F)》 2008年第3期273-282,共10页
This paper considers the existence of 3-round zero-knowledge proof systems for NP. Whether there exist 3-round non-black-box zero-knowledge proof systems for NP language is an open problem. By introducing a new intera... This paper considers the existence of 3-round zero-knowledge proof systems for NP. Whether there exist 3-round non-black-box zero-knowledge proof systems for NP language is an open problem. By introducing a new interactive proof model, we construct a 3-round zero-knowledge proof system for graph 3-coloring under standard assumptions. Our protocol is a non-black-box zero-knowledge proof because we adopt a special strategy to prove the zero-knowledge property. Consequently, our construction shows the existence of 3-round non-black-box zero-knowledge proof for all languages in NP under the DDH assumption. 展开更多
关键词 interactive proof zero-knowledge proof non-black-box simulation DDH assumption
Simplified Design for Concurrent Statistical Zero-Knowledge Arguments 认领 引用
11
作者 魏普文 张国艳 +1 位作者 张立江 王小云 《Tsinghua Science and Technology》 EI CAS 2009年第2期255-263,共9页
This paper shows that the protocol presented by Goyal et al. can be further simplified for a one-way function, with the simplified protocol being more practical for the decisional Diffie-Hellman assumption. Goyal et a... This paper shows that the protocol presented by Goyal et al. can be further simplified for a one-way function, with the simplified protocol being more practical for the decisional Diffie-Hellman assumption. Goyal et al. provided a general transformation from any honest verifier statistical zero-knowledge argument to a concurrent statistical zero-knowledge argument. Their transformation relies only on the existence of one-way functions. For the simplified transformation, the witness indistinguishable proof of knowledge protocols in ＂parallel＂ not only plays the role of preamble but also removes some computational zero-knowledge proofs, which Goyal et al. used to prove the existence of the valid openings to the commitments. Therefore, although some computational zero-knowledge proofs are replaced with a weaker notion, the witness indistinguishable protocol, the proof of soundness can still go through. 展开更多
关键词 concurrent statistical zero-knowledge witness indistinguishable honest verifier decisional Diffie-Hellman assumption
暂未订购 下载PDF
Memorizable Interactive Proof and Zero-Knowledge Proof Systems 认领 引用
12
作者 NingChen Jia-WeiRong 《Journal of Computer Science & Technology》 SCIE EI 2004年第6期936-941,共6页
Interactive proof and zero-knowledge proof systems are two important concepts in cryptography and complexity theory. In the past two decades, a great number of interactive proof and zero-knowledge proof protocols have... Interactive proof and zero-knowledge proof systems are two important concepts in cryptography and complexity theory. In the past two decades, a great number of interactive proof and zero-knowledge proof protocols have been designed and applied in practice. In this paper, a simple memorizable zero-knowledge protocol is proposed for graph non-isomorphism problem, based on the memorizable interactive proof system, which is extended from the original definition of interactive proof and is more applicable in reality. Keywords interactive proof - zero-knowledge proof - memorizable interactive proof - memorizable zero-knowledge proof This work was supported by the ministry of Science and Technology of China (Grant No.2001CCA03000), and the National Natural Science Foundation of China (Grant No.60273045).Ning Chen received his B.S. degree from Fudan University in 2001. Now he is a master candidate of Department of Computer Science, Fudan University. His research interests include computational complexity, computational cryptography, algorithm design and analysis.Jia-Wei Rong received her B.S. degree from Fudan University in 2002. Now she is a master candidate of Department of Computer Science, Fudan University. Her research interests include computational cryptography, machine learning, artificial intelligence. 展开更多
关键词 interactive proof zero-knowledge proof memorizable interactive proof memorizable zero-knowledge proof
暂未订购 下载PDF
An AI-Blockchain Hybrid Model to Enhance Security and Trust in Web 4.0 认领 引用
13
作者 Samer R.Sabbah Mohammad Rasmi Al-Mousa +4 位作者 Ala’a Al-Shaikh Ahmad Al Smadi Suhaila Abuowaida Amina Salhi Arij Alfaidi 《Computers, Materials & Continua》 SCIE EI 2026年第7期1006-1023,共18页
Web 4.0 platforms introduce intelligent,decentralized agents and real-time interactions that increase both utility and attack surface.This paper presents a comprehensive,reproducible AI blockchain hybrid designed to(1... Web 4.0 platforms introduce intelligent,decentralized agents and real-time interactions that increase both utility and attack surface.This paper presents a comprehensive,reproducible AI blockchain hybrid designed to(1)detect SQL injection attacks at scale using a textual TFIDF+machine-learning pipeline,(2)incorporate reputation signals from a real-world Bitcoin OTC trust dataset to compute a TrustAlert Score(TAS)that prioritizes alerts and guides logging policy,and(3)record privacy-preserving audit digests on blockchain,optionally attested via a zero-knowledge proof(ZKP)pipeline.We evaluate the system on a 148 k SQL corpus and Soc-SignBitcoinOTC reputation data.The detection module achieves high accuracy(0.9797),F1(0.9807),and ROCAUC(0.9972).TAS effectively separates malicious from benign events(TAS AUC=0.96)and enables selective on-chain logging to reduce cost.Blockchain benchmarks indicate that local(Ganache)throughput is adequate for batched logging,while public testnet(Goerli)exhibits significantly higher latency and gas usage;ZKP attachments further increase on-chain cost.We discuss practical deployment patterns(digest-only on-chain,Layer2 batching),propose evaluation extensions(transfer learning,adversarial red-teaming),and release reproducible scripts for the community. 展开更多
关键词 Web 4.0 SQL injection machine learning blockchain zero-knowledge proof trust score TFIDF security logging
暂未订购 下载PDF
A Blockchain-Based Efficient Verification Scheme for Context Semantic-Aware Ciphertext Retrieval 认领 引用
14
作者 Haochen Bao Lingyun Yuan +2 位作者 Tianyu Xie Han Chen Hui Dai 《Computers, Materials & Continua》 SCIE EI 2026年第1期550-579,共30页
In the age of big data,ensuring data privacy while enabling efficient encrypted data retrieval has become a critical challenge.Traditional searchable encryption schemes face difficulties in handling complex semantic q... In the age of big data,ensuring data privacy while enabling efficient encrypted data retrieval has become a critical challenge.Traditional searchable encryption schemes face difficulties in handling complex semantic queries.Additionally,they typically rely on honest but curious cloud servers,which introduces the risk of repudiation.Furthermore,the combined operations of search and verification increase system load,thereby reducing performance.Traditional verification mechanisms,which rely on complex hash constructions,suffer from low verification efficiency.To address these challenges,this paper proposes a blockchain-based contextual semantic-aware ciphertext retrieval scheme with efficient verification.Building on existing single and multi-keyword search methods,the scheme uses vector models to semantically train the dataset,enabling it to retain semantic information and achieve context-aware encrypted retrieval,significantly improving search accuracy.Additionally,a blockchain-based updatable master-slave chain storage model is designed,where the master chain stores encrypted keyword indexes and the slave chain stores verification information generated by zero-knowledge proofs,thus balancing system load while improving search and verification efficiency.Finally,an improved non-interactive zero-knowledge proof mechanism is introduced,reducing the computational complexity of verification and ensuring efficient validation of search results.Experimental results demonstrate that the proposed scheme offers stronger security,balanced overhead,and higher search verification efficiency. 展开更多
关键词 Searchable encryption blockchain context semantic awareness zero-knowledge proof
暂未订购 下载PDF
RP-IoMT:A Robust and Provable Framework for Federated Learning Privacy-Preserving Intelligence in Healthcare IoMT 认领 引用
15
作者 M.Saad Bin Ilyas Sohail Masood Bhatti +2 位作者 Ghazanfar Latif Sherif Abdelhamid Arfan Jaffar 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第6期1452-1487,共36页
Federated learning(FL)has emerged as a promising approach for enabling collaborative model training across distributed Internet of Medical Things(IoMT)devices without sharing sensitive data.Existing FL frameworks face... Federated learning(FL)has emerged as a promising approach for enabling collaborative model training across distributed Internet of Medical Things(IoMT)devices without sharing sensitive data.Existing FL frameworks face significant challenges in healthcare settings,including vulnerability to adversarial attacks,lack of verifiable update integrity,and limited robustness under heterogeneous data distributions.These limitations hinder reliable deployment in critical medical applications.To address these challenges,this paper proposes RP-IoMT,a robust and privacypreserving FL framework that integrates secure multi-party computation(MPC),zero-knowledge proof-based gradient verification,and robust aggregation mechanisms.The objective of this work is to ensure both the correctness and integrity of model updates while maintaining strong privacy guarantees in adversarial IoMT environments.RP-IoMT enforces bounded client updates using a zero-knowledge clipping protocol(ZKClip),performs secure aggregation using threshold-based MPC,and incorporates robust filtering techniques to mitigate poisoning and backdoor attacks.Experimental results on healthcare datasets demonstrate that RP-IoMT achieves improved predictive performance,reduced attack success rates,and stable convergence under both independent and identically distributed(IID)and nonIID conditions.These results indicate that the proposed framework provides a practical and reliable solution for secure and robust FL in real-world medical Internet of Things(IoT)systems. 展开更多
关键词 Federated learning Internet of Medical Things(IoMT) secure aggregation multiparty computation(MPC) zero-knowledge proofs privacy preservation
暂未订购 下载PDF
A lightweight dual authentication scheme for V2V communication in 6G-based vanets 认领 引用
16
作者 Xia Feng Yaru Wang +1 位作者 Kaiping Cui Liangmin Wang 《Digital Communications and Networks》 SCIE EI CSCD 2025年第4期1224-1235,共12页
The advancement of 6G wireless communication technology has facilitated the integration of Vehicular Ad-hoc Networks(VANETs).However,the messages transmitted over the public channel in the open and dynamic VANETs are ... The advancement of 6G wireless communication technology has facilitated the integration of Vehicular Ad-hoc Networks(VANETs).However,the messages transmitted over the public channel in the open and dynamic VANETs are vulnerable to malicious attacks.Although numerous researchers have proposed authentication schemes to enhance the security of Vehicle-to-Vehicle(V2V)communication,most existing methodologies face two significant challenges:(1)the majority of the schemes are not lightweight enough to support realtime message interaction among vehicles;(2)the sensitive information like identity and position is at risk of being compromised.To tackle these issues,we propose a lightweight dual authentication protocol for V2V communication based on Physical Unclonable Function(PUF).The proposed scheme accomplishes dual authentication between vehicles by the combination of Zero-Knowledge Proof(ZKP)and MASK function.The security analysis proves that our scheme provides both anonymous authentication and information unlinkability.Additionally,the performance analysis demonstrates that the computation overhead of our scheme is approximately reduced 23.4% compared to the state-of-the-art schemes.The practical simulation conducted in a 6G network environment demonstrates the feasibility of 6G-based VANETs and their potential for future advancements. 展开更多
关键词 Vehicular ad-hoc network Identity authentication Physical unclonable function MASK function Zero-knowledge proof 6G wireless communication technology
暂未订购 下载PDF
Quantum-Resilient Blockchain for Secure Digital Identity Verification in DeFi 认领 引用
17
作者 Ahmed I.Alutaibi 《Computers, Materials & Continua》 SCIE EI 2025年第10期875-903,共29页
The rapid evolution of quantum computing poses significant threats to traditional cryptographic schemes,particularly in Decentralized Finance(DeFi)systems that rely on legacy mechanisms like RSA and ECDSA for digital ... The rapid evolution of quantum computing poses significant threats to traditional cryptographic schemes,particularly in Decentralized Finance(DeFi)systems that rely on legacy mechanisms like RSA and ECDSA for digital identity verification.This paper proposes a quantum-resilient,blockchain-based identity verification framework designed to address critical challenges in privacy preservation,scalability,and post-quantum security.The proposed model integrates Post-quantum Cryptography(PQC),specifically lattice-based cryptographic primitives,with Decentralized Identifiers(DIDs)and Zero-knowledge Proofs(ZKPs)to ensure verifiability,anonymity,and resistance to quantum attacks.A dual-layer architecture is introduced,comprising an identity layer for credential generation and validation,and an application layer for DeFi protocol integration.To evaluate its performance,the framework is tested on multiple real-world DeFi platforms using metrics such as verification latency,throughput,attack resistance,energy efficiency,and quantum attack simulation.The results demonstrate that the proposed framework achieves 90%latency reduction and over 35%throughput improvement compared to traditional blockchain identity solutions.It also exhibits a high quantum resistance score(95/100),with successful secure verification under simulated quantum adversaries.The revocation mechanism—implemented using Merkle-tree-based proofs—achieves average response times under 40 ms,and the system maintains secure operations with energy consumption below 9 J per authentication cycle.Additionally,the paper presents a security and cost tradeoff analysis using ZKP schemes such as Bulletproofs and STARKs,revealing superior bits-per-byte efficiency and reduced proof sizes.Real-world adoption scenarios,including integration with six major DeFi protocols,indicate a 25%increase in verified users and a 15%improvement in Total Value Locked(TVL).The proposed solution is projected to remain secure until 2041(basic version)and 2043(advanced version),ensuring long-term sustainability and future-proofing against evolving quantum threats.This work establishes a scalable,privacy-preserving identity model that aligns with emerging post-quantum security standards for decentralized ecosystems. 展开更多
关键词 Quantum-resistant cryptography decentralized identity DeFi blockchain zero-knowledge proofs post-quantum security lattice-based encryption
暂未订购 下载PDF
Secure and Privacy-Preserving Cross-Departmental Computation Framework Based on BFV and Blockchain 认领 引用
18
作者 Peng Zhao Yu Du 《Journal of Electronic Research and Application》 2025年第6期207-217,共11页
As the demand for cross-departmental data collaboration continues to grow,traditional encryption methods struggle to balance data privacy with computational efficiency.This paper proposes a cross-departmental privacy-... As the demand for cross-departmental data collaboration continues to grow,traditional encryption methods struggle to balance data privacy with computational efficiency.This paper proposes a cross-departmental privacy-preserving computation framework based on BFV homomorphic encryption,threshold decryption,and blockchain technology.The proposed scheme leverages homomorphic encryption to enable secure computations between sales,finance,and taxation departments,ensuring that sensitive data remains encrypted throughout the entire process.A threshold decryption mechanism is employed to prevent single-point data leakage,while blockchain and IPFS are integrated to ensure verifiability and tamper-proof storage of computation results.Experimental results demonstrate that with 5,000 sample data entries,the framework performs efficiently and is highly scalable in key stages such as sales encryption,cost calculation,and tax assessment,thereby validating its practical feasibility and security. 展开更多
关键词 Homomorphic encryption Zero-knowledge proof Blockchain Cross-departmental privacy-preserving computation
暂未订购 下载PDF
A Cloud-Fog Enabled and Privacy-Preserving IoT Data Market Platform Based on Blockchain 认领 引用 被引量：2
19
作者 Yurong Luo Wei You +3 位作者 Chao Shang Xiongpeng Ren Jin Cao Hui Li 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第5期2237-2260,共24页
The dynamic landscape of the Internet of Things(IoT)is set to revolutionize the pace of interaction among entities,ushering in a proliferation of applications characterized by heightened quality and diversity.Among th... The dynamic landscape of the Internet of Things(IoT)is set to revolutionize the pace of interaction among entities,ushering in a proliferation of applications characterized by heightened quality and diversity.Among the pivotal applications within the realm of IoT,as a significant example,the Smart Grid(SG)evolves into intricate networks of energy deployment marked by data integration.This evolution concurrently entails data interchange with other IoT entities.However,there are also several challenges including data-sharing overheads and the intricate establishment of trusted centers in the IoT ecosystem.In this paper,we introduce a hierarchical secure data-sharing platform empowered by cloud-fog integration.Furthermore,we propose a novel non-interactive zero-knowledge proof-based group authentication and key agreement protocol that supports one-to-many sharing sets of IoT data,especially SG data.The security formal verification tool shows that the proposed scheme can achieve mutual authentication and secure data sharing while protecting the privacy of data providers.Compared with previous IoT data sharing schemes,the proposed scheme has advantages in both computational and transmission efficiency,and has more superiority with the increasing volume of shared data or increasing number of participants. 展开更多
关键词 IoT data sharing zero-knowledge proof authentication privacy preserving blockchain
暂未订购 下载PDF
A Blockchain-Based Efficient Cross-Domain Authentication Scheme for Internet of Vehicles 认领 引用 被引量：2
20
作者 Feng Zhao Hongtao Ding +3 位作者 Chunhai Li Zhaoyu Su Guoling Liang Changsong Yang 《Computers, Materials & Continua》 SCIE EI 2024年第7期567-585,共19页
The Internet of Vehicles(IoV)is extensively deployed in outdoor and open environments to effectively address traffic efficiency and safety issues by connecting vehicles to the network.However,due to the open and varia... The Internet of Vehicles(IoV)is extensively deployed in outdoor and open environments to effectively address traffic efficiency and safety issues by connecting vehicles to the network.However,due to the open and variable nature of its network topology,vehicles frequently engage in cross-domain interactions.During such processes,directly uploading sensitive information to roadside units for interaction may expose it to malicious tampering or interception by attackers,thus compromising the security of the cross-domain authentication process.Additionally,IoV imposes high real-time requirements,and existing cross-domain authentication schemes for IoV often encounter efficiency issues.To mitigate these challenges,we propose CAIoV,a blockchain-based efficient cross-domain authentication scheme for IoV.This scheme comprehensively integrates technologies such as zero-knowledge proofs,smart contracts,and Merkle hash tree structures.It divides the cross-domain process into anonymous cross-domain authentication and safe cross-domain authentication phases to ensure efficiency while maintaining a balance between efficiency and security.Finally,we evaluate the performance of CAIoV.Experimental results demonstrate that our proposed scheme reduces computational overhead by approximately 20%,communication overhead by around 10%,and storage overhead by nearly 30%. 展开更多
关键词 Blockchain cross-domain authentication internet of vehicle zero-knowledge proof
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 3 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈