Half-tree: halving the cost of tree expansion in COT and DPF

Cites Work

Unnamed Item
Unnamed Item
Efficient secure two-party protocols. Techniques and constructions
Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method
Overdrive: making SPDZ great again
The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
Function secret sharing for mixed-mode and fixed-point secure computation
VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
Efficient pseudorandom correlation generators from ring-LPN
Oblivious key-value stores and amplification for private set intersection
Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
\textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
Secure computation with preprocessing via function secret sharing
Efficient pseudorandom correlation generators: silent OT extension and more
Maliciously secure oblivious linear function evaluation with constant overhead
On the Security of the “Free-XOR” Technique
Multiparty Computation from Somewhat Homomorphic Encryption
A New Approach to Practical Active-Secure Two-Party Computation
Two Halves Make a Whole
Improved Garbled Circuit: Free XOR Gates and Applications
Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
The “Coefficients H” Technique
Tight Security Bounds for Key-Alternating Ciphers
Distributed Point Functions and Their Applications
Advances in Cryptology - CRYPTO 2003
Low cost constant round MPC combining BMR and oblivious transfer
Correlated pseudorandomness from expand-accumulate codes

This page was built for publication: Half-tree: halving the cost of tree expansion in COT and DPF