The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
From MaRDI portal
Publication:1675724
DOI10.1007/978-3-319-63688-7_6zbMath1407.94099OpenAlexW2741687165MaRDI QIDQ1675724
Publication date: 3 November 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-63688-7_6
Related Items (21)
Compilation of function representations for secure computing paradigms ⋮ Sublinear GMW-style compiler for MPC with preprocessing ⋮ Two attacks on rank metric code-based schemes: RankSign and an IBE scheme ⋮ MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ Secure multiparty computation with sublinear preprocessing ⋮ Secure computation with preprocessing via function secret sharing ⋮ Actively secure half-gates with minimum overhead under duplex networks ⋮ Putting the online phase on a diet: covert security from short MACs ⋮ Programmable distributed point functions ⋮ Sublinear secure computation from new assumptions ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ Half-tree: halving the cost of tree expansion in COT and DPF ⋮ On multiparty garbling of arithmetic circuits ⋮ Secure computation with low communication from cross-checking ⋮ Block cipher invariants as eigenvectors of correlation matrices ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ Squares of matrix-product codes ⋮ Function secret sharing for mixed-mode and fixed-point secure computation ⋮ High dimensional affine codes whose square has a designed minimum distance ⋮ Efficient pseudorandom correlation generators from ring-LPN
This page was built for publication: The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
