Amortizing Garbled Circuits
From MaRDI portal
Publication:2874553
DOI10.1007/978-3-662-44381-1_26zbMath1335.94052OpenAlexW12537036MaRDI QIDQ2874553
Ranjit Kumaresan, Yan Huang, Vladimir Kolesnikov, Alex J. Malozemoff, Jonathan N. Katz
Publication date: 7 August 2014
Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44381-1_26
Related Items (16)
Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact ⋮ Round optimal black-box ``commit-and-prove ⋮ Cross and Clean: Amortized Garbled Circuits with Constant Overhead ⋮ Efficient and scalable universal circuits ⋮ How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes ⋮ Reactive Garbling: Foundation, Instantiation, Application ⋮ Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost ⋮ Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ On the exact round complexity of secure three-party computation ⋮ Network Oblivious Transfer ⋮ Better concrete security for half-gates garbling (in the multi-instance setting) ⋮ Faster Secure Two-Party Computation in the Single-Execution Setting ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings ⋮ Hashing Garbled Circuits for Free ⋮ The price of active security in cryptographic protocols
This page was built for publication: Amortizing Garbled Circuits
