3
votes
Accepted
Verifiable OPRF from general ZKP?
No, you cannot build VOPRFs from ZKP, because VOPRFs are stronger than OPRFs which imply key exchange, and ZKPs are essentially equivalent to OWFs. Basing key exchange on the existence of OWFs is ...
- 20.8k
2
votes
Accepted
Small proofs for large sums
No, we can't verify the relation $x = x_1+\cdots+x_n$ in less than $\mathcal O(n)$ operations. This holds even with some of the work offloaded to an helper, unless we trust them.
Argument (without a ...
- 144k
1
vote
Accepted
How do non-Turing complete languages like Clarity support sha256 hashing, which internally relies on loops?
The loops in SHA, AES, and pretty much all ciphers used in modern IT security can all be un-rolled, as their loop condition don't depend on input data.
Take SHA-256 for example, it's compression ...
- 9,672
Only top scored, non community-wiki answers of a minimum length are eligible