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

DOI10.1007/978-3-031-30545-0_12MaRDI QIDQ6178790zbMATH OpenFDO

Authors Xiaojie Guo, Kang Yang, Xiao Wang, Wenhao Zhang, Xiang Xie, Jiang Zhang, Zheli Liu

Publication date 16 January 2024

Published in Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)

zbMATH Keywords

correlated oblivious transfer protocolrandom-permutation model

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Programmable distributed point functions
• Two halves make a whole: reducing data transfer in garbled circuits using half gates
• More efficient oblivious transfer extensions
• Communication-efficient distributed oblivious transfer
• Improved OT extension for transferring short secrets

Cites work

• scientific article; zbMATH DE number 1030984 (Why is no real title available?)
• scientific article; zbMATH DE number 7706037 (Why is no real title available?)
• A new approach to practical active-secure two-party computation
• Advances in Cryptology - CRYPTO 2003
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• Correlated pseudorandomness from expand-accumulate codes
• Distributed Point Functions and Their Applications
• Efficient pseudorandom correlation generators from ring-LPN
• Efficient pseudorandom correlation generators: silent OT extension and more
• 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
• Function secret sharing for mixed-mode and fixed-point secure computation
• Improved Garbled Circuit: Free XOR Gates and Applications
• Low cost constant round MPC combining BMR and oblivious transfer
• Maliciously secure oblivious linear function evaluation with constant overhead
• Multiparty Computation from Somewhat Homomorphic Encryption
• Oblivious key-value stores and amplification for private set intersection
• On the security of the ``Free-XOR technique
• Overdrive: making SPDZ great again
• Secure computation with preprocessing via function secret sharing
• Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• The “Coefficients H” Technique
• Tight security bounds for key-alternating ciphers
• Two halves make a whole: reducing data transfer in garbled circuits using half gates
• VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions

Cited in

(3)

• \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head
• Efficient arithmetic in garbled circuits
• MPC in the head using the subfield bilinear collision problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178790)