We create a formal framework for the design of informative securities in prediction markets. These securities allow a market organizer to infer the likelihood of events of interest as well as if he knew all of the traders' private signals. We consider the design of markets that are always informative, markets that are …
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “information security”
In this paper are presented methods of impact analysis on informatics system security accidents, qualitative and quantitative methods, starting with risk and informational system security definitions. It is presented the relationship between the risks of exploiting vulnerabilities of security system, security level of …
Federated learning leaks participant dataset quality even with secure aggregation.
problem Leakage of participant dataset quality in federated learning with secure aggregation.
method Image recognition experiments to infer and attribute dataset quality.
result Relative quality ordering of participants can be inferred and used for various purposes.
In this paper incomplete-information models are developed for the pricing of securities in a stochastic interest rate setting. In particular we consider credit-risky assets that may include random recovery upon default. The market filtration is generated by a collection of information processes associated with economic…
End-to-end learning of codes for secure BPSK communication in Gaussian wiretap channel.
problem Secure communication in the presence of an adversary for BPSK modulation.
method Learning finite-length codes using deep neural networks (DNNs) with mutual information estimation.
result Learned codes achieve near-optimal security performance, as demonstrated by numerical results.
To accommodate heterogeneous tasks in Internet of Things (IoT), a new communication and computing paradigm termed mobile edge computing emerges that extends computing services from the cloud to edge, but at the same time exposes new challenges on security. The present paper studies online security-aware edge computing …
Secure XGB for privacy-preserving machine learning in federated learning.
problem Privacy-preserving machine learning in federated learning with practical gradient tree boosting models.
method Secure multi-party computation, distributed model storage, secure permutation protocols.
result Our XGB models provide competitive accuracy and practical performance.
Digit Recognition From Wrist Movements and Security Concerns with Smart Wrist Wearable IOT Devicescs.CR
Wrist movements can reveal digits, posing security risks.
problem Security vulnerabilities in wrist wearable devices.
method Machine learning model trained on wrist movement data.
result 100% accuracy in predicting digits via wrist movement.
SPAC data shows premium investors get better terms, non-premium get quid pro quo deals.
problem Agency problems and informational frictions in securities issuance.
method Analysis of SPAC data to identify premium and non-premium investors.
result Non-premium investors engage in quid pro quo relationships with issuers and intermediaries.
Low-frequency historical data, high-frequency historical data and option data are three major sources, which can be used to forecast the underlying security's volatility. In this paper, we propose two econometric models, which integrate three information sources. In GARCH-Itô-OI model, we assume that the option-implied…
FastSecAgg improves federated learning security and efficiency.
problem Privacy leakage in federated learning due to model parameter sharing.
method Introduces FastSecAgg, a secure aggregation protocol with FFT-based multi-secret sharing (FastShare).
result Efficient in computation and communication, robust to client dropouts.
Secure social recommendation framework using secret sharing.
problem Privacy concerns and reluctance to share social data in recommender systems.
method Secret Sharing based Matrix Multiplication (SSMM) protocol for secure data sharing and collaborative recommendation.
result SeSoRec framework improves recommendation performance and is secure.
Most of the existing solutions to enterprise threat management are preventive approaches prescribing means to prevent policy violations with varying degrees of success. In this paper we consider the complementary scenario where a number of security violations have already occurred, or security threats, or vulnerabiliti…
We consider a class of generalized capital asset pricing models in continuous time with a finite number of agents and tradable securities. The securities may not be sufficient to span all sources of uncertainty. If the agents have exponential utility functions and the individual endowments are spanned by the securities…
A new method for federated learning aggregates data from multiple sites efficiently.
problem Aggregating data from multiple sites securely and effectively.
method Sequential federated learning with distributed computing.
result Preserves information from individual analyses and accelerates the analysis process.
Proposes a secure communication method independent of eavesdropper's decoder.
problem Lack of practical security constraints in existing methods.
method Dual MINE-based neural secure communications model.
result Security performance is not affected by eavesdropper's decoding means.
The emph{securities market} is the fundamental theoretical framework in economics and finance for resource allocation under uncertainty. Securities serve both to reallocate risk and to disseminate probabilistic information. emph{Complete} securities markets - which contain one security for every possible state of natur…
Broker uses multi-task dynamic pricing to learn competitive prices in credit markets.
problem Lack of data and infrequent trading in credit markets.
method Two-Stage Multi-Task (TSMT) algorithm that leverages shared structure across securities.
result TSMT algorithm achieves a regret bound of , outperforming baselines.
To be prepared against cyberattacks, most organizations resort to security information and event management systems to monitor their infrastructures. These systems depend on the timeliness and relevance of the latest updates, patches and threats provided by cyberthreat intelligence feeds. Open source intelligence platf…
We consider a continuous-time financial market that consists of securities available for dynamic trading, and securities only available for static trading. We work in a robust framework where a set of non-dominated models is given. The concept of semi-static completeness is introduced: it corresponds to having exact re…
Proposes a method for private aggregation in heterogeneous federated learning.
problem Ensuring resilience to Byzantine clients and maintaining client data privacy in federated learning with heterogeneous data.
method Careful co-design of verifiable secret sharing, secure aggregation, and private information retrieval scheme.
result Achieves information-theoretic privacy guarantees and Byzantine resilience under data heterogeneity.
A one-factor asset pricing model with an Ornstein--Uhlenbeck process as its state variable is studied under partial information: the mean-reverting level and the mean-reverting speed parameters are modeled as hidden/unobservable stochastic variables. No-arbitrage pricing formulas for derivative securities written on a …
Securely evaluates the benefits of merging datasets for causal estimation.
problem Challenges in assessing the value of merging datasets for causal treatment effect estimation.
method Cryptographically secure multi-party computation to evaluate Expected Information Gain (EIG) while ensuring privacy.
result Demonstrates the first privacy-preserving method for dataset acquisition tailored to causal estimation.
Collaborative (federated) learning enables multiple parties to train a model without sharing their private data, but through repeated sharing of the parameters of their local models. Despite its advantages, this approach has many known privacy and security weaknesses and performance overhead, in addition to being limit…
The paper studies derivative asset analysis in structural credit risk models where the asset value of the firm is not fully observable. It is shown that in order to compute the price dynamics of traded securities one needs to solve a stochastic filtering problem for the asset value. We transform this problem to a filte…
Secure SMMD enables data privacy in federated learning.
problem Data privacy in federated learning.
method Homomorphic encryption-based Secure Maximum Mean Discrepancy (SMMD).
result Secure SMMD avoids data leakage and enables effective knowledge transfer.
To assure cyber security of an enterprise, typically SIEM (Security Information and Event Management) system is in place to normalize security event from different preventive technologies and flag alerts. Analysts in the security operation center (SOC) investigate the alerts to decide if it is truly malicious or not. H…
It is customary that when security prices fully reflect all available information, the markets for those securities are said to be efficient. And if markets are inefficient, investors can use available information ignored by the market to earn abnormally high returns on their investments. In this context this paper tri…
SLIP secures LLMs on edge devices by splitting computation and protecting sensitive parts.
problem Protecting LLMs on edge devices from theft and unauthorized use.
method SLIP uses matrix decomposition to split model computation between secure and vulnerable resources, ensuring zero accuracy degradation and minimal latency.
result SLIP is the first practical, secure hybrid protocol for protecting LLMs on edge devices.
Platform uses queries to elicit investor preferences for portfolio trades, improving allocation efficiency.
problem Hidden-information problem in institutional crossing markets where investors value trades as portfolios but liquidity discovery is organized by individual securities.
method Modeling portfolio crossing as preference elicitation, using price-directed demand queries and value queries to verify selected packages.
result Hybrid procedure using demand and value queries recovers 88-95% of full-information welfare with a limited query budget.
Secure federated learning reduces privacy risks with differential privacy and secure multiparty computation.
problem Reverse engineering of private client data from federated learning model parameters.
method Combining differential privacy and secure multiparty computation.
result Improved accuracy of shared models without significant privacy loss.
New method protects neural networks from adversarial attacks without generating adversarial examples.
problem Vulnerability of neural networks to adversarial examples.
method Entropic retraining, inspired by information theory.
result Significant increase in NNs' security and robustness.
The problem of secure friend discovery on a social network has long been proposed and studied. The requirement is that a pair of nodes can make befriending decisions with minimum information exposed to the other party. In this paper, we propose to use community detection to tackle the problem of secure friend discovery…
Security, privacy, and fairness have become critical in the era of data science and machine learning. More and more we see that achieving universally secure, private, and fair systems is practically impossible. We have seen for example how generative adversarial networks can be used to learn about the expected private …
Paper proposes efficient privacy-preserving matrix encryption for secure collaborative learning against malicious adversaries.
problem Secure collaborative learning of sensitive data across different agencies is challenging with malicious adversaries.
method The paper applies matrix encryption to secure data against chosen plaintext attack, known plaintext attack, and collusion attack, achieving local differential privacy and high computation efficiency.
result The proposed schemes are computationally efficient and secure against malicious adversaries compared to existing techniques.
Paper analyzes InstaHide's security, recovering all private images with provable guarantee.
problem Protecting privacy of training data in neural networks.
method Unified framework to understand and analyze attacks on InstaHide, presenting a new algorithm to recover all private images with provable guarantee.
result InstaHide is computationally secure but not information-theoretically secure when mixing two private images.
Privacy concern has been increasingly important in many machine learning (ML) problems. We study empirical risk minimization (ERM) problems under secure multi-party computation (MPC) frameworks. Main technical tools for MPC have been developed based on cryptography. One of limitations in current cryptographically priva…
PrivacyFL simulates privacy-preserving federated learning.
problem Ensuring privacy in federated learning environments.
method Extensible, configurable simulator for federated learning.
result PrivacyFL checks feasibility and improves model accuracy.
In this paper we introduce a class of information-based models for the pricing of fixed-income securities. We consider a set of continuous- time information processes that describe the flow of information about market factors in a monetary economy. The nominal pricing kernel is at any given time assumed to be given by …
Post-Quantum Secure Federated DeFi for Inclusive Banking
problem Financial systems and DeFi ecosystems are vulnerable to quantum computing threats.
method Post-Quantum Secure Federated DeFi framework using lattice-based FHE.
result End-to-end homomorphic computation enables inter-bank collaboration.
Study shows SEC crypto classification led to significant market reactions.
problem Impact of SEC classification of crypto assets as securities.
method Event study methodology focusing on explicitly named crypto assets.
result Significant adverse market reactions, with returns plummeting 12% over one week.
This work develops secure distributed algorithms for machine learning to protect against data poisoning and network attacks.
problem Vulnerability of distributed machine learning algorithms to cyber threats.
method Game-theoretic framework to capture conflicting goals of a learner and an attacker, iterative distributed algorithm.
result Distributed SVM is prone to fail in different types of attacks, with impact depending on network structure and attack capabilities.
Safe-House secures DeFi by limiting losses and enhancing security.
problem Ongoing hacks and security concerns in DeFi.
method Safe-House uses blockchain principles to secure asset movements.
result Safe-House limits maximum one-time loss to specified limits.
In this paper, we generalize the Almgren-Chriss's market impact model to a more realistic and flexible framework and employ it to derive and analyze some aspects of optimal liquidation problem in a security market. We illustrate how a trader's liquidation strategy alters when multiple venues and extra information are b…
In machine learning (ML) security, attacks like evasion, model stealing or membership inference are generally studied in individually. Previous work has also shown a relationship between some attacks and decision function curvature of the targeted model. Consequently, we study an ML model allowing direct control over t…
In this work, we study a dynamic portfolio optimization problem related to pairs trading, which is an investment strategy that matches a long position in one security with a short position in another security with similar characteristics. The relationship between pairs, called a spread, is modeled by a Gaussian mean-re…
Novel algorithm for privacy-preserving distributed learning in analog domain.
problem Privacy-preserving distributed learning over analog data.
method Proposes a novel algorithm for analog data, leveraging real/complex number representation and information-theoretic security metrics.
result Demonstrates a fundamental trade-off between privacy and accuracy in analog domain distributed learning.
Research shows collective learning across diverse environments is hard due to privacy and security concerns.
problem Privacy, security, and equity concerns restrict information sharing in diverse AI environments.
method Characterized learning algorithms as choice correspondences, provided minimum requirements for rational learning algorithms.
result The only rational learning algorithm in heterogeneous environments is unilaterally learning from a single environment without information sharing.