Block Verification Mechanism Based on Zero-Knowledge Proof in Blockchain

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.

Group Signature Based on Non-interactive Zero-Knowledge Proofs

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.

A Privacy-Preserving Grouping Proof Protocol Based on ECC with Untraceability for RFID

An RFID (Radio-Frequency IDentification) system provides the mechanism to identify tags to readers and then to execute specific RFID-enabled applications. In those applications, secure protocols using lightweight cryptography need to be developed and the privacy of tags must be ensured. In 2010, Batina et al. proposed a privacy-preserving grouping proof protocol for RFID based on ECC (Elliptic Curve Cryptography) in public-key cryptosystem. In the next year, Lv et al. had shown that Batina et al.’s protocol was insecure against the tracking attack such that the privacy of tags did not be preserved properly. Then they proposed a revised protocol based on Batina et al.’s work. Their revised protocol was claimed to have all security properties and resisted tracking attack. But in this paper, we prove that Lv et al.’s protocol cannot work properly. Then we propose a new version protocol with some nonce to satisfy the functions of Batina et al.’s privacy-preserving grouping proof protocol. Further we try the tracing attack made by Lv et al. on our protocol and prove our protocol can resist this attack to recover the untraceability.

Privacy-preserving analytics for the securitization market: a zero-knowledge distributed ledger technology application

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.

基于字合成运算的标签组群组共存证明协议

针对现有的大多数证明协议无法同时证明多标签同时存在缺陷,提出一种具有可扩展性的电子标签组证明协议。协议采用按位运算设计实现的字合成运算对信息加密,字合成运算可使得协议达到超轻量级计算;同时字合成运算实现中巧妙运用参数自身具备的汉明重量,可减少参量引入;协议基于先验证再响应机制,可抵抗假冒攻击等。对协议进行不同角度分析,表明协议能够提供较高的安全性能,同时能够适用于现有低成本被动式电子标签系统中。

可抗穷举攻击的射频识别群组证明协议

针对孙达志等提出的群组证明协议进行重点分析,指出协议存在无法抗穷举攻击的安全缺陷,并在此基础上给出一个改进的协议。协议采用遍历取反运算对信息加密,遍历取反运算将根据加密参量自身汉明重量大小不同而进行对不同参量的取反操作,增加破解难度;协议将信息加密之后再发送,同时信息加密时确保多个参量攻击者无法知晓,以此来抵抗穷举攻击。从安全性角度分析协议,表明协议具有较好的安全性能;从仿真实验角度分析协议,表明协议具有计算量低的优势。

A Blockchain-Based Proxy Re-Encryption Scheme with Conditional Privacy Protection and Auditability

With the development of Internet of Things technology,intelligent door lock devices are widely used in the field of house leasing.In the traditional housing leasing scenario,problems of door lock information disclosure,tenant privacy disclosure and rental contract disputes frequently occur,and the security,fairness and auditability of the housing leasing transaction cannot be guaranteed.To solve the above problems,a blockchain-based proxy re-encryption scheme with conditional privacy protection and auditability is proposed.The scheme implements fine-grained access control of door lock data based on attribute encryption technology with policy hiding,and uses proxy re-encryption technology to achieve auditable supervision of door lock information transactions.Homomorphic encryption technology and zero-knowledge proof technology are introduced to ensure the confidentiality of housing rent information and the fairness of rent payment.To construct a decentralized housing lease transaction architecture,the scheme realizes the efficient collaboration between the door lock data ciphertext stored under the chain and the key information ciphertext on the chain based on the blockchain and InterPlanetary File System.Finally,the security proof and computing performance analysis of the proposed scheme are carried out.The results show that the scheme can resist the chosen plaintext attack and has low computational cost.

A Blockchain-Based Efficient Cross-Domain Authentication Scheme for Internet of Vehicles

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%.

A Fair and Trusted Trading Scheme for Medical Data Based on Smart Contracts

Data is regarded as a valuable asset,and sharing data is a prerequisite for fully exploiting the value of data.However,the current medical data sharing scheme lacks a fair incentive mechanism,and the authenticity of data cannot be guaranteed,resulting in low enthusiasm of participants.A fair and trusted medical data trading scheme based on smart contracts is proposed,which aims to encourage participants to be honest and improve their enthusiasm for participation.The scheme uses zero-knowledge range proof for trusted verification,verifies the authenticity of the patient’s data and the specific attributes of the data before the transaction,and realizes privacy protection.At the same time,the game pricing strategy selects the best revenue strategy for all parties involved and realizes the fairness and incentive of the transaction price.The smart contract is used to complete the verification and game bargaining process,and the blockchain is used as a distributed ledger to record the medical data transaction process to prevent data tampering and transaction denial.Finally,by deploying smart contracts on the Ethereum test network and conducting experiments and theoretical calculations,it is proved that the transaction scheme achieves trusted verification and fair bargaining while ensuring privacy protection in a decentralized environment.The experimental results show that the model improves the credibility and fairness of medical data transactions,maximizes social benefits,encourages more patients and medical institutions to participate in the circulation of medical data,and more fully taps the potential value of medical data.

A Cloud-Fog Enabled and Privacy-Preserving IoT Data Market Platform Based on Blockchain

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.

基于CL加密的改进分布式解密系统

近些年,无线医疗传感器网络(Wireless Medicine Sensor Networks,WMSNs)得到了广泛的应用。WMSNs提高了患者护理质量,但同时也存在许多安全隐患。为了保护患者数据的隐私安全,Yi等人提出了一个基于Paillier密码系统的分布式ElGamal密码系统。然而,Rao分析了他们的方案并展示了一种可行的攻击,该攻击允许攻击者获取密钥。因此,是否可以将具有加法同态性质的密码系统修改为安全的分布式解密系统,以实现更简单的分布式密钥生成和更高效的分布式解密仍然是一个挑战。针对上述挑战,该文提出了一种基于Castagnos和Laguillaumie(CL)加密的改进分布式解密系统,并对未知阶群G上的离散对数关系给出了有效的零知识证明。与其他分布式解密系统相比,基于CL加密的改进分布式系统具有良好的性能、更可靠的设置、更高的安全级别。

张家峁矿近水体煤层群隔水煤柱合理宽度确定

针对张家峁常家沟水库近水体煤层开采后覆岩裂隙扩展诱发透水的潜在风险,对煤层开采过程中的覆岩破坏特征及裂隙扩展规律进行了模型试验及数值模拟研究。为合理确定4^(-2)煤层的隔水煤柱宽度,基于矿山支承压力和静水压力对隔水煤柱的不同作用机理,将4^(-2)煤层隔水煤柱划分为矿压影响区和有效隔水区,分别构建了矿压影响区和有效隔水区的煤柱受力分析计算模型,推导了4^(-2)煤层矿压影响区和有效隔水区的理论宽度计算公式。在此基础上,考虑煤层开采边界角与水体下伏不同煤层矿压影响区宽度的关系,提出了“上覆煤柱宽度+矿压影响区”的水体下伏煤层群隔水煤柱宽度确定方法。结果表明:4^(-2)煤层工作面初次来压步距为45~56 m,周期来压步距为13.8~14.9 m,上覆岩层冒落带高度为12~13 m;地表最大下沉量为2.0~2.2 m,下沉系数为0.571~0.629,4^(-2)、4^(-3)、4^(-4)和5^(-2)煤层隔水煤柱的合理宽度分别为25,39,51和87 m。现场实测隔水效果验证了近水体煤柱理论留设宽度的合理性及其工程适用性,为张家峁近水体煤层群安全高效开采提供了技术保障。

Policy-Based Group Signature Scheme from Lattice

Although the existing group signature schemes from lattice have been optimized for efficiency,the signing abilities of eachmember in the group are relatively single.It may not be suitable for complex applications.Inspired by the pioneering work of Bellare and Fuchsbauer,we present a primitive called policy-based group signature.In policy-based group signatures,group members can on behalf of the group to sign documents that meet their own policies,and the generated signatures will not leak the identity and policies of the signer.Moreover,the group administrator is allowed to reveal the identity of signer when a controversy occurs.Through the analysis of application scenarios,we concluded that the policy-based group signature needs to meet two essential security properties:simulatability and traceability.And we construct a scheme of policy-based group signature from lattice through techniques such as commitment,zero-knowledge proof,rejection sampling.The security of our scheme is proved to be reduced to the module short integer solution(MSIS)and module learning with errors(MLWE)hard assumptions.Furthermore,we make a performance comparison between our scheme and three lattice-based group signature schemes.The result shows that our scheme has more advantages in storage overhead and the sizes of key and signature are decreased roughly by 83.13%,46.01%,respectively,compared with other schemes.

一个可溯源的车联网群签名批量验证协议

车联网是物联网的重要应用之一,对推动智能交通的发展起到了重要作用。但由于车联网的开放性,其很容易遭到各种攻击,导致车辆隐私信息的泄露与重要交通信息被篡改。因此,提出一种基于零知识证明的车联网可溯源群签名批量验证协议,以此保证车辆进行交通信息共享时数据的完整性和可靠性。车辆通过其真实身份向可信机构进行注册,可信机构为其生成一个公私钥对,并保存其真实身份以便在发现车辆违法行为或者交通事故时对车辆的真实身份进行溯源追责。进行安全分析后,该方案的匿名性、消息不可伪造性等安全性得到验证。通过实验对比,表明此方案在进行批量验证的时候能够满足高效快速的要求。

An Effective Security Comparison Protocol in Cloud Computing

With the development of cloud computing technology,more and more data owners upload their local data to the public cloud server for storage and calculation.While this can save customers’operating costs,it also poses privacy and security challenges.Such challenges can be solved using secure multi-party computation(SMPC),but this still exposes more security issues.In cloud computing using SMPC,clients need to process their data and submit the processed data to the cloud server,which then performs the calculation and returns the results to each client.Each client and server must be honest.If there is cooperation or dishonest behavior between clients,some clients may profit from it or even disclose the private data of other clients.This paper proposes the SMPC based on a Partially-Homomorphic Encryption(PHE)scheme in which an addition homomorphic encryption algorithm with a lower computational cost is used to ensure data comparability and Zero-Knowledge Proof(ZKP)is used to limit the client’s malicious behavior.In addition,the introduction of Oblivious Transfer(OT)technology also ensures that the semi-honest cloud server knows nothing about private data,so that the cloud server of this scheme can calculate the correct data in the case of malicious participant models and safely return the calculation results to each client.Finally,the security analysis shows that the scheme not only ensures the privacy of participants,but also ensures the fairness of the comparison protocol data.

Existence of 3-round zero-knowledge proof systems for NP

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.

Memorizable Interactive Proof and Zero-Knowledge Proof Systems

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.

BMSC:A Novel Anonymous Trading Scheme Based on Zero-Knowledge Proof in Ethereum

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.

ACJT群签名方案中成员撤消的高效实现

成员撤消问题是设计群签名方案中的一个难题,到目前为止尚无满意的解决办法.在ACJT群签名方案的基础上,提出了新的成员撤消方法.在新方案中,管理员在撤消一个成员时仅需要一次乘法运算来更新群公钥,签名和验证算法的计算量均独立于目前群成员个数和被撤消的成员个数,因而算法是高效的.以前的具有撤消成员功能的群签名方案,签名和验证算法的计算量要么依赖当前的群成员个数,要么依赖被撤消的群成员个数,而且群公钥的更新或者成员密钥的更新往往需要多次指数运算.

多银行电子现金系统

在已有的公平电子现金系统中 ,商家和其客户必须使用同一银行 ,这一要求使电子现金的广泛应用受到了一定程度的限制 .该文的目的是建立一个可适用于商家和客户各自使用不同银行的、安全的公平电子现金系统 .作者首次提出了由多个银行发行的公平电子现金的模型 .并利用改进的 Cam 97[4] 群签名方案和 L ys98[6 ] 群盲签名方案设计了一个可跟踪用户的多银行公平电子现金方案 .同时指出了利用现有的群签名方案设计电子现金的提款和支付协议所存在的一个弱点及其存在的原因 。