myl7/fss 1.1.0
Function secret sharing (FSS) primitives including distributed point/comparison function (DPF/DCF)
Loading...
Searching...
No Matches
half_tree_dpf.cuh File Reference

2-party distributed point function (DPF) using the Half-Tree scheme. More...

#include <cuda_runtime.h>
#include <type_traits>
#include <cstddef>
#include <cassert>
#include <omp.h>
#include <fss/group.cuh>
#include <fss/prg.cuh>
#include <fss/util.cuh>

Go to the source code of this file.

Classes

class  fss::HalfTreeDpf< in_bits, Group, Prg, In, par_depth >
 2-party DPF scheme using the Half-Tree construction. More...
 
struct  fss::HalfTreeDpf< in_bits, Group, Prg, In, par_depth >::Cw
 Correction word. More...
 

Detailed Description

2-party distributed point function (DPF) using the Half-Tree scheme.

Author
Yulong Ming i@myl.nosp@m.7.or.nosp@m.g

The scheme is from the paper, Half-Tree: Halving the Cost of Tree Expansion in COT and DPF (1: the published version). It reduces the number of hash calls from 2N to 1.5N for full-domain evaluation.

References

  1. Xiaojie Guo, Kang Yang, Xiao Wang, Wenhao Zhang, Xiang Xie, Jiang Zhang, Zheli Liu: Half-Tree: Halving the Cost of Tree Expansion in COT and DPF. EUROCRYPT (1) 2023: 330-362. https://doi.org/10.1007/978-3-031-30545-0_12. https://eprint.iacr.org/2022/1431.