Breaking and fixing garbled circuits when a gate has duplicate input wires

DOI10.1007/s00145-023-09472-4OpenAlexW4385543876MaRDI QIDQ6176274

No author found.

Publication date: 22 August 2023

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-023-09472-4

zbMATH Keywords

circuitsvulnerabilitysecure multi-party computationattackgarbled circuitsgarbling schemes

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• A proof of security of Yao's protocol for two-party computation
• Efficient scalable constant-round MPC via garbled circuits
• Secure two-party computation via cut-and-choose oblivious transfer
• Three halves make a whole? Beating the half-gates lower bound for garbled circuits
• Fast garbling of circuits under standard assumptions
• On the Security of the “Free-XOR” Technique
• Two Halves Make a Whole
• Improved Garbled Circuit: Free XOR Gates and Applications
• Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
• Secure Two-Party Computation Is Practical
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries

This page was built for publication: Breaking and fixing garbled circuits when a gate has duplicate input wires