Non-interactive Arguments Of Knowledge Research Articles

Security and Privacy in Connected Vehicle Cyber Physical System Using Zero Knowledge Succinct Non Interactive Argument of Knowledge over Blockchain

Security has been the most widely researched topic, particularly within IoT, and has been considered as the major hurdle in the adoption of different applications of IoT. When it comes to IoV, security is considered as the most inevitable component to ensure a safe and smooth driving experience. CAV is the new era of transportation, integrating intelligence and self-driving capabilities within vehicles and that requires strong security measures to ensure safety. Security alone is not enough. Instead, a complete package including privacy of the vehicles and passengers needs to be added in addition to secure communication. This is because CAVs are under continuous cyber threats and attacks and the most important among them is the DDoS, where a remote attacker can hijack/launch attacks on vehicles remotely. Single point of failure attacks target the centralized trusted body in order to mislead the connected vehicles for personal gains. In this paper, the authors have proposed a secure communication system for CAVs using blockchain, which also ensures the privacy of the vehicle/people. The paper highlights the major components of the proposed system, and its performance is evaluated to check its efficiency against DDoS and Eclipse attacks. The unlinkability and anonymity of the vehicles have been ensured using the zk-SNAKR protocol over Blockchain.

A Blockchain-Based Secure Radio Frequency Identification Ownership Transfer Protocol

Supply chain management (SCM) governance is the streamline of the IoT product life cycle from its production to delivery. Integrating blockchain with supply chain management is essential to ensure end-to-end tracking, trustiness between manufacturers and customers, fraud and counterfeit elimination, and customizing administrative costs and paperwork. This paper proposes an RFID ownership transfer protocol with the help of zk-SNARKs (Zero Knowledge-Succinct Noninteractive Arguments of Knowledge) using Ethereum blockchain. When the owner performs RFID transfer, the transferred information will be recorded on the blockchain using smart contracts. When using a smart contract to transfer ownership on the Ethereum blockchain, because the content on the blockchain will not be tampered with, all accounts in the Ethereum can view the transfer results and verify them. The privacy of the supply chain is attained by generating the proof of product code via zk-SNARKs algorithm. This algorithm also enhances the scalability of the supply chain system by creating a trusted setup in off-chain mode.

An Approach to the Construction of a Recursive Argument of Polynomial Evaluation in the Discrete Log Setting

Succinct Non-interactive Arguments of Knowledge (SNARks) are receiving a lot of attention as a core privacy-enhancing technology for blockchain applications. Polynomial commitment schemes are important building blocks for the construction of SNARks. Polynomial commitment schemes enable the prover to commit to a secret polynomial of the prover and convince the verifier that the evaluation of the committed polynomial is correct at a public point later. Bünz et al. recently presented a novel polynomial commitment scheme with no trusted setup in Eurocrypt’20. To provide a transparent setup, their scheme is built over an ideal class group of imaginary quadratic fields (or briefly, class group). However, cryptographic assumptions on a class group are relatively new and have, thus far, not been well-analyzed. In this paper, we study an approach to transpose Bünz et al.’s techniques in the discrete log setting because the discrete log setting brings a significant improvement in efficiency and security compared to class groups. We show that the transposition to the discrete log setting can be obtained by employing a proof system for the equality of discrete logarithms over multiple bases. Theoretical analysis shows that the transposition preserves security requirements for a polynomial commitment scheme.