Implementation of the paper Fast Secure Two-Party ECDSA Signing by Yehuda Lindell.
In addition to the standard Two-Party ECDSA implementation it also comes with an Adaptor Signature variant that follows the paper Anonymous Multi-Hop Locks for Blockchain Scalability and Interoperability by Malavolta et al.
Generated ECDSA signatures carry a recovery bit which can be used to recover the public key from the signature.
An interactive proof allows one to prove that a value encrypted using the Paillier Cryptosystem is the encryption of a discrete logarithm.
git clone <url>asdf install(optional)go test -count 1 -race ./...
go run <package-path>
go build [<package-path>]
go test [<package-path>][/...] [-v] [-cover] [-race] [-short] [-parallel <number>]
go test -bench=. [<package-path>] [-count <number>] [-benchmem] [-benchtime 2s] [-memprofile <name>]
go test -coverprofile <name> [<package-path>]
go tool cover -html <name>
go tool cover -func <name>
go fmt [<package-path>]
go mod init [<module-path>]
go mod tidy