TL;DR
A new and highly efficient multilin-ear polynomial commitment scheme (MLPCS) over binary fields, which is called Blaze .
The compressed permutation oracle has been used to analyze the quantum security of a number of cryptographic constructions which resisted prior techniques. However, these analyses were fundamentally limited by the poor soundness of the method: the technique was proven sound only up to $O(N^{1/12})$ queries to permutati...
Zero-knowledge (ZK) proof systems have developed rapidly in recent years, with hash functions as one of their central building blocks. Since these often dominate the prover cost, circuit-friendly hash function design has become an active research area. Most hash proposals target prime fields, although recent protocols...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
