README
¶
Threshold ECDSA
This package is an implementation of t-of-n threshold signature of One Round Threshold ECDSA with Identifiable Abort.
It supports tECDSA with two different key generation approaches:
- key generation with a trusted dealer and
- distributed key generation.
Directories
¶
| Path | Synopsis |
|---|---|
|
Package dealer is an implementation of the `dealer` mode of https://eprint.iacr.org/2020/540.pdf
|
Package dealer is an implementation of the `dealer` mode of https://eprint.iacr.org/2020/540.pdf |
|
Package participant is an implementation of a `participant` in the t-of-n threshold signature of https://eprint.iacr.org/2020/540.pdf
|
Package participant is an implementation of a `participant` in the t-of-n threshold signature of https://eprint.iacr.org/2020/540.pdf |
|
Package proof contains the following implementations - proof of discrete logarithm (PDL) subprotocol from [spec] §8 - multiplicative-to-additive (MtA) subprotocol from [spec] §7 - proof of knowledge of a discrete log modulo a composite (fig 16), i.e., ProveCompositeDL and VerifyCompositeDL
|
Package proof contains the following implementations - proof of discrete logarithm (PDL) subprotocol from [spec] §8 - multiplicative-to-additive (MtA) subprotocol from [spec] §7 - proof of knowledge of a discrete log modulo a composite (fig 16), i.e., ProveCompositeDL and VerifyCompositeDL |
Click to show internal directories.
Click to hide internal directories.