Private Liquidity Matching using MPC

Shahla Atapoor; Nigel P.  Smart; Younes Talibi Alaoui

Paper 2021/475

Private Liquidity Matching using MPC

Shahla Atapoor, Nigel P. Smart, and Younes Talibi Alaoui

Abstract

Many central banks, as well as blockchain systems, are looking into distributed versions of interbank payment systems, in particular the netting procedure. When executed in a distributed manner this presents a number of privacy problems. This paper studies a privacy preserving netting protocol to solve the gridlock resolution problem in such Real Time Gross Settlement systems. Our solution utilizes Multi-party Computation and is implemented in the SCALE MAMBA system, using Shamir secret sharing scheme over three parties in an actively secure manner. Our experiments show that, even for large throughput systems, such a privacy preserving operation is often feasible.

Metadata

Available format(s): PDF
Category: Applications
Publication info: Published elsewhere. CT-RSA 2022
Contact author(s): Shahla Atapoor @ kuleuven be
nigel smart @ kuleuven be
younes talibialaoui @ kuleuven be
History: 2021-11-18: last of 3 revisions; 2021-04-15: received; See all versions
Short URL: https://ia.cr/2021/475
License: CC BY

BibTeX

@misc{cryptoeprint:2021/475,
      author = {Shahla Atapoor and Nigel P.  Smart and Younes Talibi Alaoui},
      title = {Private Liquidity Matching using {MPC}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/475},
      year = {2021},
      url = {https://eprint.iacr.org/2021/475}
}