On the leakage of corrupted garbled circuits

DOI10.1007/978-3-030-01446-9_1zbMATH Open1421.94084OpenAlexW2893601286MaRDI QIDQ1616633FDOQ1616633

Authors: Aurélien Dupin, David Pointcheval, Christophe Bidan 

Publication date: 7 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-030-01446-9_1

Recommendations

• Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
• Fast cut-and-choose-based protocols for malicious and covert adversaries
• Two-output secure computation with malicious adversaries
• Garbled circuits checking garbled circuits: more efficient and secure two-party computation
• Amortizing Garbled Circuits

zbMATH Keywords

cut-and-choosegarbled circuitsmalicious adversariescorruption of garbled circuits

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cited In (5)

• Parallel Repetition for Leakage Resilience Amplification Revisited
• Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware
• Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
• Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
• Amortizing Garbled Circuits

This page was built for publication: On the leakage of corrupted garbled circuits

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