Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3533271.3561776acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicaifConference Proceedingsconference-collections
research-article

Addressing Extreme Market Responses Using Secure Aggregation

Published: 26 October 2022 Publication History

Abstract

An investor short sells when he/she borrows a security and sells it on the open market, planning to buy it back later at a lower price. That said, short-sellers profit from a drop in the price of the security. If the shares of the security instead increase in price, short sellers can bare large losses. Short interest stock market data, provide crucial information of short selling in the market for data mining by publishing the number of shares that have been sold short. Short interest reports are compiled and published by the regulators at a high cost. In particular, brokers and market participants must report their positions on a daily basis to Financial Industry Regulatory Authority (FINRA). Then, FINRA processes the data and provides aggregated feeds to potential clients at a high cost. Third party data providers offer the same service at a lower cost given that the brokers contribute their data to the aggregated data feeds. However, the aggregated feeds do not cover 100% of the market since the brokers are not willing to submit and trust their individual data with the data providers. Not to mention that brokers and market participants do not wish to reveal such information on a daily basis to a third party.
In this paper, we show how to publish short interest stock market data using Secure Multiparty Computation: In our process, brokers and market participants submit to a data provider their short selling information, including the symbol of the security and its volume in encrypted messages on a daily basis. The messages are encrypted in a way that the data provider cannot decrypt them and therefore cannot learn about individual participants input. Then, the data provider, can compute an aggregation on the encrypted data and publish the aggregation of the volume per security. It is important to note that the individual volumes are not revealed to the data provider, only the aggregated volume is published.

References

[1]
James Henry Bell, Kallista A. Bonawitz, Adrià Gascón, Tancrède Lepoint, and Mariana Raykova. 2020. Secure Single-Server Aggregation with (Poly)Logarithmic Overhead. Association for Computing Machinery, New York, NY, USA, 1253–1269. https://doi.org/10.1145/3372297.3417885
[2]
Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA, Janos Simon (Ed.). ACM, 1–10.
[3]
Keith Bonawitz, Vladimir Ivanov, Ben Kreuter, Antonio Marcedone, H Brendan McMahan, Sarvar Patel, Daniel Ramage, Aaron Segal, and Karn Seth. 2017. Practical secure aggregation for privacy-preserving machine learning. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. ACM, 1175–1191.
[4]
Ran Canetti. 2000. Security and Composition of Multiparty Cryptographic Protocols. J. Cryptol. 13, 1 (2000), 143–202.
[5]
David Chaum, Claude Crépeau, and Ivan Damgård. 1987. Multiparty Unconditionally Secure Protocols (Abstract). In Advances in Cryptology - CRYPTO ’87, A Conference on the Theory and Applications of Cryptographic Techniques, Santa Barbara, California, USA, August 16-20, 1987, Proceedings. 462. https://doi.org/10.1007/3-540-48184-2_43
[6]
Whitfield Diffie and Martin E. Hellman. 1976. New directions in cryptography. IEEE Trans. Information Theory 22, 6 (1976), 644–654. https://doi.org/10.1109/TIT.1976.1055638
[7]
Cynthia Dwork, Aaron Roth, 2014. The algorithmic foundations of differential privacy. Foundations and Trends® in Theoretical Computer Science 9, 3–4(2014), 211–407.
[8]
Muhammed F Esgin, Ron Steinfeld, Joseph K Liu, and Dongxi Liu. 2019. Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications. In Annual International Cryptology Conference. Springer, 115–146.
[9]
Oded Goldreich. 2004. The Foundations of Cryptography - Volume 2: Basic Applications. Cambridge University Press. https://doi.org/10.1017/CBO9780511721656
[10]
Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA. 218–229. https://doi.org/10.1145/28395.28420
[11]
Yue Guo, Antigoni Polychroniadou, Elaine Shi, David Byrd, and Tucker Balch. 2022. MicroFedML: Privacy Preserving Federated Learning for Small Weights. IACR Cryptol. ePrint Arch.(2022), 714. https://eprint.iacr.org/2022/714
[12]
Benoît Libert, San Ling, Khoa Nguyen, and Huaxiong Wang. 2018. Lattice-based zero-knowledge arguments for integer relations. In Annual International Cryptology Conference. Springer, 700–732.
[13]
Rupeng Yang, Man Ho Au, Zhenfei Zhang, Qiuliang Xu, Zuoxia Yu, and William Whyte. 2019. Efficient lattice-based zero-knowledge arguments with standard soundness: Construction and applications. In Annual International Cryptology Conference. Springer, 147–175.
[14]
Andrew Chi-Chih Yao. 1982. Protocols for Secure Computations (Extended Abstract). In 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982. IEEE Computer Society, 160–164.
[15]
Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets (Extended Abstract). In 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27-29 October 1986. IEEE Computer Society, 162–167.

Index Terms

  1. Addressing Extreme Market Responses Using Secure Aggregation

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    ICAIF '22: Proceedings of the Third ACM International Conference on AI in Finance
    November 2022
    527 pages
    ISBN:9781450393768
    DOI:10.1145/3533271
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 26 October 2022

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Secure Computation
    2. Short Interest

    Qualifiers

    • Research-article
    • Research
    • Refereed limited

    Conference

    ICAIF '22
    Sponsor:

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 67
      Total Downloads
    • Downloads (Last 12 months)6
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 04 Feb 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format.

    HTML Format

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media