mta

package

v0.0.0-...-0bdbdcd Latest Latest Go to latest Published: Oct 22, 2022 License: MIT Imports: 7 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

Repository

github.com/lastingasset/tss-lib

Links

Open Source Insights

Documentation ¶

Index ¶

Constants
func AliceEnd(ec elliptic.Curve, pkA *paillier.PublicKey, pf *ProofBob, ...) (*big.Int, error)
func AliceEndWC(ec elliptic.Curve, pkA *paillier.PublicKey, pf *ProofBobWC, B *crypto.ECPoint, ...) (*big.Int, error)
type ProofBob
type ProofBobWC
type RangeProofAlice

Constants ¶

View Source

const (
	ProofBobBytesParts   = 10
	ProofBobWCBytesParts = 12
)

View Source

const (
	RangeProofAliceBytesParts = 6
)

Variables ¶

This section is empty.

Functions ¶

func AliceEnd ¶

func AliceEnd(
	ec elliptic.Curve,
	pkA *paillier.PublicKey,
	pf *ProofBob,
	h1A, h2A, cA, cB, NTildeA *big.Int,
	sk *paillier.PrivateKey,
) (*big.Int, error)

func AliceEndWC ¶

func AliceEndWC(
	ec elliptic.Curve,
	pkA *paillier.PublicKey,
	pf *ProofBobWC,
	B *crypto.ECPoint,
	cA, cB, NTildeA, h1A, h2A *big.Int,
	sk *paillier.PrivateKey,
) (*big.Int, error)

Types ¶

type ProofBob ¶

type ProofBob struct {
	Z, ZPrm, T, V, W, S, S1, S2, T1, T2 *big.Int
}

func BobMid ¶

func BobMid(
	ec elliptic.Curve,
	pkA *paillier.PublicKey,
	pf *RangeProofAlice,
	b, cA, NTildeA, h1A, h2A, NTildeB, h1B, h2B *big.Int,
) (beta, cB, betaPrm *big.Int, piB *ProofBob, err error)

func ProofBobFromBytes ¶

func ProofBobFromBytes(bzs [][]byte) (*ProofBob, error)

func ProveBob ¶

func ProveBob(ec elliptic.Curve, pk *paillier.PublicKey, NTilde, h1, h2, c1, c2, x, y, r *big.Int) (*ProofBob, error)

ProveBob implements Bob's proof "ProveMta_Bob" used in the MtA protocol from GG18Spec (9) Fig. 11.

func (*ProofBob) Bytes ¶

func (pf *ProofBob) Bytes() [ProofBobBytesParts][]byte

func (*ProofBob) ValidateBasic ¶

func (pf *ProofBob) ValidateBasic() bool

func (*ProofBob) Verify ¶

func (pf *ProofBob) Verify(ec elliptic.Curve, pk *paillier.PublicKey, NTilde, h1, h2, c1, c2 *big.Int) bool

ProveBob.Verify implements verification of Bob's proof without check "VerifyMta_Bob" used in the MtA protocol from GG18Spec (9) Fig. 11.

type ProofBobWC ¶

type ProofBobWC struct {
	*ProofBob
	U *crypto.ECPoint
}

func BobMidWC ¶

func BobMidWC(
	ec elliptic.Curve,
	pkA *paillier.PublicKey,
	pf *RangeProofAlice,
	b, cA, NTildeA, h1A, h2A, NTildeB, h1B, h2B *big.Int,
	B *crypto.ECPoint,
) (beta, cB, betaPrm *big.Int, piB *ProofBobWC, err error)

func ProofBobWCFromBytes ¶

func ProofBobWCFromBytes(ec elliptic.Curve, bzs [][]byte) (*ProofBobWC, error)

func ProveBobWC ¶

func ProveBobWC(ec elliptic.Curve, pk *paillier.PublicKey, NTilde, h1, h2, c1, c2, x, y, r *big.Int, X *crypto.ECPoint) (*ProofBobWC, error)

ProveBobWC implements Bob's proof both with or without check "ProveMtawc_Bob" and "ProveMta_Bob" used in the MtA protocol from GG18Spec (9) Figs. 10 & 11. an absent `X` generates the proof without the X consistency check X = g^x

func (*ProofBobWC) Bytes ¶

func (pf *ProofBobWC) Bytes() [ProofBobWCBytesParts][]byte

func (*ProofBobWC) ValidateBasic ¶

func (pf *ProofBobWC) ValidateBasic() bool

func (*ProofBobWC) Verify ¶

func (pf *ProofBobWC) Verify(ec elliptic.Curve, pk *paillier.PublicKey, NTilde, h1, h2, c1, c2 *big.Int, X *crypto.ECPoint) bool

ProveBobWC.Verify implements verification of Bob's proof with check "VerifyMtawc_Bob" used in the MtA protocol from GG18Spec (9) Fig. 10. an absent `X` verifies a proof generated without the X consistency check X = g^x

type RangeProofAlice ¶

type RangeProofAlice struct {
	Z, U, W, S, S1, S2 *big.Int
}

func AliceInit ¶

func AliceInit(
	ec elliptic.Curve,
	pkA *paillier.PublicKey,
	a, NTildeB, h1B, h2B *big.Int,
) (cA *big.Int, pf *RangeProofAlice, err error)

func ProveRangeAlice ¶

func ProveRangeAlice(ec elliptic.Curve, pk *paillier.PublicKey, c, NTilde, h1, h2, m, r *big.Int) (*RangeProofAlice, error)

ProveRangeAlice implements Alice's range proof used in the MtA and MtAwc protocols from GG18Spec (9) Fig. 9.

func RangeProofAliceFromBytes ¶

func RangeProofAliceFromBytes(bzs [][]byte) (*RangeProofAlice, error)

func (*RangeProofAlice) Bytes ¶

func (pf *RangeProofAlice) Bytes() [RangeProofAliceBytesParts][]byte

func (*RangeProofAlice) ValidateBasic ¶

func (pf *RangeProofAlice) ValidateBasic() bool

func (*RangeProofAlice) Verify ¶

func (pf *RangeProofAlice) Verify(ec elliptic.Curve, pk *paillier.PublicKey, NTilde, h1, h2, c *big.Int) bool

Source Files ¶

View all Source files

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL