Efficiently making secure two-party computation fair

DOI10.1007/978-3-662-54970-4_11MaRDI QIDQ5857775zbMATH OpenOpenAlexFDO

Authors Handan Kılınç, 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_11

Mathematics Subject Classification ID

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

Recommendations

• An Efficient Protocol for Fair Secure Two-Party Computation
• Fast optimistically fair cut-and-choose 2PC
• scientific article; zbMATH DE number 2009950
• Complete fairness in secure two-party computation
• Partial fairness in secure two-party computation

Cited in

(11)

• Secure two-party computation with fairness -- a necessary design principle
• Efficient fair multiparty protocols using blockchain and trusted hardware
• Optimally efficient multi-party fair exchange and fair secure multi-party computation
• Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
• scientific article; zbMATH DE number 2009950 (Why is no real title available?)
• scientific article; zbMATH DE number 1759773 (Why is no real title available?)
• Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
• An Efficient Protocol for Fair Secure Two-Party Computation
• Progress in Cryptology - INDOCRYPT 2004
• Fast optimistically fair cut-and-choose 2PC
• Optimally-fair multi-party exchange without trusted parties

This page was built for publication: Efficiently making secure two-party computation fair

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