grotto_dcf.cuh File Reference

2-party distributed comparison function (DCF) over F2 from standard DPF. More...

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

Go to the source code of this file.

Classes
class	fss::GrottoDcf< in_bits, Prg, In, par_depth >
	2-party DCF scheme over F2 from standard DPF (Grotto construction). More...
struct	fss::GrottoDcf< in_bits, Prg, In, par_depth >::ParityTree
	Parity segment tree over leaf control bits. More...

Detailed Description

2-party distributed comparison function (DCF) over F2 from standard DPF.

Copyright

Apache License, Version 2.0. Copyright (C) 2026 Yulong Ming i@myl.nosp@m.7.or.nosp@m.g.

Author

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

The scheme is from the paper, Grotto: Screaming fast (2+1)-PC for Z{2^n} via (2,2)-DPFs_ (1: the published version).

Key generation is identical to standard BGI DPF. The comparison functionality emerges from prefix-parity of the DPF control bits.

Output shares are in F2 (XOR sharing). Each party holds a single bool per query. For inputs x: share_0 XOR share_1 = 1[alpha <= x].

References

1. Kyle Storrier, Adithya Vadapalli, Allan Lyons, Ryan Henry: Grotto: Screaming fast (2+1)-PC for Z_{2^n} via (2, 2)-DPFs. CCS 2023: 2143-2157. https://doi.org/10.1145/3576915.3623147. https://eprint.iacr.org/2023/108.