A pair of points in a riemannian manifold is secure if the geodesics between the points can be blocked by a finite number of point obstacles; otherwise the pair of points is insecure. A manifold is secure if all pairs of points in are secure. A manifold is insecure if there exists an insecure point pair, and to…
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,657 papers · 148 categories
Trend · papers per month
48 results for “Security Metrics”
New attacks reduce bad queries in black-box classifiers, improving effectiveness.
problem Evasion attacks often issue many bad queries, which are costly.
method Design new attacks that minimize bad queries while increasing non-bad queries.
result Reduces the number of bad queries by 1.5-7.3 times, improving attack effectiveness.
As neural networks revolutionize many applications, significant privacy conflicts between model users and providers emerge. The cryptography community developed a variety of techniques for secure computation to address such privacy issues. As generic techniques for secure computation are typically prohibitively ineffec…
The accurate measurement of security metrics is a critical research problem because an improper or inaccurate measurement process can ruin the usefulness of the metrics, no matter how well they are defined. This is a highly challenging problem particularly when the ground truth is unknown or noisy. In contrast to the w…
New method uses model's generalization gap to predict membership inference attacks.
problem Predicting membership inference attacks on machine learning models.
method Uses the model's generalization gap as a metric to estimate the vulnerability to membership inference attacks.
result Demonstrates that the model's generalization gap provides an upper bound on MIA security.
Study forecasts food security trends using real-time data.
problem Food insecurity prediction for sub-national regions.
method Quantitative methodology combining various machine learning models.
result Reservoir Computing model performs best in food security prediction.
Paper introduces differential pairwise privacy for secure metric learning.
problem Securely measuring similarities of individuals given sensitive pairwise data.
method Develops differential pairwise privacy (DPP) to protect sensitive pairwise data.
result Achieves pairwise data privacy without significant performance loss.
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.
New framework assesses LLM security risks in BFSI.
problem Lack of domain-specific security evaluation for LLMs in BFSI.
method Risk-aware evaluation framework combining taxonomy, automated red-teaming, and ensemble judging.
result Higher decoding stochasticity and adaptive interaction lead to more severe disclosures.
QFNN-FFD uses quantum computing and FL for secure financial fraud detection.
problem Financial fraud detection in the financial sector.
method Quantum Federated Neural Network (QFNN-FFD) combining QML and FL.
result Achieves precision rates above 95% and robustness against noise.
Compound Finance optimizes risk metrics for V3 protocol using Chainrisk simulations.
problem Optimizing systemic risks in Compound V3 protocol.
method Millions of Chainrisk simulations to evaluate VaR and LaR, providing parameter adjustments.
result Optimization framework enhances protocol stability.
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.
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.
Recent changes to greenhouse gas emission policies are catalyzing the electric vehicle (EV) market making it readily accessible to consumers. While there are challenges that arise with dense deployment of EVs, one of the major future concerns is cyber security threat. In this paper, cyber security threats in the form o…
Study shows Bitcoin security tied to mining rewards and prices.
problem Understanding Bitcoin security's dependency on market outcomes.
method Used ARDL approach with daily blockchain and Bitcoin data from 2014-2019.
result Bitcoin security outcomes linked to Bitcoin price and mining rewards.
Supervised Similarity for High-Yield Corporate Bonds with Quantum Cognition Machine Learningq-fin.ST
QCML improves bond similarity learning in illiquid markets.
problem Improving similarity learning for illiquid corporate bonds.
method Quantum Cognition Machine Learning (QCML) for supervised distance metric learning.
result QCML outperforms classical tree-based models in high-yield markets.
A pair of points in a riemannian manifold makes a secure configuration if the totality of geodesics connecting them can be blocked by a finite set. The manifold is secure if every configuration is secure. We investigate the security of compact, locally symmetric spaces.
Quantifying the Blockchain Trilemma: A Comparative Analysis of Algorand, Ethereum 2.0, and Beyondecon.GN
This study evaluates Algorand and Ethereum 2.0 for blockchain trilemma challenges.
problem Balancing decentralization, security, and scalability in blockchain systems.
method Comparative analysis of Algorand and Ethereum 2.0 using metrics for decentralization, scalability, and security.
result Each system has strengths in addressing the blockchain trilemma, providing insights for other blockchain technologies.
We say that a pair of points x and y is secure if there exist a finite set of blocking points such that any geodesic between x and y passes through one of the blocking points. The main point of this paper is to exhibit new examples of blocking phenomena both in the manifold and the billiard table setting. As an approac…
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.
RL models improve target control in SSGs for security applications.
problem Improving RL algorithms for target control in SSGs.
method Investigates improvements to target representations in RL algorithms.
result Enhanced RL models control targets better in SSGs.
Security for Machine Learning-based Systems: Attacks and Challenges during Training and Inferencecs.LG
The exponential increase in dependencies between the cyber and physical world leads to an enormous amount of data which must be efficiently processed and stored. Therefore, computing paradigms are evolving towards machine learning (ML)-based systems because of their ability to efficiently and accurately process the eno…
A riemannian manifold is secure if the geodesics between any pair of points in the manifold can be blocked by a finite number of point obstacles. Compact, flat manifolds are secure. A standing conjecture says that these are the only secure, compact riemannian manifolds. The conjecture claims, in particular, that a riem…
New model values equity-linked securities with guaranteed return.
problem Valuation of equity-linked securities with guaranteed return.
method Replicate security price as sum of guaranteed amount and Asian style option price on basket.
result Analytical formulas derived for security price and hedge ratios.
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.
Paper proposes a secure protocol for federated learning.
problem Combining robustness, privacy, and security in federated learning.
method Secure two-server protocol for federated learning.
result Offers both input privacy and Byzantine-robustness.
Autogov uses RL to automate DeFi governance, improving security and profitability.
problem Manual DeFi governance is prone to human bias and financial risks.
method Autogov employs a deep Q-network reinforcement learning strategy for semi-automated parameter adjustments.
result Autogov outperforms traditional governance methods by at least 14% in terms of protocol profitability.
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.
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…
Understanding Training-Data Leakage from Gradients in Neural Networks for Image Classificationstat.ML
This paper analyzes how training data can be leaked from gradients in neural networks and proposes a metric for measuring model security.
problem Training data leakage from gradients in neural networks for image classification.
method Formulated the problem as an optimisation problem for each layer, involving weights, gradients, and constraints from preceding layers.
result Attributed training data leakage to the architecture of the deep network and proposed a metric for measuring model security.
Explores security challenges of machine learning in real-world systems.
problem Vulnerabilities in machine learning models deployed in safety-critical systems.
method Broadens systems security view of ML vulnerabilities, identifies novel challenges, proposes mitigation suggestions.
result Highlights novel challenges and proposes mitigation strategies for securing ML systems.
Deep learning is increasingly used as a building block of security systems. Unfortunately, neural networks are hard to interpret and typically opaque to the practitioner. The machine learning community has started to address this problem by developing methods for explaining the predictions of neural networks. While sev…
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 …
The paper establishes conditions for Bayesian consistency in supremum metric.
problem Ensuring Bayesian consistency in the supremum metric.
method Using a triangle inequality and weak convergence, the paper establishes conditions for Bayesian consistency.
result Demonstrates supremum consistency with weaker conditions than previously used.
This paper discusses adversarial attacks on cyber security systems using machine learning.
problem Adversarial attacks limit the use of machine learning in cyber security.
method Characterizes adversarial attack methods and their applications in cyber security.
result Highlights unique challenges and future research directions for adversarial attacks in cyber security.
Unified market-based description of returns and variances of trades.
problem Market-based variance of trades and market portfolio.
method Unified market-based approach to describe returns and variances of trades and market portfolio.
result Market-based variance accounts for random volumes of trades and differs from Markowitz's portfolio variance.
We propose a new randomized ensemble technique with a provable security guarantee against black-box transfer attacks. Our proof constructs a new security problem for random binary classifiers which is easier to empirically verify and a reduction from the security of this new model to the security of the ensemble classi…
The Role of Cost in the Integration of Security Features in Integrated Circuits for Smart Cardsq-fin.RM
Investigates the cost-effectiveness of security features in smart card chips.
problem Costs of adding security features to smart card chips.
method Examines production phases, costs, and security features.
result Security features are worth the cost due to potential damages from attacks.
We develop a secure aggregation protocol for federated learning that reduces communication and computation costs.
problem Expensive communication and privacy concerns in federated learning.
method Adapting compression-based federated techniques to additive secret sharing.
result Our protocol achieves high accuracy with low communication costs and is more efficient than prior work.
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.
Study assesses how much security restaking protocols need to pay for.
problem Determining the optimal security level for restaking protocols using token incentives.
method Expanding a model by Durvasula and Roughgarden to include strategic attackers and node operators, constructing an approximation algorithm for token-based incentives.
result Restaking protocols can be secure with proper incentive management, even against strategic adversaries.
The future Internet of Things (IoT) will have a deep economical, commercial and social impact on our lives. The participating nodes in IoT networks are usually resource-constrained, which makes them luring targets for cyber attacks. In this regard, extensive efforts have been made to address the security and privacy is…
Survey examines ML for IoT security, addressing new challenges.
problem IoT security challenges due to rapid growth and diverse attacks.
method Comprehensive literature review of ML-based security solutions.
result ML provides dynamic and efficient security for IoT.
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.
The study calculates securities lending haircuts and indemnification costs.
problem Managing borrower default risk in securities markets.
method Repo haircut model applied to securities lending transactions; quantifies haircuts and indemnification costs.
result Computed borrower-dependent haircuts and indemnification costs for US Treasuries and equities.
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.
This paper optimizes cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.
problem Optimizing cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.
method Combining strategic behavior of players with contagion dynamics, a method is extended to determine optimal resource allocation based on simple network metrics weighted by risk profiles.
result The asymmetry between attacker and defender valuations drives optimal attack and defense strategies, shaping system resilience.
Securely trains neural networks remotely with deep learning's flaws.
problem Secure and efficient training of neural networks over unsecured channels.
method Leverages deep learning's weaknesses for secure training.
result Efficient and secure training of neural networks remotely.