myl7/fss 1.1.0
Function secret sharing (FSS) primitives including distributed point/comparison function (DPF/DCF)
Loading...
Searching...
No Matches
fss::GrottoDcf< in_bits, Prg, In, par_depth >::ParityTree Struct Reference

Parity segment tree over leaf control bits. More...

Public Attributes

bool * p
 
bool b
 

Detailed Description

template<int in_bits, typename Prg, typename In = uint, int par_depth = -1>
struct fss::GrottoDcf< in_bits, Prg, In, par_depth >::ParityTree

Parity segment tree over leaf control bits.

p[0..2N-2]: level-order binary tree where N = 2^in_bits. Root is p[0]. Leaf x has index p[x + N - 1]. Internal node j: p[j] = p[2j+1] XOR p[2j+2].

b: party index, needed for reconstructing comparison results.


The documentation for this struct was generated from the following file: