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.
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.
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.
Paper develops security model and pricing for stable digital currency in quantum blockchain network.
problem Securing and pricing stable digital currency in a quantum blockchain network.
method Developed a block-based quantum channel networking technology and a FinTech platform model with dynamic pricing.
result Established a generalized IoB security model using quantum channel networking and QKD.
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…
Paper tackles multiplayer symmetric games, securing equal share for n players.
problem Multiplayer games lack unique equilibria, making guarantees unreliable.
method Identifies conditions for equal share, designs efficient algorithms inspired by no-regret learning.
result Proves algorithms achieve approximate equal share across various settings.
Privacy is a major issue in learning from distributed data. Recently the cryptographic literature has provided several tools for this task. However, these tools either reduce the quality/accuracy of the learning algorithm---e.g., by adding noise---or they incur a high performance penalty and/or involve trusting externa…
Our work specifies the fundamental cost of using secure aggregation in federated learning.
problem Training a distributed model with differential privacy constraints.
method Characterized the communication cost required for optimal accuracy under differential privacy, achieved by a linear scheme.
result The fundamental communication cost is $ ilde{O}\left( \min(n^2\varepsilon^2, d)
ight)$ bits per client, both sufficient and necessary.
Federated learning promises to make machine learning feasible on distributed, private datasets by implementing gradient descent using secure aggregation methods. The idea is to compute a global weight update without revealing the contributions of individual users. Current practical protocols for secure aggregation work…
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.
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.
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.
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…
Industry lacks tools to secure ML systems, study finds.
problem Insufficient security tools for ML systems in industry.
method Interviews with 28 organizations to identify gaps.
result Need revised Security Development Lifecycle for ML.
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.
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…
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.
Differentially private method for synthetic data generation from vertically partitioned data.
problem Generating synthetic data from vertically partitioned data while preserving privacy.
method Differentially private stochastic gradient descent (DP-SGD) algorithm combined with secure multiparty computation (MPC).
result Comparable accuracy to non-partitioned data, demonstrating privacy-preserving synthetic data generation.
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.
PBM mechanism improves privacy and accuracy in federated learning.
problem Secure and private federated learning with limited privacy budget.
method Poisson Binomial mechanism for discrete differential privacy.
result Achieves same privacy-accuracy trade-offs as Gaussian mechanism.
We develop a fundamentally different stochastic dynamic programming model of trading costs. Built on a strong theoretical foundation, our model provides insights to market participants by splitting the overall move of the security price during the duration of an order into the Market Impact (price move caused by their …
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…
Many applications of machine learning, for example in health care, would benefit from methods that can guarantee privacy of data subjects. Differential privacy (DP) has become established as a standard for protecting learning results. The standard DP algorithms require a single trusted party to have access to the entir…
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 models financial markets using information theory to minimize information.
problem Understanding the dynamics of financial markets.
method Modeling financial market dynamics with independent stationary scalar diffusions, interpreting the market as a communication system, and minimizing information-theoretical joint information.
result Financial market dynamics are represented by squared radial Ornstein-Uhlenbeck processes with additivity and self-similarity properties.
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…
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.
Outlier detection methods have become increasingly relevant in recent years due to increased security concerns and because of its vast application to different fields. Recently, Pauwels and Lasserre (2016) noticed that the sublevel sets of the inverse Christoffel function accurately depict the shape of a cloud of data …
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.
New method recovers radar and communication signals from overlaid data.
problem Recover radar and communication signals from overlaid data with unknown parameters.
method Propose minimizing the sum of multivariate atomic norms (SoMAN) for multi-antenna receiver.
result Minimum number of samples and antennas required for perfect recovery is logarithmically dependent on the maximum of radar targets and communications paths.
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.
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.
The paper analyzes security issues in blockchain ecosystems with multiple SSPs and proposes two models for better stake management.
problem Security issues in blockchain ecosystems with multiple SSPs and stake fragmentation.
method Formalized the Multiple SSP Problem and analyzed two architectures: Model M and Model S through convex optimization and game-theoretic lens. result Model S achieves tighter security guarantees through single validator sets and aggregated slashing logic. We present cyber-security problems of high importance. We show that in order to solve these cyber-security problems, one must cope with certain machine learning challenges. We provide novel data sets representing the problems in order to enable the academic community to investigate the problems and suggest methods to c…
Securely share encrypted data for machine learning training.
problem Securely sharing encrypted data for machine learning training without revealing the data.
method Rotation based method using flow model.
result Theoretical justification and demonstration of effectiveness in different scenarios.