SecretMatch

T. Balch, Benjamin E. Diamond, Antigoni Polychroniadou
{"title":"SecretMatch","authors":"T. Balch, Benjamin E. Diamond, Antigoni Polychroniadou","doi":"10.1145/3383455.3422569","DOIUrl":null,"url":null,"abstract":"Inventory matching is a process by which a broker or bank pairs buyers and sellers, without revealing their respective orders in a public exchange. Banks often undertake to match their clients, so that these clients can trade securities without incurring adverse price movements. If a bank finds matches between clients, it may execute them at reduced rates; if no matches are found, the clients must trade in a public market, which introduces costs for both parties. This problem is distinct from that solved by dark pools or public exchanges, which implement Continuous Double Auctions (CDAs). CDAs incorporate both price and volume. Inventory matching incorporates volume alone, and extracts price from an external source (such as a public market). As it is currently conducted, inventory matching requires that clients share their intentions to buy or sell certain securities---along with the sizes of their positions---with the bank. Clients worry that if this information were to \"leak\" in some way, other market participants could become aware of their intentions, and cause the price to move adversely against them before they trade. A solution to this problem promises to enable more clients to match their orders more efficiently---with reduced market impact---while also eliminating the risk of information leakage. We present a cryptographic approach to multi-client inventory matching, which preserves the privacy of clients. Our central tool is threshold fully homomorphic encryption; in particular, we introduce an efficient, fully-homomorphic integer library which combines GPU-level parallelism with insights from digital circuit design. Our solution is also post-quantum secure. We report on an implementation of our protocol, and describe its performance.","PeriodicalId":447950,"journal":{"name":"Proceedings of the First ACM International Conference on AI in Finance","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the First ACM International Conference on AI in Finance","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3383455.3422569","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Inventory matching is a process by which a broker or bank pairs buyers and sellers, without revealing their respective orders in a public exchange. Banks often undertake to match their clients, so that these clients can trade securities without incurring adverse price movements. If a bank finds matches between clients, it may execute them at reduced rates; if no matches are found, the clients must trade in a public market, which introduces costs for both parties. This problem is distinct from that solved by dark pools or public exchanges, which implement Continuous Double Auctions (CDAs). CDAs incorporate both price and volume. Inventory matching incorporates volume alone, and extracts price from an external source (such as a public market). As it is currently conducted, inventory matching requires that clients share their intentions to buy or sell certain securities---along with the sizes of their positions---with the bank. Clients worry that if this information were to "leak" in some way, other market participants could become aware of their intentions, and cause the price to move adversely against them before they trade. A solution to this problem promises to enable more clients to match their orders more efficiently---with reduced market impact---while also eliminating the risk of information leakage. We present a cryptographic approach to multi-client inventory matching, which preserves the privacy of clients. Our central tool is threshold fully homomorphic encryption; in particular, we introduce an efficient, fully-homomorphic integer library which combines GPU-level parallelism with insights from digital circuit design. Our solution is also post-quantum secure. We report on an implementation of our protocol, and describe its performance.
SecretMatch
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信