Crypto.Lol.Applications.KeyHomomorphicPRF

Key-homomorphic PRF from [BP14].

Documentation

data FullBinTree

Full binary tree.

Constructors

L

I Int FullBinTree FullBinTree

Instances

NFData FullBinTree

Methods

rnf :: FullBinTree -> ()

evalTree :: Int -> PRFState rq rp -> (Matrix rq, PRFState rq rp)

Evaluates the tree at the new input, reusing as much prior work as possible.

randomTree :: MonadRandom rnd => Int -> rnd FullBinTree

Given the desired number of leaves, produces a random full binary tree.

balancedTree :: Int -> FullBinTree

Given the desired number of leaves, produces a full binary tree which is complete, except possibly for the last level, which is left-biased.

leftSpineTree :: Int -> FullBinTree

Given the desired number of leaves, produces a full binary right-spine tree.

rightSpineTree :: Int -> FullBinTree

Given the desired number of leaves, produces a full binary left-spine tree.

data PRFFamily gad rq rp

Parameters for PRF

Instances

NFData rq => NFData (PRFFamily gad rq rp)

Methods

rnf :: PRFFamily gad rq rp -> ()

makeFamily :: forall rq rp gad. Gadget gad rq => Matrix rq -> Matrix rq -> FullBinTree -> PRFFamily gad rq rp

Smart constructor

randomFamily :: forall gad rnd rq rp. (MonadRandom rnd, Random rq, Gadget gad rq) => Int -> rnd (PRFFamily gad rq rp)

Randomly generate ring-based PRF family.

grayCode :: Int -> [Int]

Constructs an n-bit Gray code, useful for efficiently evaluating the PRF.

data PRFState rq rp

State of the PRF computation. This permits incremental computation.

Instances

NFData rq => NFData (PRFState rq rp)

Methods

rnf :: PRFState rq rp -> ()

prfState :: forall gad rq rp. Decompose gad rq => PRFFamily gad rq rp -> Maybe Int -> PRFState rq rp

Given PRF parameters and an optional inital input value (default is 0), produces an initial PRF state.

latticePRF :: Rescale zq zp => Matrix zq -> Int -> PRFState zq zp -> Matrix zp

Single-ouptut lattice PRF.

latticePRFM :: (MonadState (PRFState zq zp) mon, Rescale zq zp) => Matrix zq -> Int -> mon (Matrix zp)

Multi-output lattice PRF with monadic memoized internal state.

ringPRF :: (Fact m, RescaleCyc (Cyc t) zq zp, Ring rq, rq ~ Cyc t m zq, rp ~ Cyc t m zp) => rq -> Int -> PRFState rq rp -> Matrix rp

Single-output ring PRF.

ringPRFM :: (MonadState (PRFState rq rp) mon, Fact m, RescaleCyc (Cyc t) zq zp, Ring rq, rq ~ Cyc t m zq, rp ~ Cyc t m zp) => rq -> Int -> mon (Matrix rp)

Multi-output ring PRF with monadic memoized internal state.