ZK-STARK: Mathematical Foundations and Applications in Blockchain Supply Chain Privacy

Privacy is one of the major security concerns. The zero-knowledge proof enables the transmission of data from the sender to the receiver without disclosing the actual content of the data. The proposed work uses the ZK-STARK (Zero-Knowledge Scalable Transparent ARgument of Knowledge) Algorithm for transaction privacy in the organic jaggery supply chain. The paper emphasizes a detailed mathematical model, involving two key participants: the prover (food processor) and the verifier (distributor). The prover calculates the polynomial for the problem, its composition polynomial, and provides its Merkle proof to the verifier. The verifier conducts queries to confirm and validate the accuracy of the information. Using the fast reed-solomon interactive oracle proofs protocol, the proof is validated. It measures performance as proof generation and verification time, proof size, and throughput. Plans involve increasing the domain size of this algorithm, varying the polynomial interpolation, and evaluating its performance measures by integrating it into Blockchain.