-
At section 5.1. DLEQ_Generate
~~~
4. s := (r - ck) (mod p)
~~~
It must be reduced modulo the order of the curve.
-
Hi,
Don't know if it's a duplicate of #11 , but is there a way to create a n/m multi-sign address for substrate(consequently polkadot)?
The test in mul.rs requires all singers present, but for s…
-
Congrats for the great repo!
Here is a suggestion:
What about an implementation of a Verifiable Random Function using the secp256k1 curve?
Having a secure VRF in this library, or as a separat…
-
At the end of the London meetup we discussed a potential problem: malicious clients can send a bad copath (e.g. just random group elements), which will totally screw up the group state of anyone who p…
-
# Context
To calculate a pool's performance in the current epoch, we need to count how many blocks it actually produced.
We can count them using the proofs in Jörmungandr block-headers:
> In …
-
We currently only support SHAKE but we should also support SHA2-based PRNGs via HKDF (in case that SHAKE is not available at the server-side).
-
When buliding [plutus](https://github.com/input-output-hk/plutus/tree/plutus-core/verify-signature), I can run `cabal new-build exe:plc` without any problems. However, `cabal new-install exe:plc` fail…
-
-
The draft currently only covers DLEQ proof generation for input query from the client. It would be good to integrate the batching mechanism that we use in Privacy Pass when the client makes n>1 input …
-