On the Security of the “Free-XOR” Technique
From MaRDI portal
Publication:2891475
DOI10.1007/978-3-642-28914-9_3zbMath1303.94075OpenAlexW203353244MaRDI QIDQ2891475
Seung Geol Choi, Hong-Sheng Zhou, Ranjit Kumaresan, Jonathan N. Katz
Publication date: 15 June 2012
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28914-9_3
Related Items (21)
Three halves make a whole? Beating the half-gates lower bound for garbled circuits ⋮ Threshold Schnorr with stateless deterministic signing from standard assumptions ⋮ Garbling XOR gates ``for free in the standard model ⋮ Adaptive security of practical garbling schemes ⋮ \textsc{EpiGRAM}: practical garbled RAM ⋮ Garbled circuits with sublinear evaluator ⋮ Fast garbling of circuits under standard assumptions ⋮ NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead ⋮ Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation ⋮ Better security-efficiency trade-offs in permutation-based two-party computation ⋮ Breaking and fixing garbled circuits when a gate has duplicate input wires ⋮ Half-tree: halving the cost of tree expansion in COT and DPF ⋮ Tri-state circuits. A circuit model that captures RAM ⋮ On multiparty garbling of arithmetic circuits ⋮ Secure two-party computation in a quantum world ⋮ Block cipher invariants as eigenvectors of correlation matrices ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation ⋮ Efficient constant-round MPC with identifiable abort and public verifiability ⋮ Stacked garbling. Garbled circuit proportional to longest execution path
This page was built for publication: On the Security of the “Free-XOR” Technique
