Free-XOR in card-based garbled circuits

DOI10.1007/978-981-99-7563-1_11MaRDI QIDQ6550650zbMATH OpenFDO

Authors Yoshifumi Manabe, Kazumasa Shinagawa

Publication date 5 June 2024

zbMATH Keywords

secure multiparty computationgarbled circuitscard-based cryptographic protocolsexclusive ORfree-XOR

Mathematics Subject Classification ID

Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Networks and circuits as models of computation; circuit complexity (68Q06)

Recommendations

• Six-Card Secure AND and Four-Card Secure XOR
• On the security of the ``Free-XOR technique
• Securely computing XOR with 10 cards
• Flexor: Flexible garbling for XOR gates that beats free-XOR
• Garbling XOR gates ``for free in the standard model

This page was built for publication: Free-XOR in card-based garbled circuits

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