You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hi! Nice work and concept. However, as all interactive protocol could be transformed in a non-interactive one (using Fiat-Shamir), and as it is mentionned in the whitepaper that it is possible, I want to know:
What are the modifications we have to do on the current implementation to make it non-interactive? Or Will there be a future release implementing a non-interactive version?
Thank's in advance
The text was updated successfully, but these errors were encountered:
This version is not very far from a full noninteractive version. To change it to be noninteractive one should change the query generation algorithm in the verifier, where queries are currently generated prior to any interaction, and in particular independent of the commitments sent by the prover. Changing those to use a PRG seeded by prover's commitments, should basically do the trick.
(In addition to separation of prover and verifier to different executables, writing all communication from prover to verifier into a file, and simulating communication on both sides for proof generation and verification).
Hi! Nice work and concept. However, as all interactive protocol could be transformed in a non-interactive one (using Fiat-Shamir), and as it is mentionned in the whitepaper that it is possible, I want to know:
What are the modifications we have to do on the current implementation to make it non-interactive? Or Will there be a future release implementing a non-interactive version?
Thank's in advance
The text was updated successfully, but these errors were encountered: