Abstract
Multi-party fair exchange (MFE) and fair secure multi-party computation (fair SMPC) are under-studied fields of research, with practical importance. In particular, we consider MFE scenarios where at the end of the protocol, either every participant receives every other participant’s item, or no participant receives anything. We analyze the case where a trusted third party (TTP) is optimistically available, although we emphasize that the trust put on the TTP is only regarding the fairness, and our protocols preserve the privacy of the exchanged items against the TTP. In the fair SMPC case, we prove that a malicious TTP can only harm fairness, but not security.
We construct an asymptotically optimal multi-party fair exchange protocol that requires a constant number of rounds (in comparison to linear) and O(n2) messages (in comparison to cubic), where n is the number of participating parties. In our protocol, we enable the parties to efficiently exchange any item that can be efficiently put into a verifiable encryption (e.g., signatures on a contract). We show how to apply this protocol on top of any SMPC protocol to achieve fairness with very little overhead (independent of the circuit size). We then generalize our protocol to efficiently handle any exchange topology (participants exchange items with arbitrary other participants). Our protocol guarantees fairness in its strongest sense: even if all n-1 other participants are malicious and colluding with each other, the fairness is still guaranteed.
- [1] . 2013. Charm: A framework for rapidly prototyping cryptosystems. J. Cryptogr. Eng. 3, 2 (2013), 111–128.Google Scholar
Cross Ref
- [2] . 2014. Secure multiparty computations on bitcoin. In Proceedings of the IEEE Symposium on Security and Privacy. IEEE, 443–458. Google Scholar
Digital Library
- [3] . 2014. Towards characterizing complete fairness in secure two-party computation. In Proceedings of the TCC. Springer, 291–316.Google Scholar
Cross Ref
- [4] . 2015. Complete characterization of fairness in secure two-party computation of Boolean functions. In Proceedings of the TCC. 199–228.Google Scholar
Cross Ref
- [5] . 2011. Towards a game theoretic view of secure computation. In Proceedings of the EUROCRYPT, Vol. 6632. Springer, 426–445. Google Scholar
Digital Library
- [6] . 2013. Fair and efficient secure multiparty computation with reputation systems. In Proceedings of the ASIACRYPT. Springer, 201–220.Google Scholar
Cross Ref
- [7] . 1996. Optimistic Protocols for Multi-party Fair Exchange.
Technical Report RZ2892 , IBM Research.Google Scholar - [8] . 2000. Optimistic fair exchange of digital signatures. IEEE J. Select. Areas Commun. (2000), 591–610.Google Scholar
- [9] . 1999. Efficient verifiable encryption (and fair exchange) of digital signatures. In Proceedings of the ACM CCS. ACM, 138–146. Google Scholar
Digital Library
- [10] . 2002. Stateless-recipient certified e-mail system based on verifiable encryption. In Proceedings of the CT-RSA, Vol. 2. Springer, 182–199. Google Scholar
Digital Library
- [11] . 2004. Optimistic fair exchange based on publicly verifiable secret sharing. In Proceedings of the ACISP, Vol. 3108. Springer, 74–85.Google Scholar
Cross Ref
- [12] . 1999. Multi-party fair exchange with an off-line trusted neutral party. In Proceedings of the DEXA. IEEE, 858–862. Google Scholar
Digital Library
- [13] . 1998. Efficient and practical fair exchange protocols with off-line TTP. In Proceedings of the IEEE SP Symposium. 77–85.Google Scholar
- [14] . 2014. Publicly auditable secure multi-party computation. In Proceedings of the SCN. Springer, 175–196.Google Scholar
Cross Ref
- [15] . 2020. Insured MPC: Efficient secure computation with financial penalties. In Proceedings of the FC.Google Scholar
- [16] . 2020. CRAFT: Composable randomness beacons and output-independent abort MPC from time. IACR Cryptology ePrint Archive, Report 2020/784.Google Scholar
- [17] . 2021. TARDIS: A foundation of time-lock puzzles in UC. In EUROCRYPT. Springer.Google Scholar
- [18] . 2000. Round-optimal and abuse-free optimistic multi-party contract signing. In Proceedings of the ICALP. Springer, 524–535. Google Scholar
Digital Library
- [19] . 2007. Making P2P accountable without losing privacy. In Proceedings of the WPES. ACM, 31–40. Google Scholar
Digital Library
- [20] . 1988. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the STOC. ACM, 1–10. Google Scholar
Digital Library
- [21] . 2014. How to use bitcoin to design fair protocols. In Proceedings of the CRYPTO. Springer, 421–439.Google Scholar
Cross Ref
- [22] . 2017. Instantaneous decentralized poker. In Proceedings of the AsiaCrypt. Springer, 410–440.Google Scholar
Cross Ref
- [23] . 1988. Non-interactive zero-knowledge and its applications. In Proceedings of the STOC. ACM, 103–112. Google Scholar
Digital Library
- [24] [n.d.]. Brownie Cashlib Cryptographic Library. Retrieved from http://github.com/brownie/cashlib.Google Scholar
- [25] . 2000. Optimistic fair secure computation. In Proceedings of the CRYPTO. Springer, 93–111. Google Scholar
Digital Library
- [26] . 2000. Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes. In Proceedings of the ASIACRYPT. Springer, 331–345. Google Scholar
Digital Library
- [27] . 1998. Verifiable encryption and applications to group signatures and signature sharing. BRICS Report Ser. 5, 32 (1998).Google Scholar
- [28] . 2003. Practical verifiable encryption and decryption of discrete logarithms. In Proceedings of the CRYPTO. Springer, 126–144.Google Scholar
Cross Ref
- [29] . 2000. Security and composition of multiparty cryptographic protocols. J. Cryptol. 13 (2000), 143–202. Google Scholar
Digital Library
- [30] . 2017. Fairness in an unfair world: Fair multiparty computation from public bulletin boards. In Proceedings of the ACM SIGSAC Conference. 719–728. Google Scholar
Digital Library
- [31] . 2017. Fairness versus guaranteed output delivery in secure multiparty computation. J. Cryptol. 30, 4 (2017), 1157–1186. Google Scholar
Digital Library
- [32] . 2001. Multiparty computation from threshold homomorphic encryption. In Proceedings of the EUROCRYPT. Springer, 280–300. Google Scholar
Digital Library
- [33] . 2002. Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In Proceedings of the CRYPTO. Springer, 45–64. Google Scholar
Digital Library
- [34] . 2002. On \(\Sigma\)-protocols. Lecture Notes, University of Aarhus, Department for Computer Science (2002).Google Scholar
- [35] . 2007. Optimistic fair exchange in a multi-user setting. In Proceedings of the PKC. Springer, 118–133. Google Scholar
Digital Library
- [36] . 2015. On the efficiency of multi-party contract signing protocols. In Proceedings of the ISC. Springer, 227–243. Google Scholar
Digital Library
- [37] . 2018. Fairswap: How to fairly exchange digital goods. In Proceedings of the ACM SIGSAC. 967–984. Google Scholar
Digital Library
- [38] . 1985. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Info. Theory 31, 4 (1985), 469–472. Google Scholar
Digital Library
- [39] . 1980. Relations Among Public Key Signature Systems. Technical Report 175, Technion, Haifa, Israel.Google Scholar
- [40] . 1986. How to prove yourself: Practical solutions to identification and signature problems. In Proceedings of the CRYPTO. Springer, 186–194. Google Scholar
Digital Library
- [41] . 1998. Secure group barter: Multi-party fair exchange with semi-trusted neutral parties. In Proceedings of the FC. Springer, 90–102. Google Scholar
Digital Library
- [42] . 2015. How fair is your protocol? A utility-based approach to protocol optimality. In Proceedings of the PODC. ACM, 281–290. Google Scholar
Digital Library
- [43] . 2011. Resource fairness and composability of cryptographic protocols. J. Cryptol. 24, 4 (
Oct. 2011), 615–658. Google ScholarDigital Library
- [44] . 1999. Abuse-free optimistic contract signing. In Proceedings of the CRYPTO, Vol. 99. Springer, 449–466. Google Scholar
Digital Library
- [45] . 1999. Abuse-free multi-party contract signing. In Proceedings of the DISC, Vol. 99. Springer, 151–165. Google Scholar
Digital Library
- [46] . 2009. Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press. Google Scholar
Digital Library
- [47] . 1987. How to play any mental game. In Proceedings of the STOC. ACM, 218–229. Google Scholar
Digital Library
- [48] . 2005. Secure multi-party computation without agreement. J. Cryptol. 18, 3 (2005), 247–287. Google Scholar
Digital Library
- [49] . 2001. An optimistic multi-party fair exchange protocol with reduced trust requirements. In Proceedings of the ICISC. Springer, 258–267. Google Scholar
Digital Library
- [50] . 2011. Complete fairness in secure two-party computation. J. ACM 58 (2011). Google Scholar
Digital Library
- [51] . 2010. On complete primitives for fairness. In Proceedings of the TCC. Springer, 91–108. Google Scholar
Digital Library
- [52] . 2009. Complete fairness in multi-party computation without an honest majority. In Proceedings of the TCC. Google Scholar
Digital Library
- [53] . 2010. Partial fairness in secure two-party computation. In Proceedings of the EUROCRYPT, Vol. 6110. Springer, 157–176. Google Scholar
Digital Library
- [54] . 2012. Partial fairness in secure two-party computation. J. Cryptol. 25, 1 (2012), 14–40. Google Scholar
Digital Library
- [55] . 2012. Fair computation with rational players. In Proceedings of the EUROCRYPT. Springer, 81–98. Google Scholar
Digital Library
- [56] . 2016. Optimal fair computation. In Proceedings of the DISC. Springer, 143–157.Google Scholar
Cross Ref
- [57] . 2013. Universally composable synchronous computation. In Proceedings of the TCC. Springer, 477–498. Google Scholar
Digital Library
- [58] . 2016. Fair and robust multi-party computation using a global transaction ledger. In Proceedings of the EUROCRYPT. Springer, 705–734. Google Scholar
Digital Library
- [59] . 2016. Efficiently making secure two-party computation fair. In Proceedings of the FC. Springer, 188–207.Google Scholar
- [60] . 2015. Optimally efficient multi-party fair exchange and fair secure multi-party computation. In Proceedings of the CT-RSA. 330–349.Google Scholar
- [61] . 2021. Coin-based multi-party fair exchange. In Proceedings of the ACNS.Google Scholar
- [62] . 2008. An efficient protocol for fair secure two-party computation. In Proceedings of the CT-RSA, Vol. 8. Springer, 88–105. Google Scholar
Digital Library
- [63] . 2016. Amortizing secure computation with penalties. In Proceedings of the ACM SIGSAC. 418–429. Google Scholar
Digital Library
- [64] . 2016. Improvements to secure computation with penalties. In Proceedings of the ACM SIGSAC. 406–417. Google Scholar
Digital Library
- [65] . 2012. Usable optimistic fair exchange. Comput. Netw. 56, 1 (2012), 50–63. Google Scholar
Digital Library
- [66] . 2013. Distributing trusted third parties. ACM SIGACT News Distrib. Comput. Column 44 (2013), 92–112. Google Scholar
Digital Library
- [67] . 2010. Optimistic fair exchange with multiple arbiters. In Proceedings of the ESORICS. Springer, 488–507. Google Scholar
Digital Library
- [68] . 2016. Fast optimistically fair cut-and-choose 2PC. In Proceedings of the FC. Springer, 208–228.Google Scholar
- [69] . 2007. An efficient protocol for secure two-party computation in the presence of malicious adversaries. In Proceedings of the EUROCRYPT. Springer, 52–78. Google Scholar
Digital Library
- [70] . 2011. An improved protocol for optimistic multi-party fair exchange. In Proceedings of the EMEIT, Vol. 9. IEEE, 4864–4867.Google Scholar
Cross Ref
- [71] . 2020. Cost fairness for blockchain-based two-party exchange protocols. In 2020 IEEE International Conference on Blockchain (Blockchain).
DOI: 10.1109/Blockchain50366.2020.00062Google Scholar - [72] . 2000. A multi-party optimistic non-repudiation protocol. In Proceedings of the ICISC. Springer, 109–122. Google Scholar
Digital Library
- [73] . 2015. Generalizing multi-party contract signing. In Proceedings of the POST. Springer, 156–175. Google Scholar
Digital Library
- [74] . 2009. Minimal message complexity of asynchronous multi-party contract signing. In Proceedings of the CSF. IEEE, 13–25. Google Scholar
Digital Library
- [75] . 2010. ZKPDL: A language-based system for efficient zero-knowledge proofs and electronic cash. In Proceedings of the USENIX Security Symposium. Google Scholar
Digital Library
- [76] . 2003. Simple and fast optimistic protocols for fair electronic exchange. In Proceedings of the PODC. ACM, 12–19. Google Scholar
Digital Library
- [77] . 2008. Fair multi-party contract signing using private contract signatures. Elsevier Info. Comput. 206 (2008), 272–290. Google Scholar
Digital Library
- [78] . 1999. On the Impossibility of Fair Exchange Without a Trusted Third Party.
Technical Report TUD-BS-1999-02 , Darmstadt University of Technology.Google Scholar - [79] . 1991. A threshold cryptosystem without a trusted party. In Proceedings of the EUROCRYPT. Springer, 522–526. Google Scholar
Digital Library
- [80] . 2003. Fair secure two-party computation. In Proceedings of the EUROCRYPT, Vol. 2656. Springer, 87–105. Google Scholar
Digital Library
- [81] . 2012. A construction of short sequences containing All permutations of a set as subsequences. Electron. J. Combinat. 19, 4 (2012), 31.Google Scholar
Cross Ref
- [82] . 2014. An efficient fair UC-secure protocol for two-party computation. Secur. Commun. Netw. 7, 8 (2014), 1253–1263. Google Scholar
Digital Library
- [83] . 2002. Securing threshold cryptosystems against chosen ciphertext attack. J. Cryptol. (2002), 75–96. Google Scholar
Digital Library
- [84] . 2014. Millions of millionaires: Multiparty computation in large networks. IACR Cryptol. ePrint Arch. 2014 (2014), 149.Google Scholar
Index Terms
Optimally Efficient Multi-party Fair Exchange and Fair Secure Multi-party Computation
Recommendations
An almost-optimally fair three-party coin-flipping protocol
STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computingIn a multiparty fair coin-flipping protocol, the parties output a common (close to) unbiased bit, even when some corrupted parties try to bias the output. Cleve [STOC 1986] has shown that in the case of dishonest majority (i.e., at least half of the ...
An efficient fair UC-secure protocol for two-party computation
With the development of modern Internet and mobile networks, there is an increasing need for collaborative privacy-preserving applications. Secure multi-party computation SMPC gives a general solution to these applications and has become a hot topic. ...
Efficient Fair Secure Two-Party Computation
APSCC '12: Proceedings of the 2012 IEEE Asia-Pacific Services Computing Conference)Yao first introduced a constant-round protocol for secure two-party computation (2PC) withstanding semi-honest adversaries by using a tool called """"garbled circuit"""". Later, many protocols based on garbled circuit approach have been presented, most ...






Comments