Dark pools are financial trading venues where orders are entered and matched in secret so that no order information is leaked. By preventing information leakage, dark pools offer the opportunity for large volume block traders to avoid the costly effects of market impact. However, dark pool operators have been known to abuse their privileged access to order information. To address this issue, we introduce a provably secure multi-party computation mechanism that prevents an operator from accessing and misusing order information. Specifically, we implement a secure emulation of Turquoise Plato Uncross, Europe's largest dark pool trading mechanism, and demonstrate that it can handle real world trading throughput, with guaranteed information integrity.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC9615482PMC
http://dx.doi.org/10.1002/isaf.1502DOI Listing

Publication Analysis

Top Keywords

multi-party computation
8
computation mechanism
8
turquoise plato
8
plato uncross
8
dark pools
8
dark pool
8
mechanism anonymous
4
anonymous equity
4
equity block
4
trading
4

Similar Publications

The rapid advancement of quantum key distribution technology in recent years has spurred significant innovation within the field. Nevertheless, a crucial yet frequently underexplored challenge involves the comprehensive evaluation of security quantum state modulation. To address this issue, we propose a novel framework for quantum group key distribution.

View Article and Find Full Text PDF

Blockchain technology is a key technology in the current information field and has been widely used in various industries. Blockchain technology faces significant challenges in privacy protection while ensuring data immutability and transparency, so it is crucial to implement private computing in blockchain. To target the privacy issues in blockchain, we design a secure multi-party computation (SMPC) protocol DHSMPC based on homomorphic encryption in this paper.

View Article and Find Full Text PDF

Communication Complexity of Entanglement-Assisted Multi-Party Computation.

Entropy (Basel)

October 2024

Department of Electrical and Computer Engineering, Iowa State University, Ames, IA 50011, USA.

We consider a quantum and a classical version of a multi-party function computation problem with players, where players 2,…,n need to communicate appropriate information to player 1 so that a "generalized" inner product function with an appropriate promise can be calculated. In the quantum version of the protocol, the players have access to entangled qudits but the communication is still classical. The communication complexity of a given protocol is the total number of classical bits that need to be communicated.

View Article and Find Full Text PDF

A privacy-preserving approach for cloud-based protein fold recognition.

Patterns (N Y)

September 2024

Medical Data Privacy and Privacy Preserving Machine Learning (MDPPML), Department of Computer Science, University of Tübingen, 72076 Tübingen, Germany.

The complexity and cost of training machine learning models have made cloud-based machine learning as a service (MLaaS) attractive for businesses and researchers. MLaaS eliminates the need for in-house expertise by providing pre-built models and infrastructure. However, it raises data privacy and model security concerns, especially in medical fields like protein fold recognition.

View Article and Find Full Text PDF

Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing. As these networks grow in size, certification tools will be required to answer questions regarding their properties. In this work we demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!