A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit <a rel="external noopener" href="https://mdpi-res.com/d_attachment/electronics/electronics-11-00131/article_deploy/electronics-11-00131.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
An Approach to the Construction of a Recursive Argument of Polynomial Evaluation in the Discrete Log Setting
<span title="2022-01-01">2022</span>
<i title="MDPI AG">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ikdpfme5h5egvnwtvvtjrnntyy" style="color: black;">Electronics</a>
</i>
Preserved Fulltext
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
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/electronics11010131">doi:10.3390/electronics11010131</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/j3wly4berffp3lmm75ihoe5olq">fatcat:j3wly4berffp3lmm75ihoe5olq</a>
</span>
more »
... mial 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.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220206162528/https://mdpi-res.com/d_attachment/electronics/electronics-11-00131/article_deploy/electronics-11-00131.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/73/2d/732d2f59dca69a41fa71812fd5fce538056cef9c.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/electronics11010131">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="unlock alternate icon" style="background-color: #fb971f;"></i>
mdpi.com
</button>
</a>