Amortizing Garbled Circuits

DOI10.1007/978-3-662-44381-1_26MaRDI QIDQ2874553zbMATH OpenOpenAlexFDO

Authors Yan Huang, Vladimir Kolesnikov, Ranjit Kumaresan, Alex J. Malozemoff, Jonathan 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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A new approach to garbled circuits
• How to garble arithmetic circuits
• Cross and clean: amortized garbled circuits with constant overhead
• Fast garbling of circuits under standard assumptions
• On the leakage of corrupted garbled circuits
• Improvements for gate-hiding garbled circuits
• Hashing garbled circuits for free
• New ways to garble arithmetic circuits

Cited in

(25)

• Efficient and scalable universal circuits
• Actively secure garbled circuits with constant communication overhead in the plain model
• LEGO for Two-Party Secure Computation
• How to circumvent the two-ciphertext lower bound for linear garbling schemes
• On the leakage of corrupted garbled circuits
• On the exact round complexity of secure three-party computation
• Reactive garbling: foundation, instantiation, application
• Round optimal black-box ``commit-and-prove
• Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
• Network oblivious transfer
• Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation
• Faster secure two-party computation in the single-execution setting
• Non-interactive secure 2PC in the offline/online and batch settings
• The price of active security in cryptographic protocols
• The price of active security in cryptographic protocols
• Garbled circuit lookup tables with logarithmic number of ciphertexts
• Amortized complexity of information-theoretically secure MPC revisited
• Optimizing authenticated garbling for faster secure two-party computation
• Authenticated garbling from simple correlations
• Cross and clean: amortized garbled circuits with constant overhead
• Hashing garbled circuits for free
• Efficient k-out-of-n oblivious transfer scheme with the ideal communication cost
• JIMU: faster LEGO-based secure computation using additive homomorphic hashes
• Better concrete security for half-gates garbling (in the multi-instance setting)
• Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact

This page was built for publication: Amortizing Garbled Circuits

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