Latest Breaking News On - Hash functions - Page 1 : comparemela.com

Polynomial commitment schemes (PCS) are fundamental components that can effectively solve the problems arising from the combination of IoT and blockchain. These allow a committer to commit to a polynomial and then later evaluate the committed polynomial at an arbitrary challenge point along with a proof of valid, without revealing any additional information about the polynomial. Recent works have presented polynomial commitment schemes based on the discrete logarithm assumption. Their schemes do not require a trusted setup, and the verifier uses homomorphism to check the polynomial evaluation proofs. However, these schemes require two-party interactions and satisfy only special soundness and special honest verifier zero-knowledge, which are infeasible for some non-simultaneous online or decentralized applications. In this paper, we propose a novel polynomial commitment scheme inspired by the idea of the Fiat-Shamir heuristic. Our scheme is non-interactive between the committer and the

Complexity theoryIscrete logarithm assumptionHash functionsNternet of thingsOn interactivityPedersen commitmentOlynomial commitmentRobabilistic logicRapdoor commitment scheme