"Efficient Non-Interactive Polynomial Commitment Scheme in the Discrete" by Peiheng Zhang, Min Tang et al.
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...
Complexity Theory Iscrete Logarithm Assumption Hash Functions Nternet Of Things On Interactivity Pedersen Commitment
Source: uow.edu.au