Research
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

2825658471,129 · Jun 202019922001200920172026
48 results for data security

Securely trains regression models with secret sharing for data collaboration.

problem Balancing data collaboration for technological improvements with security concerns.
method Secret sharing scheme for scalable and efficient secure multiparty training.
result Scalable and efficient protocols for training linear and logistic regression models.

A system for federated learning with private data, adding discrete Gaussian noise and secure aggregation.

problem Training models on private data distributed across devices while ensuring privacy.
method Discretizes data, adds discrete Gaussian noise, and uses secure aggregation to protect privacy.
result Matches the accuracy of central differential privacy with less than 16 bits of precision per value.

Sparse oblique decision tree improves security rules for renewable power systems.

problem Identifying secure operating conditions in power systems with high renewable energy.
method Sparse weighted oblique decision tree to learn and embed linear security rules.
result The method significantly increases secure states and reduces solution time.

New study analyzes security of neural network data reconstruction attacks.

problem Data reconstruction attacks pose a threat to private training data.
method Analyzes security boundary of data reconstruction attacks via neuron exclusivity state.
result Characterizes insecure/secure boundary of data reconstruction attacks.

Secure Aggregation protocols allow a collection of mutually distrust parties, each holding a private value, to collaboratively compute the sum of those values without revealing the values themselves. We consider training a deep neural network in the Federated Learning model, using distributed stochastic gradient descen…

2016-11-14abs ↗pdf ↗

The paper explores how mining costs, rewards, and blockchain security are interconnected.

problem Understanding the interdependencies between mining costs, mining rewards, and blockchain security.
method Theoretical derivation and empirical analysis using daily crypto market data and autoregressive distributed lag approach.
result Cryptocurrency price and mining rewards are intrinsically linked to blockchain security outcomes.

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.

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.

Contextual bandit framework improves revenue optimization in securities lending market.

problem Optimizing revenue for agent lenders in a dynamic securities lending market.
method Utilized contextual bandit frameworks to address dynamic pricing problems in an e-commerce-like securities lending market.
result Contextual bandit approach consistently outperforms traditional methods by at least 15% in total revenue generated.

SafeML monitors ML systems for safety and security risks.

problem Ensuring safety and explainability of ML systems in safety-critical domains.
method Statistical difference measures of ECDF to detect distributional shifts.
result Approach can detect invalid application contexts of ML components.

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.

To promote secure and private artificial intelligence (SPAI), we review studies on the model security and data privacy of DNNs. Model security allows system to behave as intended without being affected by malicious external influences that can compromise its integrity and efficiency. Security attacks can be divided bas…

2018-07-31abs ↗pdf ↗

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.

A strategy to beat benchmarks by investing in heavily shorted but fundamentally sound securities.

problem Overcoming behavioral biases in investing, particularly the 'rebound effect'.
method Quantitative metrics, historical data, and securities lending modeling.
result The Bounce Basket strategy can outperform market returns during market downturns.

Secure sum outperforms homomorphic encryption in collaborative deep learning.

problem Training deep learning models on private data from multiple parties without revealing the data.
method Used a secure sum protocol in conjunction with default secure channels.
result Secure sum protocol provides superior properties in terms of collusion-resistance and runtime.

Optimizes a portfolio for an investor preferring accepted securities over a reference security.

problem Investor preference for a set of securities over a reference security with constraints.
method Mean-variance optimization with Sharpe Ratio performance measurement.
result Derives an optimal portfolio that maximizes returns while minimizing risk.

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 O(TMd+Md)O(\sqrt{T M d} + M d), outperforming baselines.

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.

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.

The article presents a new entropy model for assessing stock market interest.

problem Assessing investor interest and market sentiment in exchange-traded securities.
method Intrinsic entropy model using actual trading data, without exogenous factors.
result Empirical evidence supports the model's ability to predict trading activity.

Market-based portfolio variance measures risks using trade data.

problem Measuring portfolio risks using traditional methods ignores trade volume randomness.
method Uses time series of trades with securities and portfolio to assess variance.
result Portfolio variance can be decomposed into securities' contributions, accounting for trade volume randomness.

Secure federated learning framework resists adversarial users.

problem Resilience against adversarial (Byzantine) users in federated learning.
method Integrated stochastic quantization, verifiable outlier detection, and secure model aggregation.
result First single-server Byzantine-resilient secure aggregation framework (BREA) for secure federated learning.

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.

Paper revisits PCA for anomaly detection in network security.

problem Understanding and improving anomaly detection in network security.
method Revisit probabilistic PCA model and its connection to MSNM framework.
result Mathematical model connects PCA to MSNM for anomaly detection.