Zero Knowledge Research Articles

A Blockchain and Zero Knowledge Proof Based Data Security Transaction Method in Distributed Computing

In distributed computing, data trading mechanisms are essential for ensuring the sharing of data across multiple computing nodes. Nevertheless, they currently encounter considerable obstacles, including low accuracy in matching trading parties, ensuring fairness in transactions, and safeguarding data privacy throughout the trading process. In order to address these issues, we put forward a data trading security scheme based on zero-knowledge proofs and smart contracts. In the phase of preparing the security parameters, the objective is to reduce the complexity of generating non-interactive zero-knowledge proofs and to enhance the efficiency of data trading. In the pre-trading phase, we devise attribute atomic matching smart contracts based on precise data property alignment, with the objective of achieving fine-grained matching of data attributes between trading parties. In the trading execution phase, lightweight cryptographic algorithms based on elliptic curve cryptography (ECC) and non-interactive zero-knowledge proofs are employed for the dual encryption of trading data and the generation of attribute proof contracts, thus ensuring the security and privacy of the data. The results of experiments conducted on the Ethereum platform in an industrial IoT scenario demonstrate that our scheme maintains stable and low-cost consumption while ensuring accuracy in matching and privacy protection.

Research on Blockchain Interactive Zero Knowledge Proof Privacy Protection Scheme Based on Improved Paillier Homomorphic Encryption

In the context of the digital age, data privacy and security issues are increasingly prominent. Blockchain technology plays an important role in data sharing due to its transparency and immutability, but it also brings the risk of privacy leakage. Zero knowledge proof technology provides a solution for verifying data correctness without exposing data content, which is particularly important for blockchain as it can ensure the validity and compliance of transactions while protecting user privacy. Although zero knowledge proof is quite mature in theory, its application in blockchain systems still faces challenges such as computational efficiency, complexity of smart contracts, and system compatibility. This study aims to propose a privacy protection scheme that supports interactive zero knowledge proof by improving the homomorphic encryption Paillier algorithm, in order to enhance the privacy protection capability of blockchain systems and maintain system efficiency and security. The study will adopt an interdisciplinary approach, combining cryptography, computer science, and network security theory, to deeply analyze the application effect of zero knowledge proof technology in blockchain, explore its optimization space and applicability.

SeCTIS: A framework to Secure CTI Sharing

The rise of IT-dependent operations in modern organizations has heightened their vulnerability to cyberattacks. Organizations are inadvertently enlarging their vulnerability to cyber threats by integrating more interconnected devices into their operations, which makes these threats both more sophisticated and more common. Consequently, organizations have been compelled to seek innovative approaches to mitigate the menaces inherent in their infrastructure. In response, considerable research efforts have been directed towards creating effective solutions for sharing Cyber Threat Intelligence (CTI). Current information-sharing methods lack privacy safeguards, leaving organizations vulnerable to proprietary and confidential data leaks. To tackle this problem, we designed a novel framework called SeCTIS (Secure Cyber Threat Intelligence Sharing), integrating Swarm Learning and Blockchain technologies to enable businesses to collaborate, preserving the privacy of their CTI data. Moreover, our approach provides a way to assess the data and model quality and the trustworthiness of all the participants leveraging some validators through Zero Knowledge Proofs. Extensive experimentation has confirmed the accuracy and performance of our framework. Furthermore, our detailed attack model analyzes its resistance to attacks that could impact data and model quality.

Arithmetization-oriented APN permutations

AbstractRecently, many cryptographic primitives such as homomorphic encryption (HE), multi-party computation (MPC) and zero-knowledge (ZK) protocols have been proposed in the literature which operate on the prime field $${\mathbb {F}}_p$$ F p for some large prime p. Primitives that are designed using such operations are called arithmetization-oriented primitives. As the concept of arithmetization-oriented primitives is new, a rigorous cryptanalysis of such primitives is yet to be done. In this paper, we investigate arithmetization-oriented APN functions. More precisely, we investigate APN permutations in the CCZ-classes of known families of APN power functions over the prime field $${\mathbb {F}}_p$$ F p . Moreover, we present a class of binomial permutation having differential uniformity at most 5 defined via the quadratic character over finite fields of odd characteristic. Computationally it is confirmed that the latter family contains new APN permutations for some small parameters. We conjecture it to contain an infinite subfamily of APN permutations.

Towards accountable and privacy-preserving blockchain-based access control for data sharing

The integration of blockchain technology with Access Control (AC) systems presents novel opportunities for enhancing data security within decentralized architectures, which is drawing increasing attention in Data Sharing (DS) applications. However, existing works reveal a gap in achieving accountability for anonymous access in the absence of a centralized trusted authority. To address this issue, this paper introduces InvisiReveal, a novel Blockchain-Based AC (BBAC) framework that achieves permission invisibility, access anonymity, and accountability without extra trust assumptions. Users in InvisiReveal generate anonymous credentials to authenticate their requests using Zero Knowledge Proof. To enable accountability, a novel blockchain-oriented verifiable commitment (BC-VC) protocol is designed that allows a user to commit a confidential traceable tag to the blockchain. The system could unveil a malicious requester’s identity by opening the tag commitment under collaboration with the victim user and blockchain. We implement a prototype of InvisiReveal to evaluate its practicality, where an access request is verified within 5 ms.

Research on ZKP Algorithm of Data Asset Security and Privacy Protection Based on Blockchain Technology

Zero Knowledge Proof (ZKP) is a very effective method of preserving privacy as it hides the most confidential information throughout the transaction. In this paper, we present a security and privacy-preserving approach for blockchain that relies on account and multi-data asset models using the Zero Knowledge Proof (ZKP) mechanism. We provide options for transferring data assets and detecting duplicate expenditures, and we also develop transaction structures, anonymised addresses and anonymised metadata for the data assets. To create and validate the ZKP, we use the zk-SNARKs algorithm and specify validation criteria for masked transactions, and finally conduct experimental tests to validate it. Creating better algorithms for ZKP will be the focus of our future efforts.

Optimizing and Implementing Fischlin's Transform for UC-Secure Zero Knowledge

Fischlin's transform (CRYPTO 2005) is an alternative to the Fiat-Shamir transform that enables straight-line extraction when proving knowledge. In this work we focus on the problem of using the Fischlin transform to construct UC-secure zero-knowledge from Sigma protocols, since UC security – that guarantees security under general concurrent composition – requires straight-line (non-rewinding) simulators. We provide a slightly simplified transform that is much easier to understand, and present algorithmic and implementation optimizations that significantly improve the running time. It appears that the main obstacles to the use of Fischlin in practice is its computational cost and implementation complexity (with multiple parameters that need to be chosen). We provide clear guidelines and a simple methodology for choosing parameters, and show that with our optimizations the running-time is far lower than expected. For just one example, on a 2023 MacBook, the cost of proving the knowledge of discrete log with Fischlin is only 0.41ms (on a single core). This is 15 times slower than plain Fiat-Shamir on the same machine, which is a significant multiple but objectively not significant in many applications. We also extend the transform so that it can be applied to batch proofs, and show how this can be much more efficient than individually proving each statement. We hope that this paper will both encourage and help practitioners implement the Fischlin transform where relevant.

ZKAV:Zero Knowledge proof for AV

This study investigates how blockchain technology can be used in the automotive industry and society, with a focus on addressing privacy concerns and compliance issues. The study investigates the application of privacy-preserving methods, including zero-knowledge proofs and anonymous credentials, to protect vehicle data shared with servers and prevent V2X channel spam. The proposed blockchain ecosystem involves collaborations among stakeholders like governmental bodies and automotive industry participants to ensure user privacy, implementation employs Ethereum[5], circom, and ezkl for practical realization, the study demonstrates the potential of blockchain and [7] Zero Knowledge Proofs in overcoming challenges, promoting a more secure digital environment.

Enhancing privacy and security in 5G networks with an anonymous handover protocol based on Blockchain and Zero Knowledge Proof

The latest advancement in cellular technology, 5G, has the ability to facilitate various applications such as Device-to-Device (D2D) communication, vehicular communications, and the Internet of Everything (IoE). However, the technology is faced with challenges related to user privacy, resource management, handover authentication, and security of the air interface and internet channels. Moreover, the use of specialized base stations such as wireless Access Points (AP) and Road-Side Units (RSU) in vehicular communications may be owned by subscribers outside formal network operators. The conventional handover authentication schemes have a lengthy latency period that conflicts with the 5G quality of service. To tackle these challenges, this paper presents an anonymous scheme that utilizes Blockchain and Zero Knowledge Proof (ZKP) to ensure efficient privacy in the handover protocol of 5G Networks. The proposed scheme has been thoroughly evaluated for security and privacy and has shown to be resistant to identity catching, location area tracing, and replay attacks while achieving Forward/Backward secrecy. Furthermore, the performance evaluation of the proposed scheme indicates that it is efficient and speedy as it involves a limited number of messages, low computation, and does not necessitate the involvement of the Home Network (HN) in the authentication or handover protocols. A diligently crafted BAHO authentication protocol, following cryptographic principles, guarantees robust security against the Real-or-Random model. This results in a seamless and secure transition for User Equipment, upholding confidentiality, integrity, and authenticity during handovers between Access Points.

Static Program Analysis for IoT Risk Mitigation in Space-Air-Ground Integrated Networks

The space-air-ground integrated networks(SAGINs) are pivotal for modern communication and surveillance, with a growing number of connected devices. The proliferation of IoT devices within these networks introduces new risks due to potential erroneous synergistic interactions that could compromise system integrity and security. This paper addresses the challenges in coordination, synchronization, and security within SAGINs by introducing a novel static program analysis (SPA) technique using zero-knowledge (ZK) proofs. This approach ensures the detection of risky interactions without compromising sensitive source code, thus safeguarding intellectual property and privacy. The proposed method overcomes the incompatibility between SPA and ZK systems by developing an imperative programming language for SAGINs and a specialized abstract domain for interaction threats. The system translates network control algorithms into arithmetic circuits suitable for ZK analysis, maintaining high accuracy in detecting risks. Evaluations on real-world scenarios demonstrate the system's efficacy in identifying risky interactions with minimal computational overhead. This research presents the first ZK-based SPA scheme for SAGINs, enhancing security and confidentiality in network analysis while adhering to privacy regulations.

From P Versus NP to Probabilistic and Zero Knowledge Proof Systems

From P Versus NP to Probabilistic and Zero Knowledge Proof Systems

Incentivized Coordinated Heat-Electricity-Gas Dispatch: A Zero Knowledge Proof-Based Solution Considering Privacy and Anti-Forgery

Incentivized Coordinated Heat-Electricity-Gas Dispatch: A Zero Knowledge Proof-Based Solution Considering Privacy and Anti-Forgery

Research on Zero knowledge with machine learning

This research paper explores the intersection of zero-knowledge proofs (ZKPs) and machine learning (ML), presenting a comprehensive overview of recent advancements, applications, and challenges in this fast growing area. The jointers of ZKPs and ML techniques shall go a meter further to fuse privacy, security, and integrity in a number of solutions, which include forming of groups for data sharing and safe machine learning. Through the investigation of the well-respected sites in that area and also the thorough description of formulas and their experimental outcome, this paper looks for the clarification of the current state of affairs and the possible future directions of ZKPs in the AI world. By inserting the verification mechanism of ZKPs into machine learning ecosystem, it allows devising novel solutions for the problems of privacy and confidentiality that have for long been not solved. With this approach, the concatenation of parties collectively performs the process of dealing with private inputs without revealing any of these data and this, in return, opens the possibilities of secure multi-party computation. Furthermore, ZKPs protect data sharing as it gives people the opportunity to construct confidential data and share them to model training without compromising any one’s private details. Being a part of the dynamic conversations, which focus on the game-changing capacity of transparent zero-knowledge proofs (ZKPs), this paper brings the role of ZKPs in preserving the confidentiality and integrity of artificial intelligence (AI) applications into the centre of attention. As scientists still fight to improve protocols and circumvent computational complications, ZKPs are likely to establishment as critical tools in the effort to increase ML systems in the digital sphere.

Differential Fault Attacks on Privacy Protocols Friendly Symmetric-Key Primitives: RAIN and HERA

As the practical applications of fully homomorphic encryption (FHE), secure multi-party computation (MPC) and zero-knowledge (ZK) proof continue to increase, so does the need to design and analyze new symmetric-key primitives that can adapt to these privacy-preserving protocols. These designs typically have low multiplicative complexity and depth with the parameter domain adapted to their application protocols, aiming to minimize the cost associated with the number of nonlinear operations or the multiplicative depth of their representation as circuits. In this paper, we propose two differential fault attacks against a one-way function RAIN used for Rainier (CCS 2022), a signature scheme based on the MPC-in-the-head approach and an FHE-friendly cipher HERA used for the RtF framework (Eurocrypt 2022), respectively. We show that our attacks can recover the keys for both ciphers by only injecting a fault into the internal state and requiring only one normal and one faulty ciphertext blocks. Thus, we can use only the practical complexity of 226.6/228.8/230.4 bit operations to break the full-round RAIN with 128/192/256-bit keys. For full-round HERA with 80/128-bit key, our attack is practical with complexity the complexity of 220 encryptions with about 216 memory.

An intrinsic integrity-driven rating model for a sustainable reputation system

In the era of digital markets, the challenge for consumers is discerning quality amidst information asymmetry. While traditional markets use brand mechanisms to address this issue, transferring such systems to internet-based P2P markets – where misleading practices like fake ratings are rampant – remains challenging. Current internet platforms strive to counter this through verification algorithms, but these efforts find themselves in a continuous tug-of-war with counterfeit actions.Exploiting the transparency, immutability, and traceability of blockchain technology, this paper introduces a robust reputation voting system grounded in it. Unlike existing blockchain-based reputation systems, our model harnesses an intrinsically economically incentivized approach to bolster agent integrity. We optimize this model to mirror real-world user behavior, preserving the reputation system’s foundational sustainability. Through Monte-Carlo simulations, using both uniform and power-law distributions enabled by an innovative inverse transform method, we traverse a broad parameter landscape, replicating real-world complexity. The findings underscore the promise of a sustainable, transparent, and formidable reputation mechanism. Given its structure, our framework can potentially function as a universal, sustainable oracle for offchain-onchain bridging, aiding entities in perpetually cultivating their reputation. Future integration with technologies like Ring Signature and Zero Knowledge Proof could amplify the system’s privacy facets, rendering it particularly influential in the ever-evolving digital domain.

A privacy-preserving key transmission protocol to distribute QRNG keys using zk-SNARKs

High-entropy random numbers are an essential part of cryptography, and Quantum Random Number Generators (QRNG) are an emergent technology that can provide high-quality keys for cryptographic algorithms but unfortunately are currently difficult to access. Existing Entropy-as-a-Service solutions require users to trust the central authority distributing the key material, which is not desirable in a high-privacy environment. In this paper, we present a novel key transmission protocol that allows users to obtain cryptographic material generated by a QRNG in such a way that the server is unable to identify which user is receiving each key. This is achieved with the inclusion of Zero Knowledge Succinct Non-interactive Arguments of Knowledge (zk-SNARK), a cryptographic primitive that allow users to prove knowledge of some value without needing to reveal it. The security analysis of the protocol proves that it satisfies the properties of Anonymity, Unforgeability and Confidentiality, as defined in this document. We also provide an implementation of the protocol demonstrating its functionality and performance, using NFC as the transmission channel for the QRNG key.

Enhancing Industrial IoT Network Security through Blockchain Integration

In the rapidly evolving landscape of industrial ecosystems, Industrial IoT networks face increasing security challenges. Traditional security methods often struggle to protect these networks adequately, posing risks to data integrity, confidentiality, and access control. Our research introduces a methodology that leverages blockchain technology to enhance the security and trustworthiness of IoT networks. This approach starts with sensor nodes collecting and compressing data, followed by encryption using the ChaCha20-Poly1305 algorithm and transmission to local aggregators. A crucial element of our system is the private blockchain gateway, which processes and classifies data based on confidentiality levels, determining their storage in cloud servers or the Interplanetary File System for enhanced security. The system’s integrity and authenticity are further reinforced through the proof of authority consensus mechanism. This system employs Zero Knowledge Proof challenges for device authorization, optimizing data retrieval while maintaining a delicate balance between security and accessibility. Our methodology contributes to mitigating vulnerabilities in Industrial IoT networks and is part of a broader effort to advance the security and operational efficiency of these systems. It reflects an understanding of the diverse and evolving challenges in IoT security, emphasizing the need for continuous innovation and adaptation in this dynamic field.

Machine Learning and Zero Knowledge Empowered Trustworthy Bitcoin Mixing for Next-G Consumer Electronics Payment

Machine Learning and Zero Knowledge Empowered Trustworthy Bitcoin Mixing for Next-G Consumer Electronics Payment

Temporal ECDSA: A timestamp and signature mask enabled ECDSA algorithm for IoT client node authentication

Internet of Things (IoT) networks are vulnerable to various security threats, especially in client authentication. The current authentication methods require significant resources and are vulnerable to specific attacks. The Non-Interactive Zero Knowledge Proof (NIZKP) concept suits IoT device authentication. Elliptic Curve Digital Signature (ECDSA) is a popular algorithm for IoT device authentication based on elliptic curve cryptography (ECC) and NIZKP. However, an intelligent attacker who captures the ECDSA signatures generated by the same random number can recover the private key. This paper proposes a timestamp based approach to prevent signature reuse and fake signature generation in the ECDSA algorithm. The signature proof is generated differently at each occurrence to prevent the generation of valid signatures from leaked private keys. The proposed approach eliminates the expensive modular inversion operations in signature generation and verification phases, enhancing execution efficiency. The analysis results indicate that the proposed Temporal ECDSA algorithm effectively prevents most attacks on client authentication in IoT networks. Various metrics, including computational complexity and security measures, were used to evaluate the effectiveness of the proposed approach, demonstrating that it outperforms most ECDSA variants.

Chebyshev polynomial approximation in CNN for zero-knowledge encrypted data analysis

Integrating Deep Learning (DL) techniques in Convolutional Neural Networks (CNNs) with encrypted data analysis is an emerging field for enhancing data privacy and security. A significant challenge in this domain is the incompatibility of standard non-linear Activation Functions (AF) like Rectified Linear Unit (ReLU) and Hyperbolic Tangent (tanh) with Zero-Knowledge (ZK) encrypted data, which impacts computational efficiency and data privacy. Addressing this, our paper introduces the novel application of Chebyshev Polynomial Approximation (CPA) to adapt these AF to process encrypted data effectively. Utilizing the MNIST dataset, this paper conducted experiments with LeNet and various configurations of AlexNet, extending the range of the ReLU and tanH functions to optimize CPA. Our results reveal an optimal polynomial degree (α), with α = 10 for ReLU and between α = 10 and α = 15 for tanH, beyond which the benefits in accuracy plateau. This finding is crucial for ensuring the accuracy and efficiency of CNNs in processing encrypted data. This recommended study demonstrates that while the accuracy slightly decreases for plaintext data and more significantly for ciphertext data, the overall effectiveness of CPA in CNNs is maintained. This advancement enables CNNs to process encrypted data while preserving privacy and marks a significant step in developing privacy-preserving Machine Learning (ML) and encrypted data analysis.