Crypto.Lol.Applications.KeyHomomorphicPRF

Key-homomorphic PRF from [BP14].

Documentation

data FBT

Constructors

Leaf

Intern FBT FBT

Instances

SingKind FBT

Defined in Crypto.Lol.Applications.KeyHomomorphicPRF

Associated Types

type Demote FBT = (r :: Type)

Methods

fromSing :: Sing a -> Demote FBT

toSing :: Demote FBT -> SomeSing FBT

SingI Leaf

Defined in Crypto.Lol.Applications.KeyHomomorphicPRF

Methods

sing :: Sing Leaf

(SingI n1, SingI n2) => SingI (Intern n1 n2 :: FBT)

Defined in Crypto.Lol.Applications.KeyHomomorphicPRF

Methods

sing :: Sing (Intern n1 n2)

SingI d => SingI (TyCon1 (Intern d) :: FBT ~> FBT)

Defined in Crypto.Lol.Applications.KeyHomomorphicPRF

Methods

sing :: Sing (TyCon1 (Intern d))

SingI (TyCon2 Intern)

Defined in Crypto.Lol.Applications.KeyHomomorphicPRF

Methods

sing :: Sing (TyCon2 Intern)

data Sing (a :: FBT)

Defined in Crypto.Lol.Applications.KeyHomomorphicPRF

data Sing (a :: FBT) where

• SLeaf :: forall (a :: FBT). Sing Leaf
• SIntern :: forall (a :: FBT) (n :: FBT) (n :: FBT). Sing n -> Sing n -> Sing (Intern n n)

type Demote FBT

Defined in Crypto.Lol.Applications.KeyHomomorphicPRF

type Demote FBT = FBT

type SFBT = (Sing :: FBT -> Type)

type family SizeFBT (a :: FBT) :: Pos where ...

Equations

SizeFBT Leaf = OSym0

SizeFBT (Intern l r) = Apply (Apply AddPosSym0 (Apply SizeFBTSym0 l)) (Apply SizeFBTSym0 r)

type FBTC (t :: FBT) = SingI t

Kind-restricted type synonym for SingI

singFBT :: FBTC t => SFBT t

Kind-restricted synonym for sing

data PRFKey n a

A PRF secret key of dimension n over ring a.

data PRFParams n gad a

PRF public parameters for an n-dimension secret key over a, using a gadget indicated by gad.

data PRFState t n gad rq

PRF state for tree topology t with key length n over a, using gadget indicated by gad.

genKey :: forall rq rnd n. (MonadRandom rnd, Random rq, Reflects n Int) => rnd (PRFKey n rq)

Generate an n-dimensional secret key over rq.

genParams :: forall gad rq rnd n. (MonadRandom rnd, Random rq, Reflects n Int, Gadget gad rq) => rnd (PRFParams n gad rq)

Generate public parameters (( mathbf{A}_0 ) and ( mathbf{A}_1 )) for n-dimensional secret keys over a ring rq for gadget indicated by gad.

prf

Arguments

:: (Rescale rq rp, Decompose gad rq)

=> SFBT t

singleton for the tree \( T \)

-> PRFParams n gad rq

public parameters

-> PRFKey n rq

secret key \( s \)

-> BitString (SizeFBT t)

input \( x \)

-> Matrix rp

Fresh PRF computation, with no precomputed PRFState.

prfState

Arguments

:: (Rescale rq rp, Decompose gad rq)

=> SFBT t

singleton for the tree \( T \)

-> PRFParams n gad rq

public parameters

-> PRFKey n rq

secret key \( s \)

-> BitString (SizeFBT t)

input \( x \)

-> (Matrix rp, PRFState t n gad rq)

Fresh PRF computation that also outputs the resulting PRFState.

prfAmortized

Arguments

:: (Rescale rq rp, Decompose gad rq, MonadState (Maybe (PRFState t n gad rq)) m)

=> SFBT t

singleton for the tree \( T \)

-> PRFParams n gad rq

public parameters

-> PRFKey n rq

secret key \( s \)

-> BitString (SizeFBT t)

input \( x \)

-> m (Matrix rp)

PRF output

Amortized PRF computation for a given secret key and input. The output is in a monadic context that keeps a PRFState state for efficient amortization across calls.

run :: State (Maybe (PRFState t n gad rq)) a -> a

Run a PRF computation with some public parameters. E.g.: run top params (prf key x)

runT :: Monad m => StateT (Maybe (PRFState t n gad rq)) m a -> m a

More general (monad transformer) version of run.

data Vector n a

Canonical type-safe sized vector

Instances

PosC n => Enum (Vector n Bool)

Enumerates according to the n-bit Gray code, starting with all False

Defined in Crypto.Lol.Applications.KeyHomomorphicPRF

Methods

succ :: Vector n Bool -> Vector n Bool

pred :: Vector n Bool -> Vector n Bool

toEnum :: Int -> Vector n Bool

fromEnum :: Vector n Bool -> Int

enumFrom :: Vector n Bool -> [Vector n Bool]

enumFromThen :: Vector n Bool -> Vector n Bool -> [Vector n Bool]

enumFromTo :: Vector n Bool -> Vector n Bool -> [Vector n Bool]

enumFromThenTo :: Vector n Bool -> Vector n Bool -> Vector n Bool -> [Vector n Bool]

Eq a => Eq (Vector n a)

Defined in Crypto.Lol.Applications.KeyHomomorphicPRF

Methods

(==) :: Vector n a -> Vector n a -> Bool

(/=) :: Vector n a -> Vector n a -> Bool

Show a => Show (Vector n a)

Defined in Crypto.Lol.Applications.KeyHomomorphicPRF

Methods

showsPrec :: Int -> Vector n a -> ShowS

show :: Vector n a -> String

showList :: [Vector n a] -> ShowS

PosC n => Enumerable (Vector n Bool)

Defined in Crypto.Lol.Applications.KeyHomomorphicPRF

Methods

values :: [Vector n Bool]

type BitString n = Vector n Bool

An n-dimensional Vector of Bools

replicate :: forall n a. PosC n => a -> Vector n a

Create a Vector full of given value

replicateS :: SPos n -> a -> Vector n a

Alternative form of replicate

fromList :: forall n a. PosC n => [a] -> Maybe (Vector n a)

Convert a list to a Vector, return Nothing if lengths don't match

fromListS :: SPos n -> [a] -> Maybe (Vector n a)

split :: forall m n a. PosC m => Vector (m `AddPos` n) a -> (Vector m a, Vector n a)

Split a Vector into two

splitS :: SPos m -> Vector (m `AddPos` n) a -> (Vector m a, Vector n a)

Alternative form of split