Fast optimistically fair cut-and-choose 2PC

DOI10.1007/978-3-662-54970-4_12MaRDI QIDQ5857776zbMATH OpenOpenAlexFDO

Authors Alptekin Küpçü, Payman Mohassel

Publication date 7 April 2021

Published in Financial Cryptography and Data Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-54970-4_12

zbMATH Keywords

covert adversariescut-and-choosefair secure computationgarbled circuitsoptimistic fair exchangesecure two-party computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Efficiently making secure two-party computation fair
• An Efficient Protocol for Fair Secure Two-Party Computation
• Complete fairness in secure two-party computation
• Complete fairness in secure two-party computation
• Partial fairness in secure two-party computation

Cited in

(2)

• Efficiently making secure two-party computation fair
• Optimally-fair multi-party exchange without trusted parties

This page was built for publication: Fast optimistically fair cut-and-choose 2PC

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