Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. rGetK2Map :: RPhase3Msg -> K2Map

   pedersen-commitment	MICP

   No documentation available.

2. type DMap = Map Int Integer

   pedersen-commitment	MICP.Internal

   No documentation available.

3. type GtoK1Map = Map Int Integer

   pedersen-commitment	MICP.Internal

   No documentation available.

4. type GtoK2Map = Map Int Integer

   pedersen-commitment	MICP.Internal

   No documentation available.

5. type K1Map = Map Int Integer

   pedersen-commitment	MICP.Internal

   No documentation available.

6. type K2Map = Map Int Integer

   pedersen-commitment	MICP.Internal

   No documentation available.

7. computeDMap :: Integer -> K1Map -> Integer -> DMap

   pedersen-commitment	MICP.Internal

   4(c),5(c): computes d_i = c*k_i + r

8. genKMaps :: forall (m :: Type -> Type) . MonadRandom m => [Word8] -> SPFM m (K1Map, K2Map)

   pedersen-commitment	MICP.Internal

   2(b), 3(a): Generate two integer maps where the ith entry in each map corresponds to the ith k1 and k2 values respectively such that `Hn(k1_i) xor Hn(k2_i) == byte_i`. Two maps are generated map because the values k and k' are to be exposed at different stages of the protocol.

9. kmapToGKMap :: forall (m :: Type -> Type) . Monad m => Map Int Integer -> SPFM m (Map Int Integer)

   pedersen-commitment	MICP.Internal

   Takes a Map k v and returns Map k (g^v mod p)

10. verifyDMap :: forall (m :: Type -> Type) . Monad m => DMap -> GtoK1Map -> Integer -> Integer -> SPFM m Bool

    pedersen-commitment	MICP.Internal

    5(a), 6(a): Verifies that the counterparty has not lied about their original commitment and has not tampered with the k values they used to encrypt their original message: `g^d_i == (g^k_i)^c * g^r`

Page 1203 of many | Previous | Next