Fast Optimistically Fair Cut-and-Choose 2PC

DOI10.1007/978-3-662-54970-4_12zbMATH Open1475.68130OpenAlexW2615503775MaRDI QIDQ5857776

Payman Mohassel, Alptekin Küpçü

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

cut-and-choosesecure two-party computationoptimistic fair exchangegarbled circuitscovert adversariesfair secure computation

Mathematics Subject Classification ID

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

Related Items (1)

Optimally-fair multi-party exchange without trusted parties

This page was built for publication: Fast Optimistically Fair Cut-and-Choose 2PC